Modular properties of composable term rewriting systems
From MaRDI portal
Publication:1911401
DOI10.1006/jsco.1995.1036zbMath0851.68058OpenAlexW2078222019MaRDI QIDQ1911401
Publication date: 28 April 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/92cc3153e98b972d18bb0529e19eddc30c9cd4ec
Related Items
CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems ⋮ Modular proofs for completeness of hierarchical term rewriting systems ⋮ Modular and incremental proofs of AC-termination ⋮ The theory of vaccines ⋮ Bubbles in modularity ⋮ Layer Systems for Proving Confluence ⋮ Modularity in term rewriting revisited ⋮ Simple termination of rewrite systems ⋮ Deciding the word problem in the union of equational theories. ⋮ Decreasing diagrams and relative termination ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Modular termination of \(r\)-consistent and left-linear term rewriting systems ⋮ Extension orderings ⋮ Transforming termination by self-labelling ⋮ Decreasing Diagrams and Relative Termination ⋮ On modularity in infinitary term rewriting ⋮ Proving Confluence of Term Rewriting Systems Automatically ⋮ Modular aspects of term graph rewriting ⋮ Unions of non-disjoint theories and combinations of satisfiability procedures ⋮ Modular and incremental automated termination proofs ⋮ Modular termination proofs for rewriting using dependency pairs
This page was built for publication: Modular properties of composable term rewriting systems
