Fully Automatic Binding-Time Analysis for Prolog

DOI10.1007/11506676_4MaRDI QIDQ5458793zbMATH OpenOpenAlexFDO

Authors Stephen-John Craig, John P. Gallagher, Michael Leuschel, Kim S. Henriksen

Publication date 24 April 2008

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/259546/1/bta_final.pdf

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
• Fast offline partial evaluation of logic programs
• Binding-Time Annotations without Binding-Time Analysis
• Fast Offline Partial Evaluation of Large Logic Programs
• scientific article; zbMATH DE number 2084340

Cited in

(6)

• Fast offline partial evaluation of logic programs
• scientific article; zbMATH DE number 2084340 (Why is no real title available?)
• Tag-free combinators for binding-time polymorphic program generation
• Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
• Fast Offline Partial Evaluation of Large Logic Programs
• scientific article; zbMATH DE number 2018578 (Why is no real title available?)

Describes a project that uses

Uses Software

• LOGEN

This page was built for publication: Fully Automatic Binding-Time Analysis for Prolog

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458793)