کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
423634 685267 2008 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Termination of Lazy Rewriting Revisited
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Termination of Lazy Rewriting Revisited
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 204, 4 April 2008, Pages 35-51