Lambda Calculus Models of Programming Languages
Name
MIT-LCS-TR-057.pdf
Size
19.67 MB
Format
Adobe PDF
Checksum (MD5)
5456d2e32c2e1f0b3b28713726aa436b
Author(s)
Morris, James H.
Advisor(s)
Wozencraft, John M.
Date Issued
December 1968
Series/Report no.
MIT-LCS-TR-057
MAC-TR-057
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.
Persistent DSpace Link
