Author:
Barendregt Henk,Endrullis Jörg,Klop Jan Willem,Waldmann Johannes
Publisher
Springer International Publishing
Reference61 articles.
1. Baader, F., & Nipkow, T. (1998). Term rewriting and all that. Cambridge: Cambridge University Press.
2. Barendregt, H. (1971). Some extensional term models for combinatory logics and $$\lambda $$ -calculi. Ph.D. thesis, University Utrecht.
3. Barendregt, H. (1975). Problem 97 of the RTA List of Open Problem. http://www.win.tue.nl/rtaloop/problems/97.html .
4. Barendregt, H. (1984). The lambda calculus, its syntax and semantics, Vol. 103 of Studies in Logic and The Foundations of Mathematics. North-Holland, revised edition.
5. Barendregt, H. (1992a). Representing ‘undefined’ in lambda calculus. Journal of Functional Programming, 2(3), 367–374.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The combinator M and the Mockingbird lattice;Mathematical Structures in Computer Science;2022-03