Infinitary lambda calculus

Theoretical Computer Science

Volumn 175, Issue 1, 1997, Pages 93-125

  Kennaway, J R ^a   Klop, J W ^b   Sleep, M R ^a   De Vries, F J ^c  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

^b CWI   (Netherlands)

^c HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; SET THEORY;

INFINITARY REWRITING; LAMBDA CALCULUS;

FORMAL LOGIC;

EID: 0031096225     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00171-5     Document Type: Article

References (8)

1. S. Abramsky and L. Ong, Full abstraction in the lazy lambda calculus, Inform. Comput. 105 (1993) 159-267.
2. H.P. Barendregt, The Lambda Calculus, its Syntax and Semantics (North-Holland, Amsterdam, 2nd ed. 1984).
3. A. Berarducci, Infinite λ-calculus and non-sensible models, in: Proc. Conf. in honour of Roberto Magari, Siena (1994); To appear in the series on Logic and Algebra, (Marcel Decker, New York).
4. A. Berarducci and B. Intrigila, Church-Rosser λ-theories, infinite λ-terms and consistency problems,In: W. Hodges and M. Hyland and C. Steinhorn and J. Truss, eds., Logic Colloquium '93 (Oxford Univ. Press, Oxford, 1996)
5. P.L. Curien, Categorical Combinators, Sequential Algorithms, and Functional Programming (Birkhäuser, Boston, 2nd ed., 1993).
6. J.R. Kennaway, On transfinite abstract reduction systems, Tech. Report CS-9205, CWI, Amsterdam, 1992.
7. J.R. Kennaway and J.W. Klop and M.R. Sleep and F.J. de Vries, Infinitary lambda calculus and Böhm models, in: Proc. Conf. on Rewriting Techniques and Applications, Lecture Notes in Computer Science, Vol. 914 (Springer, Berlin, 1995) 257-270.
8. J.R. Kennaway and J.W. Klop and M.R. Sleep and F.J. de Vries, Transfinite reductions in orthogonal term rewriting systems, Inform. Comput. 119(1) (1995) 18-38.