On the Church-Rosser property for the direct sum of term rewriting systems

Authors:
Yoshihito Toyama
Affiliations:
NTT Electrical Communication Labs, Tokyo, Japan
Venue:
Journal of the ACM (JACM)
Year:
1987

Citing 3
Cited 24

Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Computing in Systems Described by Equations

Computing in Systems Described by Equations

Unification in a combination of arbitrary disjoint equational theories

Journal of Symbolic Computation
Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Unification in Boolean Rings and Abelian Groups

Journal of Symbolic Computation
Sequentiality in orthogonal term rewriting systems

Journal of Symbolic Computation
Termination for direct sums of left-linear complete term rewriting systems

Journal of the ACM (JACM)
Combining constraint solving

Constraints in computational logics
Modular termination of context-sensitive rewriting

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
On modularity in infinitary term rewriting

Information and Computation
Rewriting-Based Access Control Policies

Electronic Notes in Theoretical Computer Science (ENTCS)
Modularity of Confluence

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Proving Confluence of Term Rewriting Systems Automatically

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Modularity of Convergence in Infinitary Rewriting

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Unique normal forms and confluence of rewrite systems: persistence

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On modularity in infinitary term rewriting

Information and Computation
Quasi-interpretation synthesis by decomposition an application to higher-order programs

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
On the confluence of lambda-calculus with conditional rewriting

Theoretical Computer Science
Abstract modularity

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Generalizing newman's lemma for left-linear rewrite systems

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Modular church-rosser modulo

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Confluence of non-left-linear TRSs via relative termination

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Modular access control via strategic rewriting

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Modularity in term rewriting revisited

Theoretical Computer Science
From diagrammatic confluence to modularity

Theoretical Computer Science
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that if two term rewriting systems both have the Chruch-Rosser property, then the direct sum of these systems also has this property.