Term graph rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 259 LNCS, Issue , 1987, Pages 141-158

  Barendregt, H P ^a   van Eekelen, M C J D ^a   Glauert, J R W ^b   Kennaway, J R ^b   Plasmeijer, M J ^a   Sleep, M R ^b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b UNIVERSITY OF EAST ANGLIA   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURE; CALCULATIONS; DIFFERENTIATION (CALCULUS); FUNCTIONAL PROGRAMMING; PARALLEL ARCHITECTURES;

CHURCH-ROSSER PROPERTY; EFFICIENT IMPLEMENTATION; MATHEMATICAL DESCRIPTIONS; OPERATIONAL DESCRIPTION; REWRITE SYSTEMS; SOUNDNESS AND COMPLETENESS; TERM GRAPH REWRITING; TERM REWRITE SYSTEMS;

GRAPH THEORY;

EID: 84947921177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-17945-3_8     Document Type: Conference Paper

References (18)

1. Barendregt, H.P.(1984) The Lambda Calculus: its Syntax and Semantics (revised edition), North-Holland, Amsterdam.
2. Barendragt, H.P, M.CJD, van Eekelen, J.R.W. Glauert, LR. Kennaway, MJ. Plasmeijer and M.R. Sleep (1986) Term graph rewriting, Report 87, Department of Computer Science, University of Nijmegen, and also as Report SYS-C87-01, School of Information Systems, University of East Anglia.
3. Barendragt, H.P, M.CJD, van Eekelen, J.R.W. Glauert, LR. Kennaway, MJ. Plasmeijer and M.R. Sleep (1987) Towards an intermediate language based on graph rewriting, these proceedings.
4. van den Broek, P.M. and G.F. van der Hoeven (1986) Combinatorgraph reduction and the Church-Rosser theorem, preprint INF-86-15, Department of Informatics, Twente University of Technology.
5. Ehrig, H. (1979) Introduction to the algebraic theory of graph grammars, in: Graph grammars and their Applications in Computer Science and Biology, ed. V. Claus, H. Ehrig, and G.Rozenberg. Lecture notes in Computer Science 73, Springer, Berlin, 1-69.
6. Glauert, J.R.W., J.R. Kermaway and M.R. Sleep (1987) Category theoretic concepts of graph rewriling and garbage collection, in preparation, School of Information Systems, University of East Anglia.
7. Huet, G. and Lévy, JJ. (1979) Call-by-need computations in non-ambiguous term rewriting systems, Report 359, IRIA-Laboria, B.P. 105, 78150 Le Chesney, France.
8. Kermaway, J.R,.(1984) An outline of some results of Staples on optimal reduction orders in replacement systems, Report CSA/19/1984, School of Information Systems, University of East Anglia, Norwich, England.
9. Klop, J.W.(1980) Combinatory Reduction Systems, Mathematical Centre Tracts n.127, Mathematical Centre, Kruislaan 4t3, 1098 SJ Amsterdam.
10. Raouh, J.C. (1984) On graph rewritings, Theor. Comput. Sci. 32, 1-24.
11. Peyton Jones, S.L. (1987) The Implementation of Functional Languages, Prentice-Hall, London, to appear.
12. Staples, J. (1980a) Computation on graph-like expressions, Theor. Comput. Sci. 10, 171-185.
13. Staples, J. (1980b) Optimal evaluations of graph-like expressions, Theor. Comput. Sci. 10, 297-316.
14. Staples, J. (1980c) Speeding up subtree replacement systems, Theor. Comput. Sci 11, 39-47.
15. Turner, D.A. (1979a) A new implementation technique for applicative languages, in: Software: Practice and Experience 9, 31-49.
16. Turner, D.A (1979b) SASL Language Manual, "combinators" version, University of SL Andrews, U.K.
17. Turner, D.A (1986) Miranda System Manual, Research Software Ltd., 1986.
18. Wadsworth, CP. (1971) Semantics mad Pragmatics of the Lambda Calculus, D.Phil. thesis, Programming Research Group, Oxford University.