Fast offline partial evaluation of logic programs
From MaRDI portal
Recommendations
- Fast Offline Partial Evaluation of Large Logic Programs
- Fast and accurate strong termination analysis with an application to partial evaluation
- Fully Automatic Binding-Time Analysis for Prolog
- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
Cites work
- scientific article; zbMATH DE number 1615252 (Why is no real title available?)
- scientific article; zbMATH DE number 1638665 (Why is no real title available?)
- scientific article; zbMATH DE number 1696778 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1948415 (Why is no real title available?)
- scientific article; zbMATH DE number 788038 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- A semantic basis for the termination analysis of logic programs
- Binding-Time Annotations without Binding-Time Analysis
- Declarative modeling of the operational behavior of logic languages
- Efficient Büchi universality checking
- Efficient and flexible access control via Jones-optimal logic program specialisation
- Fast Offline Partial Evaluation of Large Logic Programs
- Fast and accurate strong termination analysis with an application to partial evaluation
- Fully Automatic Binding-Time Analysis for Prolog
- Logic Programming
- Logic program specialisation through partial deduction: Control issues
- Mechanizing and improving dependency pairs
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- Offline specialisation in Prolog using a hand-written compiler generator
- Partial evaluation in logic programming
- Partial evaluation of computation process -- an approach to a compiler-compiler
- Program Development in Computational Logic
- Program Development in Computational Logic
- Programming Languages and Systems
- Strong termination of logic programs
- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
- Termination of rewriting
- Termination proofs for logic programs with tabling
- The size-change principle and dependency pairs for termination of term rewriting
- The size-change principle for program termination
Cited in
(15)- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
- Partial evaluation in logic programming
- Control-flow refinement by partial evaluation, and its application to termination and cost analysis
- A hybrid approach to conjunctive partial evaluation of logic programs
- Fast Offline Partial Evaluation of Large Logic Programs
- Fast and accurate strong termination analysis with an application to partial evaluation
- scientific article; zbMATH DE number 1630106 (Why is no real title available?)
- scientific article; zbMATH DE number 1948415 (Why is no real title available?)
- An efficient reasoning method on logic programming using partial evaluation in vector spaces
- Fully Automatic Binding-Time Analysis for Prolog
- Fast narrowing-driven partial evaluation for inductively sequential programs
- Solving non-linear Horn clauses using a linear Horn clause solver
- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
- scientific article; zbMATH DE number 2018578 (Why is no real title available?)
- Using linear constraints for logic program termination analysis
This page was built for publication: Fast offline partial evaluation of logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437798)
