Now showing items 2-4 of 4

    • Incremental Reduction in the Lambda Calculus 

      Field, John H.; Teitelbaum, Tim (Cornell University, 1990-05)
      An incremental 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 duplication of common computations. ...
    • Incremental Reduction in the Lambda Calculus and Related Reduction Systems 

      Field, John H. (Cornell University, 1991-11)
      An incremental algorithm is one that computes a function repeatedly on a series of inputs that differ only slightly from one another, yet avoids unnecessary duplication of computations from one input to the next. This ...
    • On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis 

      Field, John H. (Cornell University, 1990-02)
      In this paper, we introduce a new formal system, $\Lambda CCL$, based on Curien's Categorical Combinators [Cur86a]. We show that $\Lambda CCL$ has properties that make it especially suitable for analysis and implementation ...