Monotone inductive and coinductive constructors of rank 2

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

Volumn 2142, Issue , 2001, Pages 600-614

  Matthes, Ralph ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS);

COINDUCTIVE TYPES; CURRY-HOWARD CORRESPONDENCE; FINAL COALGEBRAS; FUNCTOR CATEGORY; INITIAL ALGEBRAS; LAMBDA CALCULUS; MONOTONICITY; STRONG NORMALIZATION;

COMPUTER CIRCUITS;

EID: 70449401237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44802-0_42     Document Type: Conference Paper

References (15)

1. Thorsten Altenkirch. Representations of first order function types as terminal coalgebras. In Samson Abramsky, editor, Proceedings of TLCA 2001, volume 2044 of Lecture Notes in Computer Science, pages 8-21. Springer Verlag, 2001.
2. Thorsten Altenkirch and Bernhard Reus. Monadic presentations of lambda terms using generalized inductive types. In Jörg Flum and Mario Rodríguez-Artalejo, editors, Computer Science Logic, 13th International Workshop, CSL’99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, volume 1683 of Lecture Notes in Computer Science, pages 453-468. Springer Verlag, 1999.
3. Richard S. Bird and Ross Paterson. De Bruijn notation as a nested datatype. Journal of Functional Programming, 9(1):77-91, 1999.
4. Richard Bird and Ross Paterson. Generalised folds for nested datatypes. Formal Aspects of Computing, 11(2):200-222, 1999.
5. Herman Geuvers. Inductive and coinductive types with iteration and recursion. In Bengt Nordström, Kent Pettersson, and Gordon Plotkin, editors, Proceedings of the 1992 Workshop on Types for Proofs and Programs, Båstad, Sweden, June 1992, pages 193-217, 1992. Only published electronically. Available at ftp://ftp.cs.chalmers.se/pub/cs-reports/baastad.92/proc.dvi.Z.
6. Neil Ghani. βη-equality for coproducts. In Mariangiola Dezani-Ciancaglini and Gordon Plotkin, editors, Proceedings of the Second International Conference on Typed Lambda Calculi and Applications (TLCA’95), Edinburgh, United Kingdom, April 1995, volume 902 of Lecture Notes in Computer Science, pages 171-185. Springer Verlag, 1995.
7. Jean-Yves Girard. Interprétation fonctionnelle et élimination des coupures dans l’arithmétique d’ordre supérieur. Thèse de Doctorat d’État, Univ ersité de Paris VII, 1972.
8. Brian Howard. Fixed Points and Extensionality in Typed Functional Programming Languages. PhD thesis, Stanford University, 1992.
9. Daniel Leivant. Contracting proofs to programs. In Piergiorgio Odifreddi, editor, Logic and Computer Science, volume 31 of APIC Studies in Data Processing, pages 279-327. Academic Press, 1990.
10. Ralph Matthes. Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types. Doktorarbeit (PhD thesis), Univ ersity of Munich, 1998.
11. Nax P. Mendler. Recursive types and type constraints in second-order lambda calculus. In Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, Ithaca, N. Y., pages 30-36. IEEE Computer Society Press, 1987.
12. Chris Okasaki. From fast exponentiation to square matrices: An adventure in types. In Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP’99), Paris, France, September 27-29, 1999, volume 34 of SIGPLAN Notices, pages 28-35. ACM, 1999.
13. Christine Paulin-Mohring. Définitions Inductives en Théorie des Types d’Ordre Supérieur. Habilitation à diriger les recherches, ENS Lyon, 1996.
14. Zdzisław Spławski and Paweł Urzyczyn. Type Fixpoints: Iteration vs. Recursion. In Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP’99), Paris, France, September 27-29, 1999, volume 34 of SIGPLAN Notices, pages 102-113. ACM, 1999.
15. Tarmo Uustalu and Varmo Vene. Least and greatest fixed points in intuitionistic natural deduction. Theoretical Computer Science. To appear.