Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5790Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Steele, Guy Lewis, Jr. | - |
| dc.creator | Sussman, Gerald Jay | - |
| dc.date | 2004-10-01T20:37:00Z | - |
| dc.date | 2004-10-01T20:37:00Z | - |
| dc.date | 1976-03-01 | - |
| dc.date.accessioned | 2013-10-09T02:41:19Z | - |
| dc.date.available | 2013-10-09T02:41:19Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-353 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5790 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | We demonstrate how to model the following common programmingsconstructs in terms of an applicative order language similar to LISP: Simple Recursion, Iteration, Compound Statements and Expressions, GO TO and Assignment, Continuation-Passing, Escape Expressions, Fluid Variables, Call by Name, Call by Need, and Call by Reference. The models require only (possibly self-referent) lambda application, conditionals, and (rarely) assignment. No complex data structures such as stacks are used. The models are transparent, involving only local syntactic transformations. This paper is partly tutorial in intent, gathering all the models together for purposes of context. | - |
| dc.format | 41 p. | - |
| dc.format | 2830438 bytes | - |
| dc.format | 2213506 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-353 | - |
| dc.title | Lambda: The Ultimate Imperative | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.