Derivation of efficient logic programs by specialization and reduction of nondeterminism

DOI10.1007/S10990-005-7008-3zbMATH Open1103.68034OpenAlexW1839175409MaRDI QIDQ815006FDOQ815006

Authors: Maurizio Proietti, Sophie Renault, Alberto Pettorossi 

Publication date: 8 February 2006

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-005-7008-3

Recommendations

• Supporting Transformations for the Partial Evaluation of Logic Programs
• Publication:4944882
• Specialisation of Prolog and FCP programs using abstract interpretation
• scientific article; zbMATH DE number 1222414
• scientific article; zbMATH DE number 1497829

zbMATH Keywords

program transformationautomatic program derivation

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• The concept of a supercompiler
• The loop absorption and the generalization strategies for the development of logic programs and partial deduction
• Partial evaluation in logic programming
• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• Deforestation: Transforming programs to eliminate trees
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Title not available (Why is that?)
• A Transformation System for Developing Recursive Programs
• Sound and complete partial deduction with unfolding based on well-founded measures
• Conjunctive partial deduction: foundations, control, algorithms, and experiments
• Finite Differencing of Computable Expressions
• Equivalence-preserving first-order unfold/fold transformation systems
• Some global optimizations for a PROLOG compiler
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• Formal derivation of a pattern matching algorithm
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• Essence of generalized partial computation
• Mixtus: An automatic partial evaluator for full Prolog
• Efficiency by incrmentalization: An introduction
• Title not available (Why is that?)
• Automatic mode inference for logic programs
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• Supporting Transformations for the Partial Evaluation of Logic Programs
• An improved reductant calculus using fuzzy partial evaluation techniques
• Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs
• Specialization of functional logic programs based on needed narrowing
• Title not available (Why is that?)
• Regular tree languages as an abstract domain in program specialisation
• Non-discriminating arguments and their uses
• Title not available (Why is that?)

Uses Software

• ECCE
• Mercury
• DPPD
• Ciao
• CiaoPP
• Refal

This page was built for publication: Derivation of efficient logic programs by specialization and reduction of nondeterminism

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