Logic program specialisation through partial deduction: Control issues

DOI10.1017/S147106840200145XzbMath1105.68331MaRDI QIDQ4452606

Maurice Bruynooghe, Michael Leuschel

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

partial evaluation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (15)

Generalization strategies for the verification of infinite state systems ⋮ Generalization-Driven Semantic Clone Detection in CLP ⋮ Fifty Years of Prolog and Beyond ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Closed-form upper bounds in static cost analysis ⋮ Fast offline partial evaluation of logic programs ⋮ Predicate Pairing for program verification ⋮ Oracle-Based Partial Evaluation ⋮ Partial evaluation of Maple ⋮ Efficient and flexible access control via Jones-optimal logic program specialisation ⋮ Type-based homeomorphic embedding for online termination ⋮ Fast Offline Partial Evaluation of Large Logic Programs ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation ⋮ A Study on the Practicality of Poly-Controlled Partial Evaluation

Uses Software

• ATLAS
• ECCE
• Mercury
• DPPD

This page was built for publication: Logic program specialisation through partial deduction: Control issues