Cyclic lambda calculi
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 77-106
- https://doi.org/10.1007/bfb0014548
Abstract
No abstract availableKeywords
This publication has 22 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
- Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculiPublished by Springer Nature ,1997
- Relating graph and term rewriting via Böhm modelsApplicable Algebra in Engineering, Communication and Computing, 1996
- Modeling sharing and recursion for weak reduction strategies using explicit substitutionPublished by Springer Nature ,1996
- 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
- The structure of shared forests in ambiguous parsingPublished by Association for Computational Linguistics (ACL) ,1989
- Term graph rewritingPublished by Springer Nature ,1987