Author:
Kennaway Richard,Severi Paula,Sleep Ronan,de Vries Fer-Jan
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Lecture Notes in Computer Science;Z.M. Ariola,1994
2. Ariola, Z.M., Klop, J.W.: Cyclic lambda graph rewriting. In: Proceedings of the 8th IEEE Symposium on Logic in Computer Science, pp. 416–425 (1994)
3. Barendregt, H.P.: The type free lambda calculus. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 1091–1132. North-Holland Publishing Company, Amsterdam (1977)
4. Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam (1984) (Revised edition)
5. Berarducci, A.: Infinite λ-calculus and non-sensible models. In: Logic and algebra (Pontignano, 1994), pp. 339–377. Dekker, New York (1996)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus;Logic, Language, Information and Computation;2011
2. Applications of infinitary lambda calculus;Information and Computation;2009-05
3. Comparing Böhm-Like Trees;Rewriting Techniques and Applications;2009
4. Normalization of Infinite Terms;Rewriting Techniques and Applications