Pages that link to "Item:Q4452606"
From MaRDI portal
The following pages link to Logic program specialisation through partial deduction: Control issues (Q4452606):
Displayed 15 items.
- Partial evaluation of Maple (Q532411) (← links)
- Type-based homeomorphic embedding for online termination (Q989516) (← links)
- Efficient and flexible access control via Jones-optimal logic program specialisation (Q2271897) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- A Study on the Practicality of Poly-Controlled Partial Evaluation (Q2873793) (← links)
- Fast Offline Partial Evaluation of Large Logic Programs (Q3617434) (← links)
- Predicate Pairing for program verification (Q4644353) (← links)
- Generalization-Driven Semantic Clone Detection in CLP (Q5097639) (← links)
- Generalization strategies for the verification of infinite state systems (Q5299583) (← links)
- Oracle-Based Partial Evaluation (Q5415668) (← links)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (Q5504591) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)