Talks and Poster Presentations (with Proceedings-Entry):
F. Schernhammer, B. Gramlich:
"Termination of Lazy Rewriting Revisited";
Talk: 7th International Workshop on Reduction Strategies in Rewriting and Programming,
Paris;
2007-06-25; in: "Proc. 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007)",
J. Giesl (ed.);
(2007),
28
- 42.
English 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.
Keywords:
Lazy rewriting, termination, context-sensitivity.
Electronic version of the publication:
http://publik.tuwien.ac.at/files/pub-inf_4987.pdf
Created from the Publication Database of the Vienna University of Technology.