Graph rewriting in some categories of partial morphisms

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

Volumn 532 LNCS, Issue , 1991, Pages 490-504

  Kennaway, Richard ^a  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

Author keywords

Category; Double pushout; Graph rewriting; Hypergraph; Jungle; Partial morphism; Single pushout; Term graph

Indexed keywords

CONTEXT SENSITIVE GRAMMARS; FORMAL LANGUAGES;

CATEGORY; DOUBLE PUSHOUT; GRAPH REWRITING; HYPERGRAPH; JUNGLE; MORPHISMS; PUSH-OUT; TERM GRAPHS;

GRAPH THEORY;

EID: 84976112557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017408     Document Type: Conference Paper

References (13)

1. H. Ehrig, M. Pfender, and H.J. Schneider “Graph-grammars: an algebraic approach”, Proc. IEEE Conf. on Automata and Switching Theory, 167-180, 1973.
2. H. Ehrig and B.K. Rosen “Parallelism and concurrency of graph manipulations”, Theor. Comp. Sci., 11, 247-275, 1980.
3. W.M. Farmer, J.D. Ramsdell, and RJ. Watro, “A correctness proof for combinator reduction with cycles”, ACM TOPLAS, 12, n.1, 123-134, January 1990.
4. J.R.W. Glauert, J.R. Kennaway, and M.R. Sleep “Final specification of Dactl”, Report SYS-C88-11, University of East Anglia, Norwich, U.K., 1989
5. J.R.W. Glauert, J.R. Kennaway and Ni.R. Sleep “Dactl: An Experimental Graph Rewriting Language”, these proceedings, 1990.
6. J.R.W. Glauert, K. Hammond, J.R. Kenuaway, G.A. Papadopoulos, and M.R. Sleep “Dactl: some introductory papers”, Report SYS-C88-08, University of East Anglia, Norwich, U.K., 1988
7. B. Hoffmann and D. Plump “Jungle evaluation for efficient term rewriting”, Report 4/88, Fachbereich Mathematik und Informatil, Universität Bremen, Postfach 330 440, D-2800 Bremen 33, Germany, 1988. An earlier version appeared in Proc. Int. Workshop on Algebraic and Logic Programming, 1988. Mathematical Reset rch, 49. (Akademie-Verlag, Berlin, 1988).
8. J.R. Kennaway “On ‘On graph rewritings’", Theor. Comp. Sci. 52, 37-58, 1987.
9. J.R. Kennaway, J.W. Klop, M.R. Sleep and F.-J. de Vries “Transfinite reductions in orthogonal term rewrite systems” (in preparation, 199-).
10. M. Löwe and H. Ehrig “Algebraic approach to graph transformation based on single pushout derivations” (unpublished, 1990).
11. F. Parisi-Presicce, H. Ehrig, and U. Momanari “Graph rewriting with unification and composition”, Proc. 3rd Int. Workshop on Graph Grammars, LNCS 291, 496-514, Springer-Verlag, 1986.
12. J.C. Raoult “On graph rewritings”, Th. Comp. Sci., 32, 1-24, 1984.
13. E. Robinson and G. Rosolini “Categories of partial maps”, Inf. & Comp., 79, 95-130, 1988.