Implementing term rewriting by jungle evaluation
From MaRDI portal
DOI10.1051/ITA/1991250504451zbMATH Open0706.68061OpenAlexW158097575MaRDI QIDQ3486867FDOQ3486867
Authors: Berthold Hoffmann, Detlef Plump 
Publication date: 1991
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92401
Recommendations
General topics in the theory of software (68N01) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)
Cites Work
- Proving termination with multiset orderings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On graph rewritings
- Graph grammars and operational semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation on graph-like expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- Critical pairs in term graph rewriting
- Term-Graph Rewriting Via Explicit Paths
- Bisimilarity 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?)
- Single pushout transformations of equationally defined graph structures with applications to actor systems
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- More problems in rewriting
- Essentials of term graph rewriting
- 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
- Title not available (Why is that?)
- Symbol different term rewrite systems
- A flexible categorial formalisation of term graphs as directed hypergraphs
- A simple parallel implementation of interaction nets in Haskell
- Title not available (Why is that?)
- Title not available (Why is that?)
- Term rewriting in \(\mathrm{CT}_\Sigma \)
- On termination of graph rewriting
- Collapsed tree rewriting: Completeness, confluence, and modularity
This page was built for publication: Implementing term rewriting by jungle evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3486867)
