Modular properties of conditional term rewriting systems

DOI10.1006/INCO.1993.1027zbMath0804.68071OpenAlexW2061404638MaRDI QIDQ689098

Aart Middeldorp

Publication date: 6 September 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/5607

zbMATH Keywords

normalizationconfluencemodularityconditional term rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (25)

Decidability of reachability for disjoint union of term rewriting systems ⋮ Generalized sufficient conditions for modular termination of rewriting ⋮ Completeness results for basic narrowing ⋮ More problems in rewriting ⋮ On the modularity of termination of term rewriting systems ⋮ Modular proofs for completeness of hierarchical term rewriting systems ⋮ Uncurrying for termination and complexity ⋮ Total termination of term rewriting ⋮ The theory of vaccines ⋮ Bubbles in modularity ⋮ On modularity in term rewriting and narrowing ⋮ Modularity in term rewriting revisited ⋮ Local confluence of conditional and generalized term rewriting systems ⋮ Sequentiality in orthogonal term rewriting systems ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Modular termination of \(r\)-consistent and left-linear term rewriting systems ⋮ Modularity in noncopying term rewriting ⋮ Termination is not modular for confluent variable-preserving term rewriting systems ⋮ Extension orderings ⋮ Modular properties of algebraic type systems ⋮ Decidable call-by-need computations in term rewriting ⋮ Unnamed Item ⋮ On modularity in infinitary term rewriting ⋮ Modular aspects of term graph rewriting ⋮ Combinatory reduction systems: Introduction and survey

This page was built for publication: Modular properties of conditional term rewriting systems