Logic program specialisation through partial deduction: Control issues

DOI10.1017/S147106840200145XzbMATH Open1105.68331MaRDI QIDQ4452606FDOQ4452606

Authors: Michael Leuschel, Maurice Bruynooghe 

Publication date: 1 March 2004

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

Recommendations

• Publication:4506395
• scientific article; zbMATH DE number 1222414
• scientific article; zbMATH DE number 1222408
• scientific article; zbMATH DE number 25188
• Supporting Transformations for the Partial Evaluation of Logic Programs

zbMATH Keywords

partial evaluation

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (17)

• Fast offline partial evaluation of logic programs
• Generalization-Driven Semantic Clone Detection in CLP
• A partial evaluation framework for order-sorted equational programs modulo axioms
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
• Closed-form upper bounds in static cost analysis
• Fast Offline Partial Evaluation of Large Logic Programs
• Generalization strategies for the verification of infinite state systems
• Fifty Years of Prolog and Beyond
• Oracle-Based Partial Evaluation
• Predicate Pairing for program verification
• Conjunctive partial deduction: foundations, control, algorithms, and experiments
• Title not available (Why is that?)
• Efficient and flexible access control via Jones-optimal logic program specialisation
• Partial evaluation of Maple
• A study on the practicality of poly-controlled partial evaluation
• Type-based homeomorphic embedding for online termination

Uses Software

• ATLAS
• ECCE
• Mercury
• DPPD

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452606)