On termination of meta-programs

DOI10.1017/S1471068404002248zbMATH Open1092.68020OpenAlexW2786353107MaRDI QIDQ3370573FDOQ3370573

Alexander Serebrenik, Danny De Schreye

Publication date: 8 February 2006

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068404002248

zbMATH Keywords

logic programmingtermination analysismeta-programmingmeta-interpreters

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20) Logic in computer science (03B70)

Cited In (5)

• Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Leanest quasi-orderings
• Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
• Using linear constraints for logic program termination analysis

   Recommendations

• On termination of meta-programs 👍 👎
• Verification of meta-interpreters 👍 👎
• A semantic basis for the termination analysis of logic programs 👍 👎
• Reasoning about termination of pure Prolog programs 👍 👎
• A general framework for automatic termination analysis od logic programs 👍 👎

This page was built for publication: On termination of meta-programs

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