Advertisement

Towards an intermediate language based on Graph Rewriting

  • H. P. Barendregt
  • M. C. J. D. van Eekelen
  • J. R. W. Glauert
  • J. R. Kennaway
  • M. J. Plasmeijer
  • M. R. Sleep
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 259)

Abstract

Lean is an experimental language for specifying computations in terms of graph rewriting. It is based on an alternative to Term Rewriting Systems (TRS) in which the terms are replaced by graphs. Such a Graph Rewriting System (GRS) consists of a set of graph rewrite rules which specify how a graph may be rewritten. Besides supporting functional programming, Lean also describes imperative constructs and allows the manipulation of cyclic graphs. Programs may exhibit non-determinism as well as parallelism. In particular, Lean can serve as an intermediate language between declarative languages and machine architectures, both sequential and parallel.

Keywords

Canonical Form Data Graph Functional Language Initial Graph Graph Reduction 
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.

9. References

  1. [BAR87]
    Barendregt, H.P., Eekelen, M.C.J.D. van, Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., Sleep, M.R., “Term Graph Reduction”, these proceedings, 1987.Google Scholar
  2. [BRU87]
    Brus, T., Eekelen, M.C.J.D. van, Leer, M. van, Plasmeijer, M.J., “Clean — A Language for Functional Graph Rewriting”, University of Nijmegen, Internal Report nr. 95, February 1987.Google Scholar
  3. [EEK86]
    Eekelen, M.C.J.D. van, Plasmeijer, M.J., “Specification of rewriting strategies in Term Rewriting Systems”, University of Nijmegen, Workshop on Graph Reduction, Santa Fe, 1986.Google Scholar
  4. [GLA87]
    Glauert, J.R.W., Kennaway, J.R., Sleep, M.R., “DACTL: A Computational Model and Compiler Target Language Based on Graph Reduction”, University of East Anglia 1987, Internal Report SYS-C87-03.Google Scholar
  5. [JAN87]
    Jansen, T, “Interpreting Lean”, Masters thesis, University of Nijmegen, may 1987.Google Scholar
  6. [KLO85]
    Klop, J.W., “Term rewriting systems”, Notes for the Seminar on Reduction Machines, Ustica 1985, to appear.Google Scholar
  7. [O'DO85]
    O'Donnell, M.J., “Equational Logic as a Programming Language”, Foundations of Computing Series, MIT Press, 1985.Google Scholar
  8. [STA80]
    Staples, J., “Computation on Graph-like Expressions”, Theor. Comp. Sc. 10, North-Holland, 1980, pp. 171–185.Google Scholar
  9. [VEG84]
    Vegdahl, Steven R., “A Survey of Proposed Architectures for the Execution of Functional Languages”, IEEE Transactions on Computers, vol. c-33, no. 12, december 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • H. P. Barendregt
    • 2
  • M. C. J. D. van Eekelen
    • 2
  • J. R. W. Glauert
    • 1
  • J. R. Kennaway
    • 1
  • M. J. Plasmeijer
    • 2
  • M. R. Sleep
    • 1
  1. 1.School of Information SystemsUniversity of East AngliaNorwichUK
  2. 2.Computing Science DepartmentUniversity of NijmegenNijmegenThe Netherlands

Personalised recommendations