Graph reducibility of term rewriting systems
From MaRDI portal
Publication:3569026
Recommendations
Cited in
(20)- Comparison of two graph-rewrite systems
- Modular aspects of term graph rewriting
- Relating graph and term rewriting via Böhm models
- Conditional term graph rewriting with indirect sharing
- Term-graph rewriting in \textsc{Tom} using relative positions
- Three Syntactic Theories for Combinatory Graph Reduction
- scientific article; zbMATH DE number 124283 (Why is no real title available?)
- scientific article; zbMATH DE number 177461 (Why is no real title available?)
- scientific article; zbMATH DE number 1231481 (Why is no real title available?)
- Foreword: special issue on term and graph rewriting
- scientific article; zbMATH DE number 1361503 (Why is no real title available?)
- Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System
- Needed computations shortcutting needed steps
- Relating graph and term rewriting via Böhm models
- A graph reduction approach to incremental term rewriting
- Modularity of termination in term graph rewriting
- Implementing term rewriting by graph reduction: Termination of combined systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Implementing conditional term rewriting by graph rewriting
- From linear term rewriting to graph rewriting with preservation of termination
This page was built for publication: Graph reducibility of term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569026)
