Fast offline partial evaluation of logic programs

DOI10.1016/j.ic.2014.01.005zbMath1358.68055OpenAlexW2044152416MaRDI QIDQ2437798

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

zbMATH Keywords

partial evaluationlogic programmingtermination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Using linear constraints for logic program termination analysis ⋮ Unnamed Item

Uses Software

• ECCE
• AProVE
• DPPD

Cites Work

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

This page was built for publication: Fast offline partial evaluation of logic programs