On termination of meta-programs
| dc.creator | Serebrenik, Alexander | |
| dc.creator | De Schreye, Danny | |
| dc.date | 2001-10-17 | |
| dc.date | 2003-12-24 | |
| dc.date.accessioned | 2026-07-07T03:17:48Z | |
| dc.date.available | 2026-07-07T03:17:48Z | |
| dc.description | The term {\em meta-programming} refers to the ability of writing programs that have other programs as data and exploit their semantics. The aim of this paper is presenting a methodology allowing us to perform a correct termination analysis for a broad class of practical meta-interpreters, including negation and performing different tasks during the execution. It is based on combining the power of general orderings, used in proving termination of term-rewrite systems and programs, and on the well-known acceptability condition, used in proving termination of logic programs. The methodology establishes a relationship between the ordering needed to prove termination of the interpreted program and the ordering needed to prove termination of the meta-interpreter together with this interpreted program. If such a relationship is established, termination of one of those implies termination of the other one, i.e., the meta-interpreter preserves termination. Among the meta-interpreters that are analysed correctly are a proof trees constructing meta-interpreter, different kinds of tracers and reasoners. To appear without appendix in Theory and Practice of Logic Programming. | |
| dc.description | To appear in Theory and Practice of Logic Programming (TPLP) | |
| dc.identifier | https://arxiv.org/abs/cs/0110035 | |
| dc.identifier | http://arxiv.org/abs/cs/0110035 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30861 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.1.6; D.2.4 | |
| dc.title | On termination of meta-programs | |
| dc.type | text |