Modelling general recursion in type theory

Mathematical Structures in Computer Science

Volumn 15, Issue 4, 2005, Pages 671-708

  Bove, Ana ^a   Capretta, Venanzio ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646127648     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129505004822     Document Type: Article

References (45)

1. Abel, A. (2004) Termination checking with types. In: Fix Points in Computer Science 2003 (FICS03). Special issue of Theoretical Informatics and Applications (RAIRO).
2. Aczel, P. (1977) An Introduction to Inductive Definitions. In: Barwise, J. (ed.) Handbook of Mathematical Logic, North-Holland Publishing Company 739-782.
3. Balaa, A. and Bertot, Y. (2000) Fix-point equations for well-founded recursion in type theory. In: Harrison, J. and Aagaard, M. (eds.) Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000. Springer-Verlag Lecture Notes in Computer Science 1869 1-16.
4. Balaa, A. and Bertot, Y. (2002) Fonctions récursives générales par itération en théorie des types. Journées Francophones des Langages Applicatifs JFLA02, INRIA.
5. Barendregt, H. and Geuvers, H. (2001) Proof-assistants using dependent type systems. In: Robinson, A. and Voronkov, A. (eds.) Handbook of Automated Reasoning, Chapter 18, Elsevier 1149-1238.
6. Barendregt, H. P. (1992) Lambda calculi with types. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science 2, Oxford University Press, 117-309.
7. Barthe, G., Frade, M., Giménez, E., Pinto, L. and Uustalu, T. (2004) Type-based termination of recursive definitions. Mathematical Structures in Computer Science 14 (1) 97-141.
8. Bell, J. L. and Machover, M. (1977) A course in mathematical logic, North-Holland.
9. Bertot, Y., Capretta, V. and Barman, K. D. (2002) Type-theoretic functional semantics. In: Carreno, V. A., Munoz, C. A. and Tahar, S. (eds.) Theorem Proving in Higher Order Logics: 15th International Conference, TPHOLs 2002. Springer-Verlag Lecture Notes in Computer Science 2410 83-97.
10. Bove, A. (1999) Programming in Martin-Löf type theory: Unification - A non-trivial example, Licentiate Thesis of the Department of Computer Science, Chalmers University of Technology. (Available at http://www.es.chalmers.se/ ~bove/Papers/lic_thesis.ps.gz.)
11. Bove, A. (2001) Simple general recursion in type theory. Nordic Journal of Computing 8 (1) 22-42.
12. Bove, A. (2002a) General Recursion in Type Theory, Ph.D. thesis, Chalmers University of Technology, Department of Computing Science. (Available at http://www.cs.chalmers.se/bove/Papers/phd_thesis.ps.gz.)
13. Bove, A. (2002b) Mutual general recursion in type theory. Technical Report, Chalmers University of Technology. (Available at http://www.cs.chalmers. se/~bove/Papers/mutual.rec.ps.gz.)
14. Bove, A. (2003) General recursion in type theory. In: Geuvers, H. and Wiedijk, F. (eds.) Types for Proofs and Programs, International Workshop TYPES 2002, The Netherlands. Springer-Verlag Lecture Notes in Computer Science 2646 39-58.
15. Bove, A. and Capretta, V. (2001) Nested general recursion and partiality in type theory. In: Boulton, R. J. and Jackson, P.B. (eds.) Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001. Springer-Verlag Lecture Notes in Computer Science 2152 121-135.
16. Bove, A. and Capretta, V. (2005) Recursive functions with higher order domains. In: Urzyczyn, P. (ed.) Typed Lambda Calculi and Applications. 7th International Conference, TLCA 2005, Nara, Japan. Springer-Verlag Lecture Notes in Computer Science 3461 116-130.
17. Bundy, A. (2001) The automation of proof by mathematical induction. In: Robinson, A. and Voronkov, A. (eds.) Handbook of Automated Reasoning 1, Elsevier Science and MIT Press 845-912.
18. Capretta, V. (2002) Abstraction and Computation, Ph.D thesis, Computing Science Institute, University of Nijmegen.
19. Carreno, V. A., Munoz, C.A. and Tahar, S. (eds.) (2002) Theorem Proving in Higher Order Logics: 15th International Conference, TPHOLs 2002. Springer-Verlag Lecture Notes in Computer Science 2410.
20. Coquand, T. and Huet, G. (1988) The Calculus of Constructions. Information and Computation 76 95-120.
21. Coquand, T., Nordström, B., Smith, J.M. and von Sydow, B. (1994) Type theory and programming. EATCS 52.
22. Coquand, T. and Paulin, C. (1990) Inductively defined types. In: Martin-Löf, P. (ed.) Proceedings of Colog '88. Springer-Verlag Lecture Notes in Computer Science 417.
23. de Mast, P., Jansen, J.-M., Bruin, D., Fokker, J., Koopman, P., Smetsers, S., van Eekelen, M. and Plasmeijer, R. (2001) Functional Programming in Clean, Computing Science Institute, University of Nijmegen.
24. Dubois, C. and Donzeau-Gouge, V. V. (1998) A step towards the mechanization of partial functions: Domains as inductive predicates. In: Kerber, M. (ed.) CADE-15, The 15th International Conference on Automated Deduction. WORKSHOP Mechanization of Partial Functions 53-62.
25. Dybjer, P. (2000) A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic 65 (2).
26. Finn, S., Fourman, M. and Longley, J. (1997) Partial functions in a total setting. Journal of Automated Reasoning 18 (1) 85-104.
27. Hagino, T. (1987) A Categorical Programming Language, Ph.D. thesis, University of Edinburgh.
28. Howard, W.A. (1980) The formulae-as-types notion of construction. In: Seldin, J.P. and Hindley, J. R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press 479-490.
29. Hutter, D. (1992) Automatisierung der vollständigen Induktion, Oldenbourg Verlag.
30. Jones, S. P., (ed.) (2003) Haskell 98 Language and Libraries. The Revised Report, Cambridge University Press.
31. Manna, Z. and McCarthy, J. (1970) Properties of programs and partial function logic. Machine Intelligence 5 27-37.
32. Martin-Löf, P. (1984) Intuitionistic Type Theory, Bibliopolis, Napoli.
33. McBride, C. and McKinna, J. (2004) The view from the left. Journal of Functional Programming 14 (1) 69-111.
34. Milner, R., Tofte, M., Harper, R. and MacQueen, D. (1997) The Definition of Standard ML, MIT Press.
35. Nordström, B. (1988) Terminating General Recursion. BIT 28 (3) 605-619.
36. Nordström, B., Petersson, K. and Smith, J. M. (1990) Programming in Martin-Lofs Type Theory. An Introduction, Oxford University Press.
37. Paulson, L. C. (1986) Proving Termination of Normalization Functions for Conditional Expressions. Journal of Automated Reasoning 2 63-74.
38. Pfenning, F. and Paulin-Mohring, C. (1990) Inductively defined types in the Calculus of Constructions. In: Proceedings of Mathematical Foundations of Programming Semantics. Springer-Verlag Lecture Notes in Computer Science 442. (Also, Technical report CMU-CS-89-209.)
39. Phillips, J. C. C. (1992) Recursion theory. Handbook of Logic in Computer Science 1 (Background: Mathematical Structures), Oxford University Press 79-187.
40. Sørensen, M. H. B. and Urzyczyn, P. (1998) Lectures on the Curry-Howard isomorphism. Available as DIKU Rapport 98/14.
41. Walther, C. (1992) Computing induction axioms. In: International Conference on Logic Programming and Automated Reasoning, LPAR 92. Springer-Verlag Lecture Notes in Artificial Intelligence 624.
42. Werner, B. (1994) Méta-théorie du Calcul des Constructions Inductives, Ph.D. thesis, Université Paris 7.
43. Wiedijk, F. and Zwanenburg, J. (2003) First order logic with domain conditions. In: Theorem Proving in Higher Order Logics, TPHOLs 2003. Springer-Verlag Lecture Notes in Computer Science 2758 221-237.
44. Winskel, G. (1993) The formal semantics of programming languages: An introduction, The MIT Press.
45. Zhang, X., Munro, M., Harman, M. and Hu, L. (2002) Weakest precondition for general recursive programs formalized in Coq. In: Carreno, V. A., Munoz, C. A. and Tahar, S. (eds.) Theorem Proving in Higher Order Logics: 15th International Conference, TPHOLs 2002. Springer-Verlag Lecture Notes in Computer Science 2410 332-347.