The Lambda Calculus: Its Syntax and SemanticsElsevier Science, 1984 - 621 strani The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course. |
Druge izdaje - Prikaži vse
Pogosti izrazi in povedi
A-calculus A-definable A₁ application axioms Barendregt binary relation Böhm trees BT(M BT(N cartesian closed category Church-Rosser theorem cofinal combinatory algebra combinatory logic complete lattice conservation theorem consistent Construct contracted corollary defined DEFINITION denotes diagram diagram chase elements equations equivalent example exercise extensional finite fixed point combinator fixed point theorem FV(M FV(P head reduction head variable Hence by lemma Hint induction hypothesis infinite Klop lambda calculus Let F M E A M₁ M₂ Moreover N₁ N₂ notation Note notion of reduction numeral system P₁ P₂ partial recursive function PROOF proposition proved reduction path residuals Scott Scott topology sequence Show Similarly solvable ẞn-nf's structure substitution subterm Suppose theory tree topology trivial unsolvable w-rule X-model X-terms X-theory X₁ βη λχ