Essentials of Term Graph Rewriting
From MaRDI portal
Publication:4923548
DOI10.1016/S1571-0661(04)80210-XzbMath1263.68092MaRDI QIDQ4923548
Publication date: 24 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Related Items
On sharing, memoization, and polynomial time, String Diagram Rewrite Theory I: Rewriting with Frobenius Structure, Unnamed Item, Functional Logic Programming in Maude, Towards a Systematic Method for Proving Termination of Graph Transformation Systems, GETGRATS, Solving Equations by Graph Transformation, Essentials of Term Graph Rewriting, Compiling Collapsing Rules in Certain Constructor Systems, Rewriting and Call-Time Choice: The HO Case, Structure and Properties of Traces for Functional Programs, Intensional Properties of Polygraphs
Cites Work
- Termination of rewriting
- Counterexamples to termination for the direct sum of term rewriting systems
- Modular aspects of term graph rewriting
- Bisimilarity in term graph rewriting.
- Implementing term rewriting by jungle evaluation
- Term Rewriting and All That
- Essentials of Term Graph Rewriting
- On the Church-Rosser property for the direct sum of term rewriting systems
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Implementing term rewriting by graph reduction: Termination of combined systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
