A term calculus for (co-)recursive definitions on streamlike data structures

Annals of Pure and Applied Logic

Volumn 136, Issue 1-2, 2005, Pages 75-90

  Buchholz, Wilfried ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Co recursion; Continuous cut elimination

Indexed keywords

EID: 23944460284     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2005.05.006     Document Type: Article

References (8)

1. T. Coquand Infinite objects in type theory H. Barendregt T. Nipkow Types for Proofs and Programs LNCS vol. 806 1994 62-78
2. R. Di Gianantonio, M. Miculan, A Unifying Approach to Recursive and Co-recursive Definitions, Draft, 2003
3. E. Gimenez Codifying guarded definitions with recursive schemes Types for Proofs and Programs LNCS vol. 996 1994 Springer 39-59
4. J. Matthews Recursive function definition over coinductive types in: Y. Bertot G. Dowek A. Hirshowitz C. Paulin L. Th'ery (Eds.), Proc. TPHOL'99 LNCS vol. 1690 1999 Springer-Verlag 73-90
5. G. Mints Finite investigations of transfinite derivations J. Sov. Mat. 10 1978
6. D. Pattinson, Recursion on streams via Banach's theorem, Unpublished notes, 2003
7. V. Stoltenberg-Hansen I. Lindström E. Griffor Mathematical Theory of Domains Cambridge Tracts in Theoretical Computer Science vol. 22 1994 Cambridge University Press
8. A. Telford, D. Turner, Ensuring the productivity of infinite structures, The Computing Laboratory, University of Kent at Canterbury, Technical Report 14-97, 1998