Incremental Reduction in the lambda Calculus

@inproceedings{Field1990IncrementalRI,
  title={Incremental Reduction in the lambda Calculus},
  author={John Field and Tim Teitelbaum},
  booktitle={LISP and Functional Programming},
  year={1990}
}
An <italic>incremental</italic> algorithm is one that takes advantage of the fact that the function it computes is to be evaluated repeatedly on inputs that differ only slightly from one another, avoiding unnecessary duplication of common computations. We define here a new notion of incrementality for reduction in the untyped λ-calculus and describe an incremental reduction algorithm, Λ<supscrpt>inc</supscrpt>. We show that Λ<supscrpt>inc</supscrpt> has the desirable property of performing… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
34 Citations
0 References
Similar Papers

Citations

Publications citing this paper.

57 Citations

0246'91'97'04'11'18
Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…