On the Church-Rosser property for the direct sum of term rewriting systems
From MaRDI portal
Publication:5503212
DOI10.1145/7531.7534zbMath1151.68453OpenAlexW1997816727MaRDI QIDQ5503212
Publication date: 13 January 2009
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/7531.7534
Related Items
Decidability of reachability for disjoint union of term rewriting systems, Context rewriting, Combinations of simplifying conditional term rewriting systems, Sufficient conditions for modular termination of conditional term rewriting systems, Type removal in term rewriting, Confluence of the disjoint union of conditional term rewriting systems, Implementing term rewriting by graph reduction: Termination of combined systems, Generalized sufficient conditions for modular termination of rewriting, Some results on the confluence property of combined term rewriting systems, CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems, Modular aspects of properties of term rewriting systems related to normal forms, Termination for the direct sum of left-linear term rewriting systems, Adding algebraic rewriting to the untyped lambda calculus (extended abstract), Bi-rewriting, a term rewriting technique for monotonic order relations, More problems in rewriting, Modularity of completeness revisited, On proving termination by innermost termination, Modularity of termination in term graph rewriting, Compositional term rewriting: An algebraic proof of Toyama's theorem, On the modularity of termination of term rewriting systems, Modular proofs for completeness of hierarchical term rewriting systems, Termination of rewriting, Counterexamples to termination for the direct sum of term rewriting systems, On termination of the direct sum of term-rewriting systems, Unique normal forms for lambda calculus with surjective pairing, The theory of vaccines, Bubbles in modularity, Layer Systems for Proving Confluence, On modularity in term rewriting and narrowing, Modularity in term rewriting revisited, From diagrammatic confluence to modularity, Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems, Abstract data type systems, Developing developments, Ground confluence and strong commutation modulo alpha-equivalence in nominal rewriting, Deciding the word problem in the union of equational theories., Modular term rewriting systems and the termination, Algebraic specification of concurrent systems, Unnamed Item, Modularity of Confluence, Polymorphic rewriting conserves algebraic strong normalization, Modularity of termination and confluence in combinations of rewrite systems with λω, 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, Completeness of combinations of conditional constructor systems, Modularity in noncopying term rewriting, Termination is not modular for confluent variable-preserving term rewriting systems, Modular properties of algebraic type systems, Transforming termination by self-labelling, Modularity of simple termination of term rewriting systems with shared constructors, Approximate XML structure validation based on document-grammar tree similarity, Adding algebraic rewriting to the untyped lambda calculus, Essentials of Term Graph Rewriting, On interreduction of semi-complete term rewriting systems, Unnamed Item, On modularity in infinitary term rewriting, On the confluence of lambda-calculus with conditional rewriting, Unification in Boolean rings and Abelian groups, Unification in a combination of arbitrary disjoint equational theories, Unnamed Item, Term-rewriting systems with rule priorities, Confluence by critical pair analysis revisited, Proving Confluence of Term Rewriting Systems Automatically, Modularity of Convergence in Infinitary Rewriting, Completeness of combinations of constructor systems, Modular aspects of term graph rewriting, A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method, The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type, Partial completion of equational theories, Modularity of confluence: A simplified proof, Labelings for decreasing diagrams, Confluence and commutation for nominal rewriting systems with atom-variables
