Pages that link to "Item:Q3988796"
From MaRDI portal
The following pages link to Partial evaluation in logic programming (Q3988796):
Displayed 29 items.
- Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- S-semantics for logic programming: a retrospective look (Q1035702) (← links)
- An improved reductant calculus using fuzzy partial evaluation techniques (Q1037854) (← links)
- Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) (← links)
- An analysis of loop checking mechanisms for logic programs (Q1177923) (← links)
- Generalizing completeness results for loop checks in logic programming (Q1199926) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Mixtus: An automatic partial evaluator for full Prolog (Q1313369) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation (Q1322838) (← links)
- The role of standardising apart in logic programming (Q1329744) (← links)
- Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
- Specialisation calculus and communication (Q1818001) (← links)
- A sound and complete semantics for a version of negation as failure (Q1824413) (← links)
- Nonrecursive incremental evaluation of Datalog queries (Q1924723) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (Q3003494) (← links)
- A positive supercompiler (Q4339016) (← links)
- (Q4499250) (← links)
- (Q4499254) (← links)
- An assumption-based truth maintenance system dealing with non-ground justifications (Q4880539) (← links)
- Annotation of logic programs for independent AND-parallelism by partial evaluation (Q4911136) (← links)
- Linking Data to Ontologies (Q5445729) (← links)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (Q5504591) (← links)
- The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)
- Loop checks for logic programs with functions (Q5958765) (← links)