Show simple item record

dc.contributor.authorSussman, Gerald J.en_US
dc.contributor.authorSteele, Guy L., Jr.en_US
dc.date.accessioned2004-10-01T20:37:06Z
dc.date.available2004-10-01T20:37:06Z
dc.date.issued1975-12-01en_US
dc.identifier.otherAIM-349en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5794
dc.description.abstractInspired 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.en_US
dc.format.extent2956759 bytes
dc.format.extent2300855 bytes
dc.format.extent43 p.en_US
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-349en_US
dc.titleSCHEME: An Interpreter for Extended Lambda Calculusen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record