Two aspects of programming languages, recursive definitions and type declarations are analyzed in detail, using Church's lambda-calculus as the programming language model. The main result on recursion is an analogue to Kleene's first recursion theorem: If A = FA for any lambda-expressions...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Morris, James H. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Cambridge, Mass. Project MAC, Mass. Inst. of Technology 1968
Schlagworte:	Algorithms Classification Computer Programming and Software Computer Systems Mathematical logic Programming languages Real time Recursive functions Semantics Theses Time sharing Programmiersprache Lambda-Kalkül
Zusammenfassung:	Two aspects of programming languages, recursive definitions and type declarations are analyzed in detail, using Church's lambda-calculus as the programming language model. The main result on recursion is an analogue to Kleene's first recursion theorem: If A = FA for any lambda-expressions A and F, then A is an extension of YF in the sense that if E(YF), any expression containing YF, has a normal form then E(YF) = E(A). Y is Curry's paradoxical combinator. The result is shown to be invariant for many different versions of Y. A system of types and type declarations is developed for the lambda-calculus and its semantic assumptions are identified. The system is shown to be adequate in the sense that it permits a preprocessor to check formulae prior to evaluation to prevent type errors. It is shown that any formula with a valid assignment of types to all its subexpressions must have a normal form. (Author).
Beschreibung:	Zugl.: Diss., 1968. - Kopie, erschienen bei National Techn. Information Service, Springfield, Va.
Beschreibung:	131 Bl.