Optimizing term rewriting with creeper trace transducers

In the context of functional programming/term normalization algorithms we discuss the optimization problem of constructing the result of a sequence of rewrite steps, without computing all the intermediate terms. From a rewrite system we construct a creeper trace transducer, which reads a sequence of...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 141; p. 100987
Main Author Erkens, Rick
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.10.2024
Subjects
Optimization
Term rewriting
Transducers
Term rewriting
Transducers
Optimization
Online AccessGet full text

Cover

More Information
Summary:In the context of functional programming/term normalization algorithms we discuss the optimization problem of constructing the result of a sequence of rewrite steps, without computing all the intermediate terms. From a rewrite system we construct a creeper trace transducer, which reads a sequence of backwards overlapping rewrite steps while producing the desired answer. The transducer writes each symbol of the output only once, skipping overlap between each pair of subsequent rules. In some cases a part of the trace can be disregarded altogether.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2024.100987