Pages that link to "Item:Q4939538"

The following pages link to Conjunctive partial deduction: foundations, control, algorithms, and experiments (Q4939538):

Displaying 21 items.

• Abstract conjunctive partial deduction for the analysis and compilation of coroutines (Q511025) (← links)
• Partial evaluation of Maple (Q532411) (← links)
• Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
• Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
• Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
• A framework for computing finite SLD trees (Q2258840) (← links)
• Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
• Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
• A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (Q3003494) (← links)
• (Q3425586) (← links)
• A Finite Representation of the Narrowing Space (Q3453648) (← links)
• (Q4281464) (← links)
• (Q4499252) (← links)
• Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806) (← links)
• Proving correctness of imperative programs by linearizing constrained Horn clauses (Q4593003) (← links)
• Predicate Pairing for program verification (Q4644353) (← links)
• Annotation of logic programs for independent AND-parallelism by partial evaluation (Q4911136) (← links)
• Anti-unification in Constraint Logic Programming (Q5108501) (← links)
• The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)
• Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
• Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)