Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming

DOI10.1016/0304-3975(93)90063-YzbMath0781.68074OpenAlexW2031130770WikidataQ127008689 ScholiaQ127008689MaRDI QIDQ685465

Andrea Corradini, Francesca Rossi

Publication date: 9 February 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90063-y

zbMATH Keywords

graph rewritingunificationterm rewriting systemsdouble-pushout approachterm graph rewritingJungle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Logic programming (68N17) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Related Items (11)

Term rewriting in CTΣ ⋮ Jungle rewriting: An abstract description of a lazy narrowing machine ⋮ Critical pairs in term graph rewriting ⋮ A flexible categorial formalisation of term graphs as directed hypergraphs ⋮ Towards ``mouldable code via nested code graph transformation ⋮ The generative power of delegation networks ⋮ On termination of graph rewriting ⋮ Unnamed Item ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Modeling Pointer Redirection as Cyclic Term-graph Rewriting

Uses Software

• PLUMP

Cites Work

• 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
• 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

This page was built for publication: Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming