论文信息 - Infinitary Lambda Calculi and Böhm Models

Infinitary Lambda Calculi and Böhm Models

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 Bohm-like models of the lambda calculus, and new descriptions of existing models.

Jan Willem Klop | Richard Kennaway | M. Ronan Sleep | Fer-Jan de Vries

[1] Jan Willem Klop,et al. Transfinite Reductions in Orthogonal Term Rewriting Systems , 1995, Inf. Comput..

[2] Zena M. Ariola,et al. Syntactic Definitions of Undefined: On Defining the Undefined , 1994, TACS.

[3] J. R Kennaway. On transfinite abstract reduction systems , 1992 .

[4] C.-H. Luke Ong,et al. Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..

[5] Benedetto Intrigila,et al. Church-Rosser l-theories, infinite l-terms and consistency problems , 1996 .

[6] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .