Advertisement

Extending graph rewriting with copying

  • Erik Barendsen
  • Sjaak Smetsers
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 776)

Abstract

The notion of term graph rewrite system (TGRS) is extended with a lazy copying mechanism. By analyzing this mechanism, a confluence result is obtained for these so-called copy term graph rewrite systems (C-TGRS). Some ideas on the use of lazy copying in practice are presented.

Keywords

Normal Form Transitive Closure Label Graph Lambda Calculus Graph Operation 
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. Barendregt, H.P., M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer and M.R. Sleep [1987a] Term graph reduction, in: Proceedings of Parallel Architectures and Languages Europe (PARLE'87), Eindhoven, The Netherlands, LNCS 259, volume II, Springer-Verlag, Berlin, pp. 141–158.Google Scholar
  2. Barendregt, H.P., M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer and M.R. Sleep [1987b] Towards an intermediate language based on graph rewriting, in: Proceedings of Parallel Architectures and Languages Europe (PARLE'87), Eindhoven, The Netherlands, LNCS 259, volume II, Springer-Verlag, Berlin, pp. 159–175.Google Scholar
  3. Barendsen, E. and J.E.W. Smetsers [1992] Graph rewriting and copying, Technical report no. 92–20, Department of Computer Science, University of Nijmegen.Google Scholar
  4. Brus, T., M.C.J.D. van Eekelen, M.O. van Leer and M.J. Plasmeijer [1987] Glean: a language for functional graph rewriting, in: Proceedings of the 3rd International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, LNCS 274, Springer-Verlag, Berlin, pp. 364–384.Google Scholar
  5. Van Eekelen, M.C.J.D., M.J. Plasmeijer and J.E.W. Smetsers [1991] Parallel graph rewriting on loosely coupled machine architectures, in: Proceedings of Conditional and Typed Rewriting Systems (CTRS'90), Montreal, Canada, LNCS 516, Springer-Verlag, Berlin, pp. 354–369.Google Scholar
  6. Ehrig, H., M. Nagl, G. Rozenberg and A. Rosenfeld (eds.) [1987] Proceedings of the 3rd International Workshop on Graph-Grammars and the Application to Computer Science, Warrenton, Virginia, USA, December 1986, LNCS 291, Springer-Verlag, Berlin.Google Scholar
  7. Hindley, J.R. [1964] The Church-Rosser property and a result in Combinatory Logic, dissertation, University of Newcastle-upon-Tyne.Google Scholar
  8. Nöcker, E.G.J.M.H., J.E.W. Smetsers, M.C.J.D. van Eekelen and M.J. Plasmeijer [1991] Concurrent Clean, in: Proceedings of Parallel Architectures and Languages Europe (PARLE'91), Eindhoven, The Netherlands, LNCS 505, Springer-Verlag, Berlin, pp. 202–219.Google Scholar
  9. Rosen, B.K. [1973] Tree manipulation systems and Church-Rosser theorems, J. Assoc. Comput. Mach. 20, pp. 160–187.Google Scholar
  10. Smetsers, J.E.W., E.G.J.M.H. Nöcker, J.H.G. van Groningen and M.J. Plasmeijer [1991] Generating efficient code for lazy functional languages, in: Proceedings of Conference on Functional Programming Languages and Computer Architecture (FPCA '91), Cambridge, MA, LNCS 523, Springer-Verlag, Berlin, pp. 592–617.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Erik Barendsen
    • 1
  • Sjaak Smetsers
    • 1
  1. 1.Computing Science InstituteUniversity of NijmegenED NijmegenThe Netherlands

Personalised recommendations