Derivation of efficient logic programs by specialization and reduction of nondeterminism
From MaRDI portal
Publication:815006
DOI10.1007/s10990-005-7008-3zbMath1103.68034OpenAlexW1839175409MaRDI QIDQ815006
Sophie Renault, Maurizio Proietti, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
- Essence of generalized partial computation
- Deforestation: Transforming programs to eliminate trees
- Equivalence-preserving first-order unfold/fold transformation systems
- Mixtus: An automatic partial evaluator for full Prolog
- Sound and complete partial deduction with unfolding based on well-founded measures
- Efficiency by incrmentalization: An introduction
- Formal derivation of a pattern matching algorithm
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Some global optimizations for a PROLOG compiler
- The concept of a supercompiler
- Automatic mode inference for logic programs
- Finite Differencing of Computable Expressions
- Partial evaluation in logic programming
- A Transformation System for Developing Recursive Programs
- Fast Pattern Matching in Strings
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- The loop absorption and the generalization strategies for the development of logic programs and partial deduction
