Initiality, induction, and computability
Algebraic methods in semantics
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
Term rewriting and all that
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
Logic, Programming, and PROLOG
Logic, Programming, and PROLOG
Context-sensitive rewriting strategies
Information and Computation
ELAN from a rewriting logic point of view
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
Order-Sorted Termination: The Unsorted Way
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Termination of on-demand rewriting and termination of OBJ programs
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Operational termination of conditional term rewriting systems
Information Processing Letters
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Tyrolean termination tool: Techniques and features
Information and Computation
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Operational Termination of Membership Equational Programs: the Order-Sorted Way
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated termination analysis for logic programs by term rewriting
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
TPA: termination proved automatically
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Automated termination analysis for Haskell: from term rewriting to programming languages
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Towards a Maude formal environment
Formal modeling
| Hi-index | 0.00 |
Despite the remarkable development of the theory of termination of rewriting, its application to high-level (rewriting-based) programming languages is far from being optimal. This is due to the need for features such as conditional equations and rules, types and subtypes, (possibly programmable) strategies for controlling the execution, matching modulo axioms, and so on, that are used in many programs and tend to place such programs outside the scope of current termination tools. The operational meaning of such features is often formalized in a proof theoretic manner by means of an inference system rather than just by a rewriting relation. The corresponding termination notions can also differ from the standard ones. During the last years we have introduced and implemented different notions and transformation techniques which have been proved useful for proving and disproving termination of such programs by using existing tools for proving termination of (variants of) rewriting. In this paper we provide an overview of our main contributions.