Inductive and Coinductive Components of Corecursive Functions in Coq

Electronic Notes in Theoretical Computer Science

Volumn 203, Issue 5, 2008, Pages 25-47

  Bertot, Yves ^a   Komendantskaya, Ekaterina ^a  

^a INRIA   (France)

Author keywords

Accessibility Predicates; Coinduction; Coq; Guardedness; Induction; Productiveness

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; FUNCTIONS; NUMBER THEORY; SYNTACTICS;

(MIN ,MAX ,+) FUNCTIONS; CO INDUCTIVE DEFINITIONS; CO RECURSIVE FUNCTIONS; CONSTRUCTIVE TYPE THEORY; ELSEVIER (CO); FORMALISATION; SYSTEMATIC (CO);

RECURSIVE FUNCTIONS;

EID: 44649150140     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.05.018     Document Type: Article

References (44)

1. A. Abel. Type-Based Termination. A Polymorphic Lambda-Calculus with Sized Higher-Order Types. PhD thesis, Fakültat für Mathematik, Informatik und Statistik der Ludwig-Maximilians-Universität München, 2006
2. Aczel P. An introduction to inductive definitions. Handbook of Mathematical Logic (1977), North-Holland Publishing Company 739-782
3. Aczel P. Algebras and coalgebras. Algebraic and Coalgebraic Methods in the Mathematics of Program Construction (2000) 79-88
4. Balaa A., and Bertot Y. Fixpoint 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. LNCS volume 1869 (2000), Springer-Verlag 1-16
5. Balaa A., and Bertot Y. Fonctions récursives générales par itération en théorie des types. Journées Francophones pour les Langages Applicatifs (Jan. 2002)
6. Barendregt H. Lambda calculi with types. In: Abramsky S., Gabbay D., and Maibaum T. (Eds). Handbook of Logic in Computer Science, volume II (1992), Oxford University Press 117-309
7. Barendregt H., and Geuvers H. Proof-checking using dependent type systems. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning, volume II (2001), Elsevier Science 1149-1240 chapter 18
8. Barthe G. The relevance of proof irrelevance. Authomata, Languages and Programming. (ICALP'98). LNCS volume 1443 (1998), Springer Verlag 755-768
9. Barthe G., Frade M.J., Giménez E., Pinto L., and Uustalu T. Type-based termination of recursive definitions. Mathematical Structures in Computer Science 14 (Feb. 2004) 97-141
10. Bertot Y. Filters and co-inductive streams, an application to eratosthenes' sieve. TLCA. LNCS volume 3461 (2005), Springer Verlag 102-115
11. Bertot Y. Affine functions and series with co-inductive real numbers. Mathematical Structures in Computer Science 17 1 (2007) 37-63
12. Bertot Y., and Castéran P. Interactive Theorem Proving and Program Development, Coq'Art: the Calculus of Constructions (2004), Springer-Verlag
13. Bertot Y., and Komendantskaya E. Experiments towards general co-recursion: Coq code, 2008. http://hal.inria.fr/inria-00277075/en/
14. Bove A. Simple general recursion in type theory. Nordic Journal of Computing 8 1 (2001) 22-42
15. A. Bove. General Recursion in Type Theory. PhD thesis, Department of Computing Science, Chalmers University of Technology, 2002
16. A. Bove. General recursion in type theory. In TYPES, pages 39-58, 2002
17. A. Bove and V. Capretta. Nested general recursion and partiality in type theory. In TPHOLs, pages 121-135, 2001
18. Bove A., and Capretta V. Modelling general recursion in type theory. Mathematical Structures in Computer Science 15 4 (2005) 671-708
19. Buchholz W. A term calculus for (co-)recursive definitions on streamlike data structures. Ann. Pure Appl. Logic 136 1-2 (2005) 75-90
20. Capretta V. General recursion via coinductive types. Logical Methods in Computer Science 1 2 (2005)
21. T. Coquand. Pattern-matching in type theory. In Informal Proceedings of the 1992 workshop on Types for Proofs and Programs, pages 71-84. B. Nordström and K. Petersson and G. Plotkin, 1992
22. Coquand T. Infinite objects in type theory. Types for Proofs and Programs. Int. Workshop TYPES'93. LNCS volume 806 (1994), Springer-Verlag 62-78
23. Coquand T., and Huet G. The calculus of constructions. Information and Computation 76 (1988)
24. E. Dijkstra. On the productivity of recursive definitions, 1980. EWD749
25. Edalat A., and Potts J. A new representation for exact real numbers. MFPS XIII. ENTCS 6 (1997) Elsevier
26. J. Endrullis, C. Grabmayer, D. Hendriks, A. Isihara, and J.W. Klop. Productivity of stream definitions. In FCT, pages 274-287, 2007
27. H. Geuvers. Logics and Type Systems. PhD thesis, University of Nijmegen, 1993
28. P.D. Gianantonio. A Functional Approach to Computability on Real Numbers. PhD thesis, Universita di Pisa-Genova-Udine, 1993
29. P.D. Gianantonio and M. Miculan. A unifying approach to recursive and co-recursive definitions. In TYPES, pages 148-161, 2002
30. P.D. Gianantonio and M. Miculan. Unifying recursive and co-recursive definitions in sheaf categories. In FoSSaCS, pages 136-150, 2004
31. E. Gimenez. Un Calcul de Constructions Infinies et son Application a la Verification des Systemes Communcants. PhD thesis, Laboratoire de l'Informatique du Parallelism, Ecole Normale Superiere de Lyon, 1996
32. Howard W. The formulae-as-types notion of construction. In: Selding J., and Hindley J. (Eds). To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (1980), Academic Press 479-490
33. Huet G. Induction principles formalised in calculus of constructions. In: Seldin J., and Hindley J. (Eds). To H.B. Curry: Essays on Combinatory Logic, Lmabda Calculus, and formalism (1988), Academic Press 479-490
34. Jacobs B. Exercises in coalgebraic specification. In: Backhouse R., Crole R., and Gibbons J. (Eds). Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS number 2297 (2002), Springer 237-280
35. Jacobs B., and Rutten J. A tutorial on (co)algebras and (co)induction. EATCS Bulletin 62 (1997) 222-259
36. J. Matthews. Recursive function definition over coinductive types. In TPHOLs, pages 73-90, 1999
37. M. Niqui. Formalising Exact Arithmetic: Representations, Algorithms and Proofs. PhD thesis, Radbout Universiteit Nijmegen, 2004
38. Niqui M. Coinductive field of exact real numbers and general corecursion. Proc. of CMCS'06. ENTCS 164 (2006) 121-139 ELSEVIER
39. Nordstöm B. Terminating general recursion. BIT 28 3 (1988) 605-619
40. C. Paulin-Mohring. Inductive definitions in the system coq - rules and properties. In TLCA, pages 328-345, 1993
41. Paulson L. Mechanizing coinduction and corecursion in higher-order logic. Logic and Computation 2 7 (1997) 175-204
42. Pnueli A. The temporal semantics of concurrent programs. Theoretical Computer Science 31 (1981) 45-60
43. Sijtsma B. On the productivity of recursive list definitions. ACM Transactions on Programing Languages and Systems 11 4 (1989) 633-649
44. The Coq Development Team. The coq proof assistant reference manual. http://coq.inria.fr