Lambda lifting: transforming programs to recursive equations
Proc. of a conference on Functional programming languages and computer architecture
Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
Notes on the elimination of conditions
1st international workshop on Conditional Term Rewriting Systems
Order-sorted completion: the many-sorted way
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Modular properties of composable term rewriting systems
Journal of Symbolic Computation
Term rewriting and all that
On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Automatically Proving Termination Where Simplification Orderings Fail
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Expressive Power of Rewriting
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Termination of Logic Programs Using Semantic Unification
LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
Completion-Time Optimization of Rewrite-Time Goal Solving
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Confluence and Superdevelopments
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Proving Innermost Normalisation Automatically
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Logic Programs as term Rewriting Systems
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Unravelings and Ultra-properties
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
A Transformational Methodology for Proving Termination of Logic Programs
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
Canonical Conditional Rewrite Systems
Proceedings of the 9th International Conference on Automated Deduction
Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
How to Transform Canonical Decreasing CTRSs into Equivalent Canonical TRSs
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Computationally equivalent elimination of conditions
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
Deterministic conditioned rewrite systems are interesting because they permit extra veiriables on the right-hand sides of the rules. If such a system is quasi-reductive, then it is terminating and has a computable rewrite relation. It will be shown that every deterministic CTRS R can be transformed into an unconditioned TRS U(R) such that termination of U(R) imphes quasi-reductivity of R. The main theorem states that quasi-reductivity of R implies innermost termination of U(R). These results have interesting applications in two different areas: modularity in term rewriting and termination proofs of well-moded logic programs.