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.
References
de Bruijn, N.G., Lambda calculus notation with nameless dummies, Nederl. Akad. Wetensch. Proc. Ser. A 75 (1972) 381–392.
Lévy, J.-J., Réductions correctes et optimales dans le λ-calcul, Thèse, U.Paris VII, 1978.
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.
Staples, John, A class of replacement systems with simple optimality theory, Bull. Austral. Math. Soc 17 (1977) 335–350.
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.
Staples, John, Computation on graph-like expressions, Theor. Comput. Sci., 10 (1980) 171–85.
Staples, John, Optimal evaluations of graph-like expressions, Theor. Comput. Sci., 10 (1980) 297–316.
Staples, John, Speeding up subtree replacement systems, Theor. Comput. Sci., 11 (1980) 39–47.
Staples, John, Efficient evaluation of lambda expressions: a new strategy, Univ. of Queensland Dept of Computer Science Tech. Report No. 23, December 1980.
Staples, John, A new strategy for efficient lazy evaluation of lambda expressions, Australian Computer Science Communications 4 (1982) 277–285.
Staples, John, Two-level expression representation for faster evaluation, Univ. of Queensland Dept of Computer Science Tech. Report No. 43, September 1982.
Author information
Authors and Affiliations
Editor information
Rights 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