Advertisement

Two-level expression representation for faster evaluation

  • John Staples
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 153)

Abstract

This paper proposes a solution to the problem of implementing an optimal evaluation strategy for the lambda calculus. The solution uses in a substantial way the notion of composition of rewriting rules, first studied by Ehrig and others, in the ‘algebraic’ approach to graph grammars, under the name ‘concurrent productions’.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    de Bruijn, N.G., Lambda calculus notation with nameless dummies, Nederl. Akad. Wetensch. Proc. Ser. A 75 (1972) 381–392.Google Scholar
  2. 2.
    Lévy, J.-J., Réductions correctes et optimales dans le λ-calcul, Thèse, U.Paris VII, 1978.Google Scholar
  3. 3.
    Lévy, J.-J., Optimal reductions in the lambda calculus, in “To H.B.Curry: Essays on Combinatory Logic, Lambda Calulus and Formalism”, editors J.P.Seldin and J.R.Hindley, Academic Press, London, 1980, 159–191.Google Scholar
  4. 4.
    Staples, John, A class of replacement systems with simple optimality theory, Bull. Austral. Math. Soc 17 (1977) 335–350.Google Scholar
  5. 5.
    Staples, John, A graph-like lambda calculus for which leftmost-outermost reduction is optimal, in “Graph Grammars and their Application to Computer Science and Biology”, eds V.Claus, H.Ehrig and G.Rozenberg, Lecture Notes in Computer Science No. 73, Springer, 1979.Google Scholar
  6. 6.
    Staples, John, Computation on graph-like expressions, Theor. Comput. Sci., 10 (1980) 171–85.Google Scholar
  7. 7.
    Staples, John, Optimal evaluations of graph-like expressions, Theor. Comput. Sci., 10 (1980) 297–316.Google Scholar
  8. 8.
    Staples, John, Speeding up subtree replacement systems, Theor. Comput. Sci., 11 (1980) 39–47.Google Scholar
  9. 9.
    Staples, John, Efficient evaluation of lambda expressions: a new strategy, Univ. of Queensland Dept of Computer Science Tech. Report No. 23, December 1980.Google Scholar
  10. 10.
    Staples, John, A new strategy for efficient lazy evaluation of lambda expressions, Australian Computer Science Communications 4 (1982) 277–285.Google Scholar
  11. 11.
    Staples, John, Two-level expression representation for faster evaluation, Univ. of Queensland Dept of Computer Science Tech. Report No. 43, September 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • John Staples
    • 1
  1. 1.Department of Computer ScienceUniversity of QueenslandSt. LuciaAustralia

Personalised recommendations