Optimizing term rewriting with creeper trace transducers

DOI10.1016/J.JLAMP.2024.100987MaRDI QIDQ6615561zbMATH OpenFDO

Authors Rick Erkens

Publication date 8 October 2024

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JLAMP.2024.100987

zbMATH Keywords

optimizationterm rewritingtransducers

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Deforestation: Transforming programs to eliminate trees
• Expressiveness of streaming string transducers
• From outermost reduction semantics to abstract machine
• scientific article; zbMATH DE number 2087343 (Why is no real title available?)
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• Metamorphisms: streaming representation-changers
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• Origin tracking
• Term-graph rewriting in \textsc{Tom} using relative positions
• Theoretical aspects of computing -- ICTAC 2021. 18th international colloquium, virtual event, Nur-Sultan, Kazakhstan, September 8--10, 2021. Proceedings

This page was built for publication: Optimizing term rewriting with creeper trace transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615561)