Safe folding/unfolding with conditional narrowing

DOI10.1007/BFB0026999MaRDI QIDQ4364365zbMATH OpenFDO

Authors Ginés Moreno, Germán Vidal, María Alpuente, M. Falaschi

Publication date 17 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0026999

zbMATH Keywords

functional logic languagesunfolding

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A narrowing-based instantiation rule for rewriting-based fold/unfold transformations
• Seeking a safe and efficient similarity-based unfolding rule
• Higher order conditional rewriting and narrowing
• scientific article; zbMATH DE number 1761900
• Disciplined, efficient, generalised folds for nested datatypes
• Fold and unfold for program semantics
• Fold and unfold for program semantics
• A tutorial on the universality and expressiveness of fold
• Logic Based Program Synthesis and Transformation
• Safety and progress of recursive procedures

Cited in

(10)

• Rules + strategies for transforming lazy functional logic programs
• Optimization of rewrite theories by equational partial evaluation
• A debugging scheme for functional logic programs
• A narrowing-based instantiation rule for rewriting-based fold/unfold transformations
• scientific article; zbMATH DE number 3924119 (Why is no real title available?)
• scientific article; zbMATH DE number 2079865 (Why is no real title available?)
• Total unfolding: theory and applications
• Optimizing fuzzy logic programs by unfolding, aggregation and folding
• Optimizing Maude programs via program specialization
• Loop detection in term rewriting using the eliminating unfoldings

This page was built for publication: Safe folding/unfolding with conditional narrowing

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