Meta-programming in logic programming
A classification of meta-level architectures
Meta-programming in logic programming
Tracing requirements for multi-layered meta-programming
Meta-programming in logic programming
Complete sets of frontiers in logic-based program transformation
Meta-programming in logic programming
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Formalization of metaprogramming for real
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
The Go¨del programming language
The Go¨del programming language
Effectiveness of global analysis in strict independence-based automatic parallelization
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
Meta-logics and logic programming
Meta-logics and logic programming
Two semantics for definite meta-programs, using the non-ground representation
Meta-logics and logic programming
Meta-variables in logic programming, or in praise of ambivalent syntax
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
From logic programming to Prolog
From logic programming to Prolog
Termination analysis: some practical properties of the norm and level mapping space
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination with multiset orderings
Communications of the ACM
Termination proofs for logic programs with tabling
ACM Transactions on Computational Logic (TOCL)
Logic for Problem Solving
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
Program Termination Analysis in Polynomial Time
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Building Composable Aspect-Specific Languages with Logic Metaprogramming
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Acceptability with General Orderings
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Abstracting Numerical Values in CLP(H, N)
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Combining Norms to Prove Termination
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Reuse of Results in Termination Analysis of Typed Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Preserving Universal Termination through Unfold/Fold
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Modular Verification of Logic Programs
Modular Verification of Logic Programs
On modular termination proofs of general logic programs
Theory and Practice of Logic Programming
Accomplishments and research challenges in meta-programming
SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation
Information and Computation
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Automated termination analysis for logic programs with cut*
Theory and Practice of Logic Programming
Dependency triples for improving termination analysis of logic programs with cut
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Detecting decidable classes of finitely ground logic programs with function symbols
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Bounded programs: a new decidable class of logic programs with function symbols
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
The term 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.