Abstract
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-like models of the lambda calculus, and new descriptions of existing models.
The authors were partially supported by SEMAGRAPH II (ESPRIT working group 6345). Richard Kennaway was also supported by a SERC Advanced Fellowship, and by SERC Grant no. GR/F 91582. From July 1995 Fer-Jan de Vries will be at the Hitachi Advanced Research Laboratory, Hatoyama, Saitama 350-03, Japan.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Z.M. Ariola, J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Syntactic definitions of undefined: On defining the undefined. In Int. Symp. on Theoretical Aspects of Computer Software, Sendai, pages 543–554, 1994. Lecture Notes in Computer Science, vol. 789.
S. Abramsky and L. Ong. Full abstraction in the lazy lambda calculus. Inf. and Comp., 105:159–267, 1993.
H.P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, 2nd edition, 1984.
A. Berarducci. Infinite λ-calculus and non-sensible models. Presented to the conference in honour of Roberto Magari, Siena 1994.
A. Berarducci and B. Intrigila. Church-rosser λ-theories, infinite λ-terms and consistency problems. Dipartimento di Matematica, Università di Pisa, October 1994.
J.R. Kennaway. On transfinite abstract reduction systems. Technical Report CS-9205, CWI, Amsterdam, 1992.
J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation, 199-. To appear; available by ftp from ftp::/ftp.sys.uea.ac.uk/pub/kennaway/transfinite. {dvi,ps}.Z.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kennaway, R., Klop, J.W., Sleep, R., de Vries, FJ. (1995). Infinitary lambda calculi and böhm models. In: Hsiang, J. (eds) Rewriting Techniques and Applications. RTA 1995. Lecture Notes in Computer Science, vol 914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59200-8_62
Download citation
DOI: https://doi.org/10.1007/3-540-59200-8_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59200-6
Online ISBN: 978-3-540-49223-8
eBook Packages: Springer Book Archive