Incremental reduction in the lambda calculus
Authors:
Open Access
- 1 May 1990
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 307-322
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Explicit substitutions1990
- Incremental computation via function caching1989
- Needed reduction and spine strategies for the lambda calculusInformation and Computation, 1987
- The categorical abstract machineScience of Computer Programming, 1987
- Categorical combinatorsInformation and Control, 1986
- Finite Differencing of Computable ExpressionsACM Transactions on Programming Languages and Systems, 1982
- Optimal-time incremental semantic analysis for syntax-directed editors1982
- Incremental evaluation for attribute grammars with application to syntax-directed editors1981
- A lazy evaluator1976
- High level iterators and a method for automatically designing data structure representationComputer Languages, 1975