Models of the lambda calculus

From MaRDI portal





Three ways of introducing models of the \(\lambda\)-calculus and the weaker concept of a \(\lambda\)-algebra have recently been used by various authors. These are environmental models (structures \(M=(| M|,.)\) with maps \([[.]]_{\rho}\): \(\lambda\)-terms (with constants from M) \(\to | M|\), satisfying some natural conditions), first order models (based on the combinators K and S) and categorical models (which are cartesian closed categories). Each way has clear advantages. The present author proves the equivalence of the environmental and first order approaches and using methods due to Scott defines a class of categorical structures which consists of all \(\lambda\)-algebras and \(\lambda\)-models. This, categorical description, the author says, gives a convincing argument that the \(\lambda\)-algebras and \(\lambda\)-models form a natural class of interpretations of the \(\lambda\)-calculus.




Cited in
(40)








This page was built for publication: Models of the lambda calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329436)