Type-based termination of recursive definitions

Mathematical Structures in Computer Science

Volumn 14, Issue 1, 2004, Pages 97-141

  Barthe, G ^a   Frade, M J ^b   Gimenez E ^c   Pinto, L ^b   Uustalu, T ^b  

^a INRIA   (France)

^b UNIVERSITY OF MINHO   (Portugal)

^c Trusted Logic   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84855618972     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129503004122     Document Type: Article

References (48)

1. Abel, A. (2000) Specification and verification of a formal system for structurally recursive functions. In: Coquand, T., Dybjer, P., Nordstrom, B. and Smith, J. (eds.) Proceedings of TYPES'99. Springer-Verlag Lecture Notes in Computer Science 1956 1–20.
2. Abel, A. and Altenkirch, T. (2002) A predicative analysis of structural recursion. J. of Functional Programming 12 (1) 1–41.
3. Altenkirch, T. (1999) Logical relations and inductive/coinductive types. In: Gottlob, G., Grandjean, E. and Seyr, K. (eds.) Proceedings of CSL’98. Springer-Verlag Lecture Notes in Computer Science 1584 343–354.
4. Amadio, R. M. and Coupet-Grimal, S. (1998) Analysis of a guard condition in type theory (extended abstract). In: Nivat, M. (ed.) Proceedings of FoSSaCS’98. Springer-Verlag Lecture Notes in Computer Science 1378 48–62.
5. Bac, A. (1998) Un algorithme d’inference de types pour les types coinductifs. Memoire de DEA, Ecole Normale Superieure de Lyon.
6. Barras, B. (1999) Auto-validation dun systeme de preuves avec families inductives, Ph.D. thesis, Universite Paris 7.
7. Blanqui, F., Jouannaud, J.-P. and Okada, M. (2002) Inductive data type systems. Theoretical Computer Science 272 (1–2) 41–68.
8. Chin, W.-N. and Khoo, S.-C. (2001) Calculating sized types. Higher-Order and Symbolic Computation 14 (F2–3) 261–300.
9. Coquand, T. (1992) Pattern matching with dependent types. In: B. Nordstrom, K. Pettersson, and G. Plotkin (eds.) Informal Proceedings of TYPES’92, Dept, of Computing Science, Chalmers Univ. of Technology and Goteborg Univ. 71–84. (Available at ftp://ftp.cs.chalmers.se/pub/cs-reports/baastad.92/proc.ps.Z.)
10. Coquand, T. (1994) Infinite objects in type theory. In: Barendregt, H. and Nipkow, T. (eds.) Proceedings of TYPES’93. Springer-Verlag Lecture Notes in Computer Science 806 62–78.
11. Coquand, T. and Paulin, C. (1990) Inductively defined types (preliminary version). In: Martin-Lof, P. and Mints, G. (eds.) Proceedings of COLOG’88. Springer-Verlag Lecture Notes in Computer Science 417 50–66.
12. Cornes, C. (1997) Conception dun langage de haut niveau de representation de preuves: Recurrence par filtrage de motifs; Unification en presence de types inductifs primitifs; Synthese de lemmes d’inversion, Ph.D. thesis, Universite de Paris 7. Cousot, P. and Cousot, R. (1996) Abstract interpretation. ACM Computing Surveys 28 (2) 324–328.
13. Dybjer, P. (1994) Inductive families. Formal Aspects of Computing 6 (4) 440–465.
14. Elbers, H. (1998) Connecting formal and informal mathematics, Ph.D. thesis, Technische Universiteit Eindhoven.
15. Geuvers, H. (1992) Inductive and coinductive types with iteration and recursion. In: Nordstrom, B., Pettersson, K. and Plotkin, G. (eds.) Informal Proceedings of TYPES'92 Dept. of Computing Science, Chalmers Univ. of Technology and Goteborg Univ. 193–217. (Available at ://ftp.cs.chalmers.se/pub/cs-reports/baastad.92/proc.ps.Z.)
16. Giesl, J., Walther, C. and Brauburger, J. (1998) Termination analysis for functional programs. In: Bibel, W. and Schmitt, P. (eds.) Automated Deduction: A Basis for Applications, Vol. 3: Applications. Applied Logic Series, Kluwer Academic Publishers 10 135–164.
17. Gimenez, E. (1995) Codifying guarded definitions with recursion schemes. In: Dybjer, P. and Nordstrom, B. (eds.) Proceedings of TYPES'94. Springer-Verlag Lecture Notes in Computer Science 996 39–59.
18. Gimenez, E. (1996) A calculus of infinite constructions and its application to the verification of reactive systems, Ph.D. thesis, Ecole Normale Superieure de Lyon.
19. Gimenez, E. (1998) Structural recursive definitions in Type Theory. In: Larsen, K. G., Skyum, S. and Winskel, G. (eds.) Proceedings of ICALP'98. Springer-Verlag Lecture Notes in Computer Science 1443 397–408.
20. Grobauer, B. (2001) Cost recurrences for DML programs. In: Proceedings of ICFP’01. SIGPLAN Notices 36 (10) 253–264.
21. Hofmann, M. and Streicher, T. (1994) The groupoid model refutes uniqueness of identity proofs. In: Proceedings of LICS’94, IEEE CS Press 208–212.
22. Hughes, J., Pareto, L. and Sabry, A. (1996) Proving the correctness of reactive systems using sized types. In: Proceedings of POPL’96, ACM Press 410–423.
23. Jouannaud, J. P. and Okada, M. (1997) Abstract data type systems. Theoretical Computer Science 173 (2) 349–391.
24. Lee C.-S., Jones, N. D. and Ben-Amram, A. M. (2001) The size-change principle for program termination. In: Proceedings of POPL’Ol. SIGPLAN Notices 36 (3) 81–92.
25. Leivant, D. (1983) Reasoning about functional programs and complexity classes associated with type disciplines. In: Proceedings of FOCS’83, IEEE Computer Society Press 460–469.
26. Leivant, D. (1990) Contracting proofs to programs. In: Odifreddi, P. (ed.) Logic and Computer Science. APIC Studies in Data Processing, Academic Press 31 279–327.
27. Luo, Z. (1994) Computation and Reasoning: A Type Theory for Computer Science. Int. Series of Monographs in Computer Science, Clarendon Press 11.
28. Manoury, P. and Simonot, M. (1994) Automatizing termination proofs of recursively defined functions. Theoretical Computer Science 135 (2) 319–343.
29. Martin-Lof, P. (1971) Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J. E. (ed.) Proceedings of 2nd Scandinavian Logic Symp. Studies in Logic and the Foundations of Mathematics, North-Holland 63 179–216.
30. Matthes, R. (1998) Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types, Ph.D. thesis, Fachbereich Mathematik, Ludwig-Maximilians-Universitat Munchen.
31. Matthes, R. (1999) Monotone fixed-point types and strong normalization. In: Gottlob, G., Grandjean, E. and Seyr, K. (eds.) Proceedings of CSL’98. Springer-Verlag Lecture Notes in Computer Science 1584 298–312.
32. Matthes, R. (2002) Tarski's fixed-point theorem and lambda calculi with monotone inductive types. Synthese 133 (1) 107–129.
33. McBride, C. (1999) Dependently Typed Functional Programs and Their Proofs, Ph.D. thesis, Laboratory for Foundations of Computer Science, Dept, of Computer Science, Univ. of Edinburgh.
34. Mendler, N.P. (1987) Recursive types and type constraints in second-order lambda-calculus. In: Proceedings of TICS’’87, IEEE Computer Society Press 30–36.
35. Mendler N. P. (1991) Inductive types and type constraints in the second-order lambda-calculus. Annals of Pure and Applied Logic 51 (1–2) 159–172.
36. Nordstrom, B., Petersson, K. and Smith, J. (1990) Programming in Martin-Lof’s Type Theory: An Introduction. Int. Series of Monographs on Computer Science, Clarendon Press 7.
37. Pareto, L. (2000) Types for crash prevention, Ph.D. thesis, Chalmers Univ. of Techn., Goteborg.
38. Paulin-Mohring, C. (1993) Inductive definitions in the system Coq: Rules and properties. In: Bezem, M. and Groote, J. F. (eds.) Proceedings of TLCA’93. Springer-Verlag Lecture Notes in Computer Science 664 328–345.
39. Pfenning, F. and Paulin-Mohring, C. (1990) Inductively defined types in the calculus of constructions. In: Main, M., Melton, A., Mislove, M. and Schmidt, D. (eds.) Proceedings of MFPS’89. Springer-Verlag Lecture Notes in Computer Science 442 209–228.
40. Pierce, B., Dietzen, S. and Michaylov, S. (1989) Programming in higher-order typed lambda-calculi. Technical Report CMU-CS-89-111, School of Computer Science, Carnegie-Mellon Univ.
41. Splawski, Z. and Urzyczyn, P. (1999) Type fixpoints: Iteration vs. recursion. In: Proceedings of ICFP’99. SIGPLAN Notices 34 (9) 102–113.
42. Telford, A. and Turner, D. (1997) Ensuring streams flow. In: Johnson, M. (ed.) Proceedings of AMAST’97. Springer-Verlag Lecture Notes in Computer Science 1349 509–523.
43. Uustalu, T. (1998) Natural Deduction for Intuitionistic Least and Greatest Fixedpoint Logics, with an Application to Program Construction, Ph.D. thesis (Dissertation TRITA-IT AYH 98:03), Dept, of Teleinformatics, Royal Inst, of Technology, Stockholm.
44. Uustalu, T. and Yene, Y. (1997) A cube of proof systems for the intuitionistic predicate v-logic. In: Haveraaen, M. and Owe, O. (eds.) Proceedings of NWPT’96. Research Report 248, Dept, of Informatics, University of Oslo 237–246.
45. Uustalu, T. and Vene, V. (2002) Least and greatest fixedpoints in intuitionistic natural deduction. Theoretical Computer Science 272 (1–2) 315–339.
46. Xi, H. and Pfenning, F. (1998) Eliminating array bound checking through dependent types. In: Proceedings of PLDT98. SIGPLAN Notices 33 (5) 249–257.
47. Xi, H. and Pfenning, F. (1999) Dependent types in practical programming. In: Proceedings of POPL’99, ACM Press 214–227.
48. Xi, H. (2001) Dependent types for program termination verification. In: Proceedings of LICS’01, IEEE CS Press 231–242.