Rules + strategies for transforming lazy functional logic programs

DOI10.1016/j.tcs.2003.10.033zbMath1070.68018OpenAlexW2166534619WikidataQ57978247 ScholiaQ57978247MaRDI QIDQ1884942

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

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.033

zbMATH Keywords

Program transformationStrategiesFunctional logic programming

Mathematics Subject Classification ID

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

Related Items (8)

On fuzzy unfolding: A multi-adjoint approach ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ Determinization of conditional term rewriting systems ⋮ Loop detection in term rewriting using the eliminating unfoldings ⋮ Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding ⋮ Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs ⋮ An improved reductant calculus using fuzzy partial evaluation techniques ⋮ A hybrid programming scheme combining fuzzy-logic and functional-logic resources

Uses Software

• Curry
• PAKCS

Cites Work

• Deforestation: Transforming programs to eliminate trees
• Preservation of stronger equivalence in unfold/fold logic program transformation
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Sequentiality in orthogonal term rewriting systems
• A general criterion for avoiding infinite unfolding during partial deduction
• A transformation system for deductive database modules with perfect model semantics
• Specialization of inductively sequential functional logic programs
• A needed narrowing strategy
• Logic programming with functions and predicates: The language Babel
• A Transformation System for Developing Recursive Programs
• Transformation of logic programs: Foundations and techniques
• The integration of functions into logic programming: From theory to practice
• A positive supercompiler
• Conjunctive partial deduction: foundations, control, algorithms, and experiments
• Loop checking in partial deduction
• Basic transformation operations which preserve computed answer substitutions of logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rules + strategies for transforming lazy functional logic programs