An automatic composition algorithm for functional logic programs

DOI10.1007/3-540-44411-4_17MaRDI QIDQ4471989zbMATH OpenFDO

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

Publication date 3 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1963/19630289.htm

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Recommendations

• Safe folding/unfolding with conditional narrowing
• A transformation system for lazy functional logic programs
• Rules + strategies for transforming lazy functional logic programs
• Specialization of functional logic programs based on needed narrowing
• Supporting Transformations for the Partial Evaluation of Logic Programs

Cited in

(5)

• An approach to automatic deductive synthesis of functional programs
• A narrowing-based instantiation rule for rewriting-based fold/unfold transformations
• Automatic optimization of multi-paradigm declarative programs
• Optimizing fuzzy logic programs by unfolding, aggregation and folding
• Automated synthesis of functional programs with auxiliary functions

This page was built for publication: An automatic composition algorithm for functional logic programs

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