On termination of meta-programs

DOI10.1017/S1471068404002248zbMath1092.68020OpenAlexW2786353107MaRDI QIDQ3370573

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

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

Related Items (5)

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

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