An ordinal measure based procedure for termination of functions

Theoretical Computer Science

Volumn 254, Issue 1-2, 2001, Pages 63-94

  Monin, François ^a,b   Simonot, Marianne ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITÉ DE SAVOIE   (France)

^c CEDRIC CNAM   (France)

Author keywords

Formal proofs; NQTHM; Ordinal measures; Termination

Indexed keywords

FORMAL LOGIC; THEOREM PROVING;

BOYER-MOORE THEOREM;

RECURSIVE FUNCTIONS;

EID: 0034913902     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00118-8     Document Type: Article

References (18)

1. Integrating decision procedures into heuristic theorem provers: A case study with linear arithmetic
2. An ordinal calculus for proving termination in term rewriting
3. Termination of nested and mutually recursive algorithms
4. Lambda-calculus, types and models
5. Programming with proofs
6. Automatizing termination proofs of recursively defined functions
7. ProPre: A programming language with proofs
8. Recursive programming with proofs
9. An introduction to well-ordering proofs in Martin-Löf's type theory
10. Function definition in higher order logic
11. A User's friendly syntax to define recursive functions as typed lambda-terms