Derivation of efficient logic programs by specialization and reduction of nondeterminism
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1615257 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 1487848 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- A Transformation System for Developing Recursive Programs
- Automatic mode inference for logic programs
- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- Deforestation: Transforming programs to eliminate trees
- Efficiency by incrmentalization: An introduction
- Equivalence-preserving first-order unfold/fold transformation systems
- Essence of generalized partial computation
- Fast Pattern Matching in Strings
- Finite Differencing of Computable Expressions
- Formal derivation of a pattern matching algorithm
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Mixtus: An automatic partial evaluator for full Prolog
- Partial evaluation in logic programming
- Some global optimizations for a PROLOG compiler
- Sound and complete partial deduction with unfolding based on well-founded measures
- The concept of a supercompiler
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- The loop absorption and the generalization strategies for the development of logic programs and partial deduction
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
Cited in
(9)- scientific article; zbMATH DE number 1420816 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4041248 (Why is no real title available?)
- Non-discriminating arguments and their uses
- Regular tree languages as an abstract domain in program specialisation
- scientific article; zbMATH DE number 1420811 (Why is no real title available?)
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)
