The MIT Libraries is completing a major upgrade to DSpace@MIT. Starting May 5 2026, DSpace will remain functional, viewable, searchable, and downloadable, however, you will not be able to edit existing collections or add new material. We are aiming to have full functionality restored by May 18, 2026 but intermittent service interruptions may occur. Please email dspace-lib@mit.edu
with any questions. Thank you for your patience as we implement this important upgrade.
Lambda Calculus Models of Programming Languages
| dc.contributor.advisor | Wozencraft, John M. | en_US |
| dc.contributor.author | Morris, James H. | en_US |
| dc.date.accessioned | 2023-03-29T14:53:52Z | |
| dc.date.available | 2023-03-29T14:53:52Z | |
| dc.date.issued | 1968-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149376 | |
| dc.description.abstract | Two aspects of programming languages, recursive definitions and type declarations are analyzed in detail. Church's -calculus is used as a model of a programming language for purposes of the analysis. The main result on recursion is an analogue to Kleene's first recursion theorem: If A= FA for any A-expressions A and F, then A is an extension of YF in the sense that if E[YE], any expressions containing YF, has a normal form then E[F] =E {A]. Y is Curry's paradoxical combinator. The result is shown to be invariant for many different versions of Y. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-057 | |
| dc.relation.ispartofseries | MAC-TR-057 | |
| dc.title | Lambda Calculus Models of Programming Languages | en_US |
| dc.identifier.oclc | 00114444 |
