Practical inference for type-based termination in a polymorphic setting

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 71-85

  Barthe, Gilles ^a   Grégoire, Benjamin ^a   Pastawski, Fernando ^b  

^a INRIA   (France)

^b UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

CONSTRAINTS; RECURSIVE DEFINITIONS; TYPING; Λ-CALCULUS;

COMPUTATION THEORY;

EID: 24944541539     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_7     Document Type: Conference Paper

References (17)

1. A. Abel. Termination checking with types. RAIRO- Theoretical Informatics and Applications, 38:277-320, October 2004.
2. R. Amadio and S. Coupet-Grimal. Analysis of a guard condition in type theory. In M. Nivat, editor, Proceedings of FOSSACS'98, volume 1378 of Lecture Notes in Computer Science, pages 48-62. Springer-Verlag, 1998.
3. A. Bac. Un algorithme d'inférence de types pour les types coinductifs. Master's thesis, École Normale Supérieure de Lyon, 1998.
4. B. Barras. Auto-validation d'un système de preuves avec familles inductives. PhD thesis, Université Paris 7, 1999.
5. G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu. Type-based termination of recursive definitions. Mathematical Structures in Computer Science, 14:97-141, February 2004.
6. F. Blanqui. A type-based termination criterion for dependently-typed higher-order rewrite systems. In V. van Oostrom, editor, Proceedings of RTA '04, volume 3091 of Lecture Notes in Computer Science, pages 24-39, 2004.
7. W.-N. Chin and S.-C. Khoo. Calculating sized types. Higher-Order and Symbolic Computation, 14(2-3):261-300, September 2001.
8. Coq Development Team. The Coq Proof Assistant User's Guide. Version 8.0, January 2004.
9. H. Geuvers. Inductive and coinductive types with iteration and recursion. In B. Nordström, K. Pettersson, and G. Plotkin, editors, Informal proceedings of Logical Frameworks'92, pages 193-217, 1992.
10. E. Giménez. Un calcul de constructions infinies et son application à la vérification de systèmes communicants. PhD thesis, Ecole Normale Superieure de Lyon, 1996.
11. E. Giménez. Structural recursive definitions in Type Theory. In K.G. Larsen, S. Skyum, and G. Winskel, editors, Proceedings of ICALP'98, volume 1443 of Lecture Notes in Computer Science, pages 397-408. Springer-Verlag, 1998.
12. J. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In Proceedings of POPL'96, pages 410-423. ACM Press, 1996.
13. N. P. Mendler. Inductive types and type constraints in the second-order lambda calculus. Annals of Pure and Applied Logic, 51(1-2):159-172, March 1991.
14. M. Steffen. Polarized Higher-order Subtyping. PhD thesis, Department of Computer Science, University of Erlangen, 1997.
15. B. Werner. Méta-théorie du Calcul des Constructions Inductives. PhD thesis, Université Paris 7, 1994.
16. H. Xi. Dependent Types for Program Termination Verification. In Proceedings of LICS'01, pages 231-242. IEEE Computer Society Press, 2001.
17. H. Xi and F. Pfenning. Dependent types in practical programming. In Proceedings of POPL'99, pages 214-227. ACM Press, 1999.