Fixed points of type constructors and primitive recursion

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

Volumn 3210, Issue , 2004, Pages 190-204

  Abel, Andreas ^a   Matthes, Ralph ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DATATYPES; FIXED POINTS; MODEL CONSTRUCTION; RECURSION SCHEMES; RECURSIONS; STRONG NORMALIZATION; TYPE EQUALITY;

ARTIFICIAL INTELLIGENCE;

EID: 33745882080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_17     Document Type: Article

References (24)

1. [AMU03] A. Abel, R. Matthes, and T. Uustalu. Generalized iteration and coiteration for higher-order nested datatypes. In A. Gordon, ed., Proc. of FoSSaCS 2003, vol. 2620 of LNCS, pp. 54-69. 2003.
2. [AMU04] A. Abel, R. Matthes, and T. Uustalu. Iteration and coiteration schemes for higher-order and nested datatypes. Theoretical Computer Science, 2004. 79 pages, accepted for publication.
3. [AR99] T. Altenkirch and B. Reus. Monadic presentations of lambda terms using generalized inductive types. In Proceedings of CSL '99, vol. 1683 of LNCS, pp. 453-468. 1999.
4. [BB85] C. Böhm and A. Berarducci. Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science, 39:135-154, 1985.
5. [BP99a] R. Bird and R. Paterson. Generalised folds for nested datatypes. Formal Aspects of Computing, 11(2):200-222, 1999.
6. [BP99b] R. S. Bird and R. Paterson. De Bruijn notation as a nested datatype. Journal of Functional Programming, 9(1):77-91, 1999.
7. [CP88] T. Coquand and C. Paulin. Inductively defined types - preliminary version. In P. Martin-Löf and G. Mints, eds., Proceedings of COLOG '88, vol. 417 of LNCS, pp. 50-66. 1988.
8. [DC98] D. Duggan and A. Compagnoni. Subtyping for object type constructors, 1998. Presented at FOOL 6.
9. [GHR93] P. Giannini, F. Honsell, and S. Ronchi Della Rocca. Type inference: some results, some problems. Fundamenta Informaticae, 19(1-2):87 - 125, 1993.
10. [Gog95] H. Goguen. Typed operational semantics. In M. Dezani-Ciancaglini and G. Plotkin, eds., Proc. of TLCA '95, vol. 902 of LNCS, pp. 186-200. 1995.
11. [Hin98] R. Hinze. Numerical representations as higher-order nested datatypes. Tech. Rep. IAI-TR-98-12, Institut für Informatik III, Universität Bonn, 1998.
12. [Hin01] R. Hinze. Manufacturing datatypes. Journal of Functional Programming, 11(5):493-524, 2001.
13. [Mat01] R. Matthes. Monotone inductive and coinductive constructors of rank 2. In L. Fribourg, ed., Proc. of CSL 2001, vol. 2142 of LNCS, pp. 600-614. 2001.
14. [Men87] N. P. Mendier. Recursive types and type constraints in second-order lambda calculus. In Proceedings of LICS '87, pp. 30-36. 1987.
15. [MGB04] C. Martin, J. Gibbons, and I. Bayley. Disciplined, efficient, generalised folds for nested datatypes. Formal Aspects of Computing, 16(1):19-35, 2004.
16. [Oka96] C. Okasaki. Purely Functional Data Structures. Ph.D. thesis, Carnegie Mellon University, 1996.
17. [Oka99] C. Okasaki. Red-black trees in a functional setting. Journal of Functional Programming, 9(4):471-477, 1999.
18. [Ste98] M. Steffen. Polarized Higher-Order Subtyping. Ph.D. thesis, Technische Fakultät, Universität Erlangen, 1998.
19. [SU99] Z. Spłavvski and P. Urzyczyn. Type fixpoints: Iteration vs. recursion. In Proceedings of ICFP'99, pp. 102-113. SIGPLAN Notices, 1999.
20. [Urz96] P. Urzyczyn. Positive recursive type assignment. Fundamenta Informaticae, 28(1-2):197-209, 1996.
21. [UV02] T. Uustalu and V. Vene. The dual of substitution is redecoration. In K. Hammond and S. Curtis, eds., Trends in Functional Programming 3, pp. 99-110. Intellect, Bristol, Portland, OR, 2002.
22. +97] S. van Bakel, L. Liquori, S. Ronchi Della Rocca, and P. Urzyczyn. Comparing cubes of typed and type assignment systems. Annals of Pure and Applied Logic, 86(3):267-303, 1997.
23. [vRS95] F. van Raamsdonk and P. Severi. On normalisation. Tech. Rep. CS-R9545, CWI, 1995.
24. +99] F. van Raamsdonk, P. Severi, M. H. Sørensen, and H. Xi. Perpetual reductions in lambda calculus. Inf. and Comp., 149(2):173-225, 1999.