Conjunctive partial deduction: foundations, control, algorithms, and experiments
From MaRDI portal
Publication:4939538
DOI10.1016/S0743-1066(99)00030-8zbMath0944.68025WikidataQ62038272 ScholiaQ62038272MaRDI QIDQ4939538
Robert Glück, Michael Leuschel, Danny De Schreye, Bern Martens, Jesper Jørgensen, Morten Heine B. Sørensen
Publication date: 26 September 2000
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items
Rules + strategies for transforming lazy functional logic programs, A Finite Representation of the Narrowing Space, Solving Horn Clauses on Inductive Data Types Without Induction, Optimization of rewrite theories by equational partial evaluation, Symbolic Specialization of Rewriting Logic Theories with Presto, Analysis and Transformation of Constrained Horn Clauses for Program Verification, Proving correctness of imperative programs by linearizing constrained Horn clauses, Anti-unification in Constraint Logic Programming, Unnamed Item, A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs, Predicate Pairing for program verification, Abstract conjunctive partial deduction for the analysis and compilation of coroutines, Annotation of logic programs for independent AND-parallelism by partial evaluation, Partial evaluation of Maple, A framework for computing finite SLD trees, The narrowing-driven approach to functional logic program specialization, Narrowing and Rewriting Logic: from Foundations to Applications, Derivation of efficient logic programs by specialization and reduction of nondeterminism
Uses Software
