Termination proofs for logic programs
Termination proofs for logic programs
A framework for defining logics
Journal of the ACM (JACM)
On proving the termination of algorithms by machine
Artificial Intelligence
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Mode and Termination Checking for Higher-Order Logic Programs
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Strict Functionals for Termination Proofs
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A Termination Ordering for Higher Order Rewrite System
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The Higher-Order Recursive Path Ordering
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Higher-order rewriting with dependent types (lambda calculus)
Higher-order rewriting with dependent types (lambda calculus)
A Monotonic Higher-Order Semantic Path Ordering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Verifying Termination and Reduction Properties about Higher-Order Logic Programs
Journal of Automated Reasoning
Mechanically verifying correctness of CPS compilation
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination and productivity checking with continuous types
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Mechanically verifying correctness of CPS compilation
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 0.00 |
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderings describing relations between input and output of well-moded predicates. These reduction constraints are exploited during termination checking to infer that a specified termination order holds. To reason about parametric higher-order sub-term orderings, we introduce a deductive system as a logical foundation for proving termination. This allows the study of proof-theoretical properties, such as consistency, local soundness and completeness and decidability. We concentrate here on proving consistency of the presented inference system. The termination and reduction checker are implemented as part of the Twelf system and enable us to verify proofs by complete induction.