Pages that link to "Item:Q3988796"
From MaRDI portal
The following pages link to Partial evaluation in logic programming (Q3988796):
Displaying 11 items.
- Proving the correctness of recursion-based automatic program transformations (Q5096758) (← links)
- Concolic Testing in CLP (Q5140007) (← links)
- The applicability of logic program analysis and transformation to theorem proving (Q5210773) (← links)
- Partial deduction for structured logic programming (Q5286918) (← links)
- Linking Data to Ontologies (Q5445729) (← links)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (Q5504591) (← links)
- The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)
- Loop checks for logic programs with functions (Q5958765) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)