Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1982: Graph-Grammars and Their Application to Computer Science pp 392–404Cite as

Two-level expression representation for faster evaluation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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’.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Bruijn, N.G., Lambda calculus notation with nameless dummies, Nederl. Akad. Wetensch. Proc. Ser. A 75 (1972) 381–392.

    Google Scholar 

  2. Lévy, J.-J., Réductions correctes et optimales dans le λ-calcul, Thèse, U.Paris VII, 1978.

    Google Scholar 

  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. Staples, John, A class of replacement systems with simple optimality theory, Bull. Austral. Math. Soc 17 (1977) 335–350.

    Google Scholar 

  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. Staples, John, Computation on graph-like expressions, Theor. Comput. Sci., 10 (1980) 171–85.

    Google Scholar 

  7. Staples, John, Optimal evaluations of graph-like expressions, Theor. Comput. Sci., 10 (1980) 297–316.

    Google Scholar 

  8. Staples, John, Speeding up subtree replacement systems, Theor. Comput. Sci., 11 (1980) 39–47.

    Google Scholar 

  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. Staples, John, A new strategy for efficient lazy evaluation of lambda expressions, Australian Computer Science Communications 4 (1982) 277–285.

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Queensland, 4067, St. Lucia, Queensland, Australia

    John Staples

Authors
  1. John Staples
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Manfred Nagl Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Staples, J. (1983). Two-level expression representation for faster evaluation. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000121

Download citation

  • DOI: https://doi.org/10.1007/BFb0000121

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12310-1

  • Online ISBN: 978-3-540-39897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation