SCHEME: An Interpreter for Extended Lambda Calculus

dc.creator	Sussman, Gerald J.
dc.creator	Steele, Guy L., Jr.
dc.date	2004-10-01T20:37:06Z
dc.date	2004-10-01T20:37:06Z
dc.date	1975-12-01
dc.date.accessioned	2013-10-09T02:41:20Z
dc.date.available	2013-10-09T02:41:20Z
dc.date.issued	2013-10-09
dc.identifier	AIM-349
dc.identifier	http://hdl.handle.net/1721.1/5794
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	Inspired by ACTORS [Greif and Hewitt] [Smith and Hewitt], we have implemented an interpreter for a LISP-like language, SCHEME, based on the lambda calculus [Church], but extended for side effects, multiprocessing, and process synchronization. The purpose of this implementation is tutorial. We wish to: (1) alleviate the confusion caused by Micro-PLANNER, CONNIVER, etc. by clarifying the embedding of non-recursive control structures in a recursive host language like LISP. (2) explain how to use these control structures, independent of such issues as pattern matching and data base manipulation. (3) have a simple concrete experimental domain for certain issues of programming semantics and style.
dc.format	2956759 bytes
dc.format	2300855 bytes
dc.format	43 p.
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-349
dc.title	SCHEME: An Interpreter for Extended Lambda Calculus

Files in this item

Files	Size	Format	View
There are no files associated with this item.