Lambda: The Ultimate Imperative
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, C...
| Main Authors: | , |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/5790 |
| _version_ | 1826207425133281280 |
|---|---|
| author | Steele, Guy Lewis, Jr. Sussman, Gerald Jay |
| author_facet | Steele, Guy Lewis, Jr. Sussman, Gerald Jay |
| author_sort | Steele, Guy Lewis, Jr. |
| collection | MIT |
| 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. |
| first_indexed | 2024-09-23T13:49:27Z |
| id | mit-1721.1/5790 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:49:27Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/57902019-04-11T04:54:29Z Lambda: The Ultimate Imperative Steele, Guy Lewis, Jr. Sussman, Gerald Jay 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. 2004-10-01T20:37:00Z 2004-10-01T20:37:00Z 1976-03-01 AIM-353 http://hdl.handle.net/1721.1/5790 en_US AIM-353 41 p. 2830438 bytes 2213506 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Steele, Guy Lewis, Jr. Sussman, Gerald Jay Lambda: The Ultimate Imperative |
| title | Lambda: The Ultimate Imperative |
| title_full | Lambda: The Ultimate Imperative |
| title_fullStr | Lambda: The Ultimate Imperative |
| title_full_unstemmed | Lambda: The Ultimate Imperative |
| title_short | Lambda: The Ultimate Imperative |
| title_sort | lambda the ultimate imperative |
| url | http://hdl.handle.net/1721.1/5790 |
| work_keys_str_mv | AT steeleguylewisjr lambdatheultimateimperative AT sussmangeraldjay lambdatheultimateimperative |