Modularity in noncopying term rewriting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4180808 (Why is no real title available?)
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 4090779 (Why is no real title available?)
- scientific article; zbMATH DE number 1300971 (Why is no real title available?)
- scientific article; zbMATH DE number 1324443 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- scientific article; zbMATH DE number 1456966 (Why is no real title available?)
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Completeness of combinations of constructor systems
- Computing in systems described by equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Counterexamples to termination for the direct sum of term rewriting systems
- Implementing term rewriting by graph reduction: Termination of combined systems
- LEAN: An intermediate language based on graph rewriting
- Modular aspects of properties of term rewriting systems related to normal forms
- Modular properties of conditional term rewriting systems
- Modularity of simple termination of term rewriting systems with shared constructors
- On termination of the direct sum of term-rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Proving termination with multiset orderings
- REDEX CAPTURING IN TERM GRAPH REWRITING
- Termination for direct sums of left-linear complete term rewriting systems
Cited in
(9)- Modularity of termination in term graph rewriting
- Modularity in term rewriting revisited
- Modular aspects of term graph rewriting
- Implementing conditional term rewriting by graph rewriting
- Algebraic Methodology and Software Technology
- Modular non-deterministic semantics for T, TB, S4, S5 and more
- Interaction nets and term-rewriting systems
- On modularity in term rewriting and narrowing
- A uniform framework for term and graph rewriting applied to combined systems
This page was built for publication: Modularity in noncopying term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673186)