Operational termination of conditional term rewriting systems

Authors:
Salvador Lucas;Claude Marché;José Meseguer
Affiliations:
DSIC, Universidad Politécnica de Valencia, Spain;PCRI, LRI (CNRS UMR 8623), INRIA Futurs, Université Paris-Sud, France;CS Dept., University of Illinois at Urbana-Champaign, USA
Venue:
Information Processing Letters
Year:
2005

Citing 11
Cited 8

Conditional rewrite rules

Theoretical Computer Science
Conditional rewrite rules: Confluence and termination

Journal of Computer and System Sciences
Simplifying conditional term rewriting systems: Unification, termination and confluence

Journal of Symbolic Computation
A rationale for conditional equational programming

Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Report on the programming language Haskell: a non-strict, purely functional language version 1.2

ACM SIGPLAN Notices - Haskell special issue
Specification and proof in membership equational logic

Theoretical Computer Science - Trees in algebra and programming
Advanced topics in term rewriting

Advanced topics in term rewriting
ELAN from a rewriting logic point of view

Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Proving termination of membership equational programs

Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

MTT: The Maude Termination Tool (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
VMTL---A Modular Termination Laboratory

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A sufficient completeness reasoning tool for partial specifications

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Computationally equivalent elimination of conditions

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Proving injectivity of functions via program inversion in term rewriting

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Determinization of conditional term rewriting systems

Theoretical Computer Science
Order-Sorted equality enrichments modulo axioms

WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
One-Path Reachability Logic

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We describe conditional rewriting by means of an inference system and capture termination as the absence of infinite inference: that is, all proof attempts must either successfully terminate, or they must fail in finite time. We call this notion operational termination. Our notion of operational termination is parametric on the inference system. We prove that operational termination of CTRSs is, in fact, equivalent to a very general notion proposed for 3-CTRSs, namely the notion of quasi-decreasingness, which is currently the most general one which is intended to be checked by comparing parts of the CTRS by means of term orderings. Therefore, existing methods for proving quasi-decreasingness of CTRSs immediately apply to prove operational termination of CTRSs.