ated 3302001).pdfVIP

1Functional Programming in LISP Yuh-Jzer Joung Dept. of Information Management National Taiwan University March, 2001 Spring, 2001 LISP 2 LISP Design by John McCarthy, 1958. The first language to provide recursion, first-class function, garbage collection, and a formal language definition (in LISP itself). LISP has been called “Lots of Silly Parentheses”. LISP programs are untyped. LISP implementations have been inefficient in the past. 2Spring, 2001 LISP 3 DYNAMIC VS. STATIC SCOPE Use dynamic scope, which leave a program sensitive to the choice of a local names within functions. begin integer x := 0; procedure P; begin print(x); end; procedure Q; begin integer x := 1; P; end; Q end static scope: print 0; dynamic scope: print 1; Spring, 2001 LISP 4 SCHEME: A DIALECT OF LISP Design by Steele and Sussman, 1975. Scheme is a relatively small language that provides constructs at the core of Lisp. Use lexical scope and supports true first-class functions. Interactions with Scheme interpreter : – Supply an expression to be evaluated. – Bind a name to a value. 3.14159 ; a number evaluates to itself 3.14159 (define pi 3.14159); bind a variable to a value pi pi ; a variable evaluates to its value 3.14159 pI ; pi and pI are the same name 3.14159 3Spring, 2001 LISP 5 COMMON LISP Common LISP was created in an effort to combine the features of several dialects of LISP developed in the early 1980s, including Scheme. It is a large and complex language. Its basis, however, is pure LISP. Recognizing the flexibility provided by dynamic scoping as well as the simplicity of static scoping, Common LISP allows both. The default is static, but by declaring a variable to be special, that variable becomes dynamically scoped. Spring, 2001 LISP 6 SCHEME vs. COMMON LISP Scheme Common Lisp (define pi 3.14159) (setq pi 3.14159) (define ( sq x) (* x x)) (defun sq (x) (* x x)) ((lambda (x) (* x x)) 5) ((lambda (x) (* x x)) 5) #t t #f () or nil number? numberp symbol? symbolp equal? equal nu