Lambda Calculus with Explicit Recursion
- 1 December 1997
- journal article
- Published by Elsevier in Information and Computation
- Vol. 139 (2) , 154-233
- https://doi.org/10.1006/inco.1997.2651
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Cyclic lambda graph rewritingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The call-by-need lambda calculusJournal of Functional Programming, 1997
- Relating graph and term rewriting via Böhm modelsApplicable Algebra in Engineering, Communication and Computing, 1996
- EQUATIONAL TERM GRAPH REWRITINGFundamenta Informaticae, 1996
- Properties of a first-order functional language with sharingTheoretical Computer Science, 1995
- A call-by-need lambda calculusPublished by Association for Computing Machinery (ACM) ,1995
- Interaction Systems I: The theory of optimal reductionsMathematical Structures in Computer Science, 1994
- Syntactic definitions of undefined: On defining the undefinedPublished by Springer Nature ,1994
- Explicit substitutionsJournal of Functional Programming, 1991
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977