Logic program specialisation through partial deduction: Control issues
From MaRDI portal
Publication:4452606
Recommendations
Cited in
(18)- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- Fast offline partial evaluation of logic programs
- Partial evaluation of Maple
- Efficient and flexible access control via Jones-optimal logic program specialisation
- Type-based homeomorphic embedding for online termination
- Oracle-based partial evaluation
- Fifty Years of Prolog and Beyond
- A partial evaluation framework for order-sorted equational programs modulo axioms
- scientific article; zbMATH DE number 1531362 (Why is no real title available?)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
- Generalization strategies for the verification of infinite state systems
- A study on the practicality of poly-controlled partial evaluation
- Closed-form upper bounds in static cost analysis
- Fast Offline Partial Evaluation of Large Logic Programs
- Predicate specialization for definitional higher-order logic programs
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Predicate pairing for program verification
- Generalization-Driven Semantic Clone Detection in CLP
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)
