Formalizing the Confluence of Orthogonal Rewriting Systems (original) (raw)
Related papers
Confluence of Orthogonal Term Rewriting Systems in the Prototype Verification System
Ana Cristina Rocha Oliveira Valverde
Journal of Automated Reasoning, 2016
mu-term: a tool for proving termination of rewriting with replacement restrictions
WST'04 7th International Workshop on …, 2003
A PVS Theory for Term Rewriting Systems
Electronic Notes in Theoretical Computer Science, 2009
Lecture Notes in Computer Science, 1981
Natural Rewriting for General Term Rewriting Systems
2004
Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019, 2019
Confluence of Right Ground Term Rewriting Systems is Decidable
Foundations of Software Science and Computational …, 2005
Implementing term rewriting by graph reduction: Termination of combined systems
Conditional and Typed Rewriting Systems, 1991
Specification of reduction strategies in term rewriting systems
Lecture Notes in Computer Science, 1987
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
Rewriting Techniques and Applications, 2004
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
Logical Methods in Computer Science, 2013
Shallow confluence of conditional term rewriting systems
2008
Natural narrowing as a general unified mechanism for programming and proving
2004
A path ordering for proving termination of term rewriting systems
Mathematical Foundations of …, 1985
A General Natural Rewriting Strategy
Completeness of context-sensitive rewriting
Information Processing Letters, 2015
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science, 2009
Decidable call-by-need computations in term rewriting
Information and Computation, 2005
Confluence of conditional rewrite systems
Lecture Notes in Computer Science, 1988
Semantics of non-terminating rewrite systems using minimal coverings
1995
On the Proof Theory of Program Transformations
Logic Journal of IGPL, 1995
Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes
IPSJ Online Transactions, 2009
Canonical conditional rewrite systems
Lecture Notes in Computer Science, 1988
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science, 2009
An Approach to Declarative Programming Based on a Rewriting Logic
Journal of Logic Programming, 1999
Verification of Rewrite Based Specifications Using Proof Assistants
Proc. XXXI Conferencia …, 2005
Proving termination of rewriting automatically
Modular proofs for completeness of hierarchical term rewriting systems
Theoretical Computer Science, 1995
An equality theorem prover based on grammar rewriting
1996
Polynomials for Proving Termination of Context-Sensitive Rewriting
Foundations of Software Science and Computation Structures, 2004
A higher order unification algorithm for bi-rewriting systems
1993
Derivational Complexity and Context-Sensitive Rewriting
Journal of Automated Reasoning, 2021
Termination of logic programs via labelled term rewrite systems
Journal of Symbolic Computation, 1996