×

From finite to infinite lambda calculi. (English) Zbl 0819.03007

Summary: In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. This results in several new Böhm models of the lambda calculus, and new unifying descriptions of existing models.

MSC:

03B40 Combinatory logic and lambda calculus
PDFBibTeX XMLCite