scientific article; zbMATH DE number 177461
From MaRDI portal
Publication:4037331
zbMATH Open0787.68058MaRDI QIDQ4037331FDOQ4037331
Authors: Detlef Plump 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Cited In (23)
- Title not available (Why is that?)
- Modular aspects of term graph rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System
- A graph reduction approach to incremental term rewriting
- Implementing conditional term rewriting by graph rewriting
- Complexity analysis by graph rewriting
- A Needed Rewriting Strategy for Data-Structures with Pointers
- Inductively Sequential Term-Graph Rewrite Systems
- Graph reducibility of term rewriting systems
- Transformation of shaped nested graphs and diagrams
- Implementing term rewriting by jungle evaluation
- Three Syntactic Theories for Combinatory Graph Reduction
- Relating graph and term rewriting via Böhm models
- Modeling and verifying graph transformations in proof assistants
- On interreduction of semi-complete term rewriting systems
- Term-graph rewriting in \textsc{Tom} using relative positions
- GETGRATS
- Title not available (Why is that?)
- Implementing term rewriting by graph reduction: Termination of combined systems
- Modularity of termination in term graph rewriting
- An efficient representation of arithmetic for term rewriting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037331)
