Mixtus: An automatic partial evaluator for full Prolog

DOI10.1007/BF03038271zbMath0942.68516MaRDI QIDQ1313369

Dan Sahlin

Publication date: 1 February 1994

Published in: New Generation Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) General topics in the theory of software (68N01)

Related Items (12)

Termination of floating-point computations ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient model generation through compilation ⋮ Efficient and flexible access control via Jones-optimal logic program specialisation ⋮ Type-based homeomorphic embedding for online termination ⋮ Loop checks for logic programs with functions ⋮ Interleaving Symbolic Execution and Partial Evaluation ⋮ Termination prediction for general logic programs ⋮ Mixtus: An automatic partial evaluator for full Prolog ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism

Uses Software

• SICStus

Cites Work

• Annotated bibliography on partial evaluation and mixed computation
• Partial evaluation of metaprograms in a ``multiple worlds logic language
• Composing recursive logic programs with clausal join
• Mixtus: An automatic partial evaluator for full Prolog
• Partial evaluation in logic programming
• A Transformation System for Developing Recursive Programs
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mixtus: An automatic partial evaluator for full Prolog