A unifying approach to recursive and co-recursive definitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2646, Issue , 2003, Pages 148-161

  Di Gianantonio, Pietro ^a   Miculan, Marino ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COQ PROOF ASSISTANT; EXPRESSIVE POWER; FIXED POINTS; LOGICAL FRAMEWORKS; RECURSIVE DEFINITIONS; TYPE THEORY; WELL-FOUNDED ORDERINGS;

THEOREM PROVING;

EID: 24944517159     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39185-1_9     Document Type: Article

References (17)

1. A. Abel. Termination checking with types. Technical Report 0201, Institut für Informatik, Ludwig-Maximilians-Universität München, 2002.
2. A. Balaa and Y. Bertot. Fix-point equations for well-founded recursion in type theory. In Proc. TPHOL 2000, volume 1869 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 2000.
3. H. Barendregt and T. Nipkow, editors. Proceedings of TYPES'93, volume 806 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
4. G. Barthe, M. J. Frade, E. Giménez, L. Pinto, and T. Uustalu. Type-based termination of recursive definitions. Mathematical Structures in Computer Science, 2003. To appear.
5. A. Bove and V. Capretta. Modelling general recursion in type theory. Technical report, Dept. of Computer Science, Chalmers University of Technology, 2002.
6. T. Coquand. Infinite objects in type theory. In Barendregt and Nipkow [3], pages 62-78.
7. J. W. de Bakker and J. I. Zucker. Processes and the denotational semantics of concurrency. Information and Control, 54:70-120, 1982.
8. E. Giménez. Codifying guarded recursion definitions with recursive schemes. In J. Smith, editor, Proc. of TYPES'94, volume 996 of Lecture Notes in Computer Science, pages 39-59, Båstad, Sweden, June 1995. Springer-Verlag.
9. E. Giménez. Structural recursive definitions in type theory. In K. Larsen, S. Skyum, and G. Winskel, editors, Proc. 25th ICALP, volume 1443 of Lecture Notes in Computer Science, pages 397-408. Springer-Verlag, 1998.
10. INRIA. The Coq Proof Assistant, 2002. http://coq.inria.fr/doc/main.html.
11. F. Leclerc and C. Paulin-Mohring. Programming with streams in Coq. A case study: The sieve of Eratosthenes. In Barendregt and Nipkow [3], pages 191-212.
12. J. Matthews. Recursive function definition over coinductive types. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, editors, Proc. TPHOL'99, volume 1690 of Lecture Notes in Computer Science, pages 73-90. Springer-Verlag, 1999.
13. K. Meinke and J. Tucker. Universal algebra. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic for Computer Science, volume I: Mathematical Structures, pages 189-411. Oxford University Press, 1992.
14. N. P. Mendler. Recursive types and type constraints in second-order lambda calculus. In Proc. LICS'87, pages 22-25. IEEE, 1987.
15. B. Nordström. Terminating general recursion. BIT, 28:605-619, 1988.
16. L. C. Paulson. A fixedpoint approach to (co)inductive and (co)datatype definitions. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language, and Interaction: Essays in Honour of Robin Milner, pages 187-211. MIT Press, 2000.
17. ∼pollack/export/thesis.dvi.gz.