General recursion via coinductive types

Logical Methods in Computer Science

Volumn 1, Issue 2, 2005, Pages

  Capretta, Venanzio ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Coinductive types; General recursion; Monad; Type theory

Indexed keywords

COMPUTATION THEORY; FORMAL LANGUAGES; SEMANTICS;

COINDUCTIVE TYPES; INDUCTIVE DEFINITIONS; INTENSIONAL TYPE THEORY; MONAD; OPERATIONAL SEMANTICS; RECURSIONS; THEORETICAL COMPUTER SCIENCE; TYPE THEORY;

RECURSIVE FUNCTIONS;

EID: 85001986144     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-1(2:1)2005     Document Type: Article

References (61)

1. Peter Aczel. Non-Well-Founded Sets. Number 14 in CSLI Lecture Notes. Stanford University, 1988.
2. Peter Aczel. Algebras and coalgebras. In Roland Backhouse, Roy Crole, and Jeremy Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, volume 2297 of LNCS, pages 79-88. Springer, 2002.
3. Antonia Balaa and Yves Bertot. Fix-point equations for well-founded recursion in type theory. In J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 2000.
4. H. P. Barendregt. Lambda calculi with types. In S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2, pages 117-309. Oxford University Press, 1992.
5. Henk Barendregt and Herman Geuvers. Proof-assistants using dependent type systems. In Alan Robin-son and Andrei Voronkov, editors, Handbook of Automated Reasoning, pages 1151-1238. Elsevier Science Publishers, 2001.
6. G. Barthe and T. Coquand. An introduction to dependent type theory. In G. Barthe, P. Dybjer, L. Pinto, and J. Saraiva, editors, Proceedings of APPSEM’00, volume 2395 of LNCS. Springer, 2002. To appear.
7. G. Barthe, M. J. Frade, E. Gimnez, L. Pinto, and T. Uustalu. Type-based termination of recursive definitions. Mathematical Structures in Computer Science, 14:97-141, 2002.
8. Gilles Barthe, Venanzio Capretta, and Olivier Pons. Setoids in type theory. Journal of Functional Programming, 13(2):261-293, 2003.
9. Gilles Barthe, Benjamin Grégoire, and Fernando Pastawski. Practical inference for type-based termi-nation in a polymorphic setting. In Urzyczyn [58], pages 71-85.
10. Jon Barwise and Lawrence Moss. Vicious Circles. Number 60 in CSLI Lecture Notes. CSLI, Stanford, California, 1996.
11. Nick Benton, John Hughes, and Eugenio Moggi. Monads and effects. In Gilles Barthe, Peter Dybjer, Luís Pinto, and João Saravia, editors, Applied Semantics, volume 2395 of LNCS, pages 42-122. Springer, 2002. International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures.
12. Yves Bertot. Fileters on coinductive streams, an application to eratosthenes’ sieve. In Urzyczyn[58], pages 102-115.
13. Yves Bertot, Venanzio Capretta, and Kuntal Das Barman. Type-theoretic functional sematics. In V. A. Carreno, C. A. Munoz, and S. Tahar, editors, Theorem Proving in Higher Order Logics, volume 2410 of LNCS, pages 83-97. Springer, 2002. 15th International Conference, TPHOLs 2002, Hampton, VA, USA, August 20-23, 2002.
14. A. Bove. Simple general recursion in type theory. Nordic Journal of Computing, 8(1):22-42, Spring 2001.
15. Ana Bove and Venanzio Capretta. Nested general recursion and partiality in type theory. In Richard J. Boulton and Paul B. Jackson, editors, Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, volume 2152 of Lecture Notes in Computer Science, pages 121-135. Springer-Verlag, 2001.
16. Ana Bove and Venanzio Capretta. Modelling general recursion in type theory. To appear in Mathematical Structures in Computer Science. Available at http://www.science.uottawa.ca/~vcapr396/,2004.
17. Ana Bove and Venanzio Capretta. Recursive functions with higher order domains. In Urzyczyn[58], pages 116-130.
18. Venanzio Capretta. Universal algebra in type theory. In Yves Bertot, Gilles Dowek, André Hirschowits, Christine Paulin, and Laurent Théry, editors, Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs ’99, volume 1690 of Lecture Notes in Computer Science, pages 131-148. Springer-Verlag, 1999.
19. Venanzio Capretta. Abstraction and Computation. PhD thesis, Computing Science Institute, University of Nijmegen, 2002.
20. R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.
21. Robert L. Constable. Partial functions in constructive formal theories. In Theoretical Computer Science, 6th GI-Conference, Dortmunt, volume 145 of LNCS, pages 1-18, January 1983.
22. Robert L. Constable and Scott Fraser Smith. Partial object in constructive type theory. In Logic in Computer Science, Ithaca, New York, pages 183-193, Washington, D.C., June 1987. IEEE.
23. Thierry Coquand. Infinite objects in type theory. In Henk Barendregt and Tobias Nipkow, editors, Types for Proofs and Programs. International Workshop TYPES’93, volume 806 of Lecture Notes in Computer Science, pages 62-78. Springer-Verlag, 1993.
24. Thierry Coquand and Gérard Huet. The Calculus of Constructions. Information and Computation, 76:95-120, 1988.
25. Thierry Coquand and Christine Paulin. Inductively defined types. In P. Martin-Löf, editor, Proceedings of Colog ’88, volume 417 of LNCS. Springer-Verlag, 1990.
26. Catherine Dubois and Véronique Viguié Donzeau-Gouge. A setp towards the mechanization of partial functions: domains as inductive predicates. Presented at CADE-15, Workshop on Mechanization of Partial Functions, 1998.
27. Herman Geuvers. Inductive and coinductive types with iteration and recursion. In Bengt Nord-ström, Kent Pettersson, and Gordon Plotkin, editors, Proccedings of the 1992 Workshop on Types for Proofs and Programs, Båstad, Sweden, June 1992, pages 193-217, 1992. ftp://ftp.cs.chalmers.se/pub/cs-reports/baastad.92/proc.dvi.Z.
28. Herman Geuvers. Logics and Type systems. PhD thesis, University of Nijmegen, September 1993.
29. Herman Geuvers, Erik Poll, and Jan Zwanenburg. Safe proof checking in type theory with Y. In F. Flum and M. Rodriguez-Artalejo, editors, Computer Science Logic (CSL’99), volume 1683 of LNCS, pages 439-452. Stringer-Verlag, 1999.
30. Eduardo Giménez. Codifying guarded definitions with recursive schemes. In Peter Dybjer, Bengt Nord-ström, and Jan Smith, editors, Types for Proofs and Programs. International Workshop TYPES ’94, volume 996 of Lecture Notes in Computer Science, pages 39-59. Springer, 1994.
31. Jean-Yves Girard. Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur. PhD thesis, Université Paris 7, 1972. Thèse d’Etat.
32. Jean-Yves Girard. Proofs and Types. Cambridge University Press, 1989. Translated and with appendices by Paul Taylor and Yves Lafont.
33. Tatsuya Hagino. A Categorical Programming Language. PhD thesis, University of Edinburgh, 1987.
34. Tatsuya Hagino. A typed lambda calculus with categorical type constructors. In D. H. Pitt, A. Poigné, and D. E. Rydeheard, editors, Category Theory and Computer Science, volume 283 of LNCS, pages 140-157. Springer, 1987.
35. Michael Hedberg. A type-theoretic interpretation of constructive domain theory. Journal of Automated Reasoning, 16:369-425, 1996.
36. Claudio Hermida and Bart Jacobs. Structural induction and coinduction in a fibrational setting. Information and Computation, 145:107-152, 1998.
37. W. A. Howard. The formulae-as-types notion of construction. In J. P. Selding and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479-490. Academic Press, 1980.
38. Bart Jacobs and Jan Rutten. A tutorial on (co)algebras and (co)induction. EATCS Bulletin, 62:222-259, 1997.
39. Per Martin-Löf. Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Science, VI, 1979, pages 153-175. North-Holland, 1982.
40. Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984. Notes by Giovanni Sambin of a series of lectures given in Padua, June 1980.
41. Conor McBride and James McKinna. The view from the left. draft paper, 2002.
42. N. P. Mendler, P. Panangaden, and R. L. Constable. Infinite objects in type theory. In Proceedings, Symposium on Logic in Computer Science, pages 249-255, Cambridge, Massachussetts, 16-18 June 1986. IEEE Computer Society.
43. Paul Francis Mendler. Inductive Definition in Type Theory. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, 1987.
44. Robin Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
45. Eugenio Moggi. Computational lambda-calculus and monads. In Proceedings, Fourth Annual Symposium on Logic in Computer Science (LICS), pages 14-23. IEEE Computer Society Press, 1989.
46. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
47. Bengt Nordström. Terminating general recursion. BIT, 28(3):605-619, October 1988.
48. Bengt Nordström, Kent Petersson, and Jan M. Smith. Programming in Martin-Löf ’s Type Theory. An Introduction, volume 7 of International Series of Monographs on Computer Scence. Oxford University Press, 1990.
49. C. Paulin-Mohring. Inductive Definitions in the System Coq-Rules and Properties. In M. Bezem and J.-F. Groote, editors, Proceedings of the conference Typed Lambda Calculi and Applications, volume 664 of LNCS, 1993. LIP research report 92-49.
50. Lawrence C. Paulson. Constructing recursion operators in intuitionistic type theory. Journal of Symbolic Computation, 2:325-355, 1986.
51. F. Pfenning and C. Paulin-Mohring. Inductively defined types in the Calculus of Constructions. In Proceedings of Mathematical Foundations of Programming Semantics, volume 442 of LNCS. Springer-Verlag, 1990. technical report CMU-CS-89-209.
52. J. C. C. Phillips. Recursion theory. In Handbook of Logic in Computer Science. Volume 1. Background: Mathematical Structures, pages 79-187. Oxford University Press, 1992.
53. John C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3-4):233-248, 1993.
54. Dana Scott. Domains for denotational semantics. In M. Nielsen and E. M. Schmidt, editors, Automata, Languages and Programming. Ninth Colloquium, volume 140 of Lecture Notes in Computer Science, pages 577-613. Springer-Verlag, 1982.
55. Morten Heine B. Sorensen and P. Urzyczyn. Lectures on the Curry-Howard isomorphism. Available as DIKU Rapport 98/14, 1998.
56. The Coq Development Team. LogiCal Project. The Coq Proof Assistant. Reference Manual. Version 7.3 1. INRIA, 2002.
57. The Coq Development Team. LogiCal Project. The Coq Proof Assistant. Reference Manual. Version 8. INRIA, 2004. Available at the web page http://pauillac.inria.fr/coq/coq-eng.html.
58. Pawel Urzyczyn, editor. Typed Lambda Calculi and Applications. 7th International Conference, TLCA 2005, Nara, Japan, April 2005, volume 3461 of LNCS. Springer, 2005.
59. Benjamin Werner. Méta-théorie du Calcul des Constructions Inductives. PhD thesis, Université Paris 7, 1994.
60. Glynn Winskel. The Formal Semantics of Programming Languages. The MIT Press, 1993.
61. G. C. Wraith. A note on categorical datatypes. In D. H. Pitt, D. E. Rydehead, P. Dybjer, A. M. Pitts, and A. Poigné, editors, Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science, pages 118-127. Springer-Verlag, 1989.