Dependent types for program termination verification

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 231-242

  Xi, H ^a  

^a UNIVERSITY OF CINCINNATI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SYSTEMS PROGRAMMING; PROGRAMMING THEORY; SYSTEMS ANALYSIS; THEOREM PROVING;

ALGEBRAIC DATATYPES; POLYMORPHISM; PROGRAM TERMINATION VERIFICATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034865649     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Termination of rewriting systems by polynomial interpretations and its implementation
2. Orderings for term rewriting systems
3. The Coq proof assistant user's guide
4. Proof-directed debugging
5. Proving the correctness of reactive systems using sized types
6. The higher-order recursive path ordering
7. PVS: Combining specification, proof checking, and model checking
8. Termination and reduction checking in the logical framework
9. Termination analysis for mercury
10. Intensional interpretations of functionals of finite type I
11. Efficient tests for top-down termination of logic rules
12. Dependently typed data structures
13. Dependent types for program termination verification
14. Eliminating array bound checking through dependent types
15. Dependent types in practical programming
16. Termination of term rewriting by semantic labelling