Abstract
Although the theories of lambda calculus and graph grammars have many goals and techniques in common, there has been little serious study of what each has to offer the other.
In this paper we begin a study of what graph grammar theory can learn from the theory of the lambda calculus, by generalising a central argument of lambda calculus theory; the best-known proof of the Church-Rosser property for the lambda calculus. Applications to the lambda calculus and elsewhere are indicated.
Part of this author's work on this paper was done while visiting and being supported by the Department of Computer Science, University of Queensland.
We thank Annegret Habel and Peter Padawitz for helpful criticisms of a draft of this paper.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ehrig, H., Introduction to the algebraic theory of graph grammars, in “Graph-Grammars and their Application to Computer Science and Biology”, editors V.Claus, H.Ehrig and G.Rozenberg, Springer Lecture Notes in Computer Science 73 (1979), 1–69.
Ehrig, H., Kreowski, H.-J., Maggiolo-Schettini, A., Rosen, B.K. and Winkowski, J., Transformations of structures: an algebraic approach, Math. System Theory 14 (1981) 305–334.
Hindley, R., Lercher, B., and Seldin, J.P., Introduction to Combinatory Logic, CUP, London and New York, 1972.
Hindley, R., Reductions of residuals are finite, Trans. Amer. Math. Soc. 240 (1978) 345–361.
Lévy, J.-J., Réductions correctes et optimales dans the λ-calcul, Thèse, U. Paris VII, 1978.
Lévy, J.-J. Optimal reductions in the lambda calculus, in “To H.B. Curry: essays in combinatory logic, lambda calculus and formalism,” editors J.P. Seldin and J.R.Hindley, Academic Press, 1980, 159–191.
Rosen, B.K., Tree-manipulating systems and Church-Rosser theorems, Journ. ACM 20 (1973) 160–187.
Staples, John, A new technique for analysing parameter passing, applied to the lambda calculus, Aust. Comp. Sci. Commun 3 (1981) 201–210.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehrig, H., Staples, J. (1983). Church-Rosser properties for graph replacement systems with unique splitting. 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/BFb0000100
Download citation
DOI: https://doi.org/10.1007/BFb0000100
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