Abstract
In a previous paper we have established the theory of trans-finite 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.
Cite
CITATION STYLE
APA
Kennaway, R., Klop, J. W., Sleep, R., & De Vries, F. J. (1995). Infinitary lambda calculi and böhm models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 914, pp. 257–270). Springer Verlag. https://doi.org/10.1007/3-540-59200-8_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free