Termination of Lazy Rewriting Revisited

Authors:
Felix Schernhammer;Bernhard Gramlich
Affiliations:
Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria;Theory and Logic Group, Institute of Computer Languages, TU Wien, Austria
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 10
Cited 2

Term rewriting and all that

Term rewriting and all that
Lazy rewriting on eager machinery

ACM Transactions on Programming Languages and Systems (TOPLAS)
Functional Programming and Parallel Graph Rewriting

Functional Programming and Parallel Graph Rewriting
Classes of Equational Programs that Compile into Efficient Machine Code

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
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
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Proving termination of context-sensitive rewriting by transformation

Information and Computation
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Automated termination analysis for Haskell: from term rewriting to programming languages

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Context-sensitive dependency pairs

Information and Computation
Modularity in term rewriting revisited

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to context-sensitive rewriting, reductions at such argument positions are not completely forbidden but delayed. Based on the observation that the only existing (non-trivial) approach to prove termination of such lazy rewrite systems is flawed, we develop a modified approach for transforming lazy rewrite systems into context-sensitive ones that is sound and complete with respect to termination. First experimental results with this transformation based technique are encouraging.