Modeling sharing and recursion for weak reduction strategies using explicit substitution
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 393-407
- https://doi.org/10.1007/3-540-61756-6_99
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A call-by-need lambda calculusPublished by Association for Computing Machinery (ACM) ,1995
- A natural semantics for lazy evaluationPublished by Association for Computing Machinery (ACM) ,1993
- Term Rewriting SystemsPublished by Oxford University Press (OUP) ,1992
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machineJournal of Functional Programming, 1992
- An abstract framework for environment machinesTheoretical Computer Science, 1991
- Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systemsPublished by Association for Computing Machinery (ACM) ,1991
- A syntactic theory of sequential stateTheoretical Computer Science, 1989
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972