Modular proofs for completeness of hierarchical term rewriting systems
From MaRDI portal
Publication:1350349
DOI10.1016/0304-3975(95)00075-8zbMath0871.68109OpenAlexW2077956228MaRDI QIDQ1350349
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00075-8
Related Items (15)
On proving \(C_E\)-termination of rewriting by size-change termination ⋮ Termination of constructor systems ⋮ On proving termination by innermost termination ⋮ Modularity of termination in term graph rewriting ⋮ Modular and incremental proofs of AC-termination ⋮ Modularity in term rewriting revisited ⋮ Simple termination of rewrite systems ⋮ Modular Termination of Basic Narrowing ⋮ Termination of term rewriting using dependency pairs ⋮ Transforming termination by self-labelling ⋮ Unnamed Item ⋮ Modular aspects of term graph rewriting ⋮ Hierarchical termination revisited. ⋮ Modular and incremental automated termination proofs ⋮ Modular termination proofs for rewriting using dependency pairs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular properties of conditional term rewriting systems
- Modular term rewriting systems and the termination
- Counterexamples to termination for the direct sum of term rewriting systems
- On termination of the direct sum of term-rewriting systems
- Modularity of simple termination of term rewriting systems with shared constructors
- Modular properties of composable term rewriting systems
- Completeness of combinations of constructor systems
- Termination for direct sums of left-linear complete term rewriting systems
- Modularity of completeness revisited
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Algorithmic Learning Theory
- On the Church-Rosser property for the direct sum of term rewriting systems
This page was built for publication: Modular proofs for completeness of hierarchical term rewriting systems
