Advertisement

Church-Rosser properties for graph replacement systems with unique splitting

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

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.

Keywords

Direct Derivation Replacement System Graph Grammar Lambda Calculus Derivation Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Hindley, R., Lercher, B., and Seldin, J.P., Introduction to Combinatory Logic, CUP, London and New York, 1972.Google Scholar
  4. 4.
    Hindley, R., Reductions of residuals are finite, Trans. Amer. Math. Soc. 240 (1978) 345–361.Google Scholar
  5. 5.
    Lévy, J.-J., Réductions correctes et optimales dans the λ-calcul, Thèse, U. Paris VII, 1978.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    Rosen, B.K., Tree-manipulating systems and Church-Rosser theorems, Journ. ACM 20 (1973) 160–187.Google Scholar
  8. 8.
    Staples, John, A new technique for analysing parameter passing, applied to the lambda calculus, Aust. Comp. Sci. Commun 3 (1981) 201–210.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • H. Ehrig
    • 2
  • J. Staples
    • 1
  1. 1.Department of Computer ScienceUniversity of QueenslandSt. LuciaAustralia
  2. 2.Fachbereich InformatikTechnische Universität1 Berlin 10Federal Republic of Germany

Personalised recommendations