Termination and Reduction Checking for Higher-Order Logic Programs (0)
| Venue: | In First International Joint Conference on Automated Reasoning (IJCAR |
| Citations: | 11 - 1 self |
BibTeX
@INPROCEEDINGS{Pientka_terminationand,
author = {Brigitte Pientka},
title = {Termination and Reduction Checking for Higher-Order Logic Programs},
booktitle = {In First International Joint Conference on Automated Reasoning (IJCAR},
year = {},
pages = {401--415},
publisher = {Springer Verlag, LNCS}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. 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 input and output relations. These reduction orderings are exploited during termination checking to infer that a specified termination order holds. To reason about parametric higher-order subterm 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 enables us to verify proofs by complete induction. 1 Introduction One of the central problems in verifying specifications and checking proofs about them is the need to prove termination. Several automated methods...
