Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
From MaRDI portal
Publication:685465
DOI10.1016/0304-3975(93)90063-YzbMath0781.68074MaRDI QIDQ685465
Andrea Corradini, Francesca Rossi
Publication date: 9 February 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
graph rewriting; unification; term rewriting systems; double-pushout approach; term graph rewriting; Jungle
68R10: Graph theory (including graph drawing) in computer science
68Q42: Grammars and rewriting systems
68N17: Logic programming
18A30: Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.)
Related Items
Rewriting on cyclic structures: Equivalence between the operational and the categorical description, Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperedge replacement: grammars and languages
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Recursive queries and context-free graph grammars
- On graph rewritings
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- On ``On graph rewritings
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- LEAN: An intermediate language based on graph rewriting
- Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
- Implementing term rewriting by jungle evaluation
- Graph expressions and graph rewritings
