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

DOI10.1016/0304-3975(93)90063-YzbMATH Open0781.68074OpenAlexW2031130770WikidataQ127008689 ScholiaQ127008689MaRDI QIDQ685465FDOQ685465

Authors: 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

Recommendations

• Implementing term rewriting by jungle evaluation
• scientific article; zbMATH DE number 1638651
• Publication:3486869
• scientific article; zbMATH DE number 4080885
• Publication:3490954

zbMATH Keywords

term rewriting systemsunificationdouble-pushout approachterm graph rewritinggraph rewritingJungle

Mathematics Subject Classification ID

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

Cites Work

• Hyperedge replacement: grammars and languages
• Title not available (Why is that?)
• LEAN: An intermediate language based on graph rewriting
• Implementing term rewriting by jungle evaluation
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph expressions and graph rewritings
• On ``On graph rewritings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• Critical pairs in term graph rewriting
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Towards ``mouldable code via nested code graph transformation
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• Title not available (Why is that?)
• The generative power of delegation networks
• Title not available (Why is that?)
• Jungle rewriting: an abstract description of a lazy narrowing machine
• Implementing term rewriting by jungle evaluation
• A flexible categorial formalisation of term graphs as directed hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Term rewriting in \(\mathrm{CT}_\Sigma \)
• Modeling pointer redirection as cyclic term-graph rewriting
• On termination of graph rewriting
• Mapping Fusion and Synchronized Hyperedge Replacement into logic programming

Uses Software

• PLUMP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685465)