Fast offline partial evaluation of logic programs

DOI10.1016/J.IC.2014.01.005zbMATH Open1358.68055OpenAlexW2044152416MaRDI QIDQ2437798FDOQ2437798

Germán Vidal, Michael Leuschel

Publication date: 13 March 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.01.005

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

zbMATH Keywords

partial evaluationlogic programmingtermination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• The size-change principle for program termination
• Termination of rewriting
• Partial evaluation in logic programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mechanizing and improving dependency pairs
• Partial evaluation of computation process -- an approach to a compiler-compiler
• A semantic basis for the termination analysis of logic programs
• Strong termination of logic programs
• Logic program specialisation through partial deduction: Control issues
• Declarative modeling of the operational behavior of logic languages
• Title not available (Why is that?)
• Fast and accurate strong termination analysis with an application to partial evaluation
• Title not available (Why is that?)
• The size-change principle and dependency pairs for termination of term rewriting
• Efficient Büchi Universality Checking
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions
• Logic Programming
• Efficient and flexible access control via Jones-optimal logic program specialisation
• Termination proofs for logic programs with tabling
• Program Development in Computational Logic
• Offline specialisation in Prolog using a hand-written compiler generator
• Program Development in Computational Logic
• Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
• Title not available (Why is that?)
• Title not available (Why is that?)
• Binding-Time Annotations without Binding-Time Analysis
• Fast Offline Partial Evaluation of Large Logic Programs
• Title not available (Why is that?)
• Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
• Fully Automatic Binding-Time Analysis for Prolog
• Programming Languages and Systems

Cited In (13)

• Partial evaluation in logic programming
• Fast Offline Partial Evaluation of Large Logic Programs
• Title not available (Why is that?)
• Fast and accurate strong termination analysis with an application to partial evaluation
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
• Title not available (Why is that?)
• Using linear constraints for logic program termination analysis
• Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques

Uses Software

• ECCE
• AProVE
• DPPD

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)