Computer Science – Programming Languages
Scientific paper
2001-10-17
Computer Science
Programming Languages
To appear in Theory and Practice of Logic Programming (TPLP)
Scientific paper
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.
Schreye Danny de
Serebrenik Alexander
No associations
LandOfFree
On termination of meta-programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On termination of meta-programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On termination of meta-programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-347489