Fast and accurate strong termination analysis with an application to partial evaluation

DOI10.1007/978-3-642-11999-6_8MaRDI QIDQ3557098zbMATH OpenOpenAlexFDO

Authors Michael Leuschel, Salvador Tamarit, Germán Vidal

Publication date 27 April 2010

Published in Functional and Constraint Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11999-6_8

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Fast offline partial evaluation of logic programs
• Strong termination of logic programs
• Fast Offline Partial Evaluation of Large Logic Programs
• scientific article; zbMATH DE number 2090120
• Logic Programming

Cited in

(4)

• Fast offline partial evaluation of logic programs
• A Terminating Evaluation-Driven Variant of G3i
• Fast narrowing-driven partial evaluation for inductively sequential programs
• Ensuring the quasi-termination of needed narrowing computations

Describes a project that uses

Uses Software

• ProB
• DPPD

This page was built for publication: Fast and accurate strong termination analysis with an application to partial evaluation

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