Categories of containers

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

Volumn 2620, Issue , 2003, Pages 23-38

  Abbott, Michael ^a   Altenkirch, Thorsten ^b   Ghani, Neu ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CLOSURE PROPERTY; DATATYPES; FINAL COALGEBRAS; FORMALISATION; INITIAL ALGEBRAS; POLYMORPHIC FUNCTIONS;

CONTAINERS;

EID: 21144431815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_2     Document Type: Article

References (17)

1. ∼{}txa/. Submitted for publication, 2003.
2. A. Abel and T. Altenkirch. A predicative strong normalisation proof for a λ-calculus with interleaving inductive types. In Types for Proof and Programs, TYPES '99, volume 1956 of Lecture Notes in Computer Science, 2000.
3. J. Adámek and V. Koubek. Least fixed point of a functor. Journal of Computer and System Sciences, 19:163-178, 1979.
4. J. Adámek and J. Rosicky. Locally Presentable and Accessible Categories. Number 189 in London Mathematical Society Lecture Note Series. Cambridge University Press, 1994.
5. T. Altenkirch and C. McBride. Generic programming within dependently typed programming. In IFIP Working Conference on Generic Programming, 2002.
6. F. Borceux. Handbook of Categorical Algebra 2. Cambridge University Press, 1994.
7. A. Carboni and P. Johnstone. Connected limits, familial representability and Artin glueing. Math. Struct. in Comp. Science, 5:441-459, 1995.
8. R. Hasegawa. Two applications of analytic functors. Theoretical Computer Science, 272(1-2): 112-175, 2002.
9. M. Hofmann. Syntax and semantics of dependent types. In A. M. Pitts and P. Dybjer, editors, Semantics and Logics of Computation, volume 14, pages 79-130. Cambridge University Press, Cambridge, 1997.
10. P. Hoogendijk and O. de Moor. Container types categorically. Journal of Functional Programming, 10(2): 191-225, 2000.
11. B. Jacobs. Categorical Logic and Type Theory. Number 141 in Studies in Logic and the Foundations of Mathematics. Elsevier, 1999.
12. C. B. Jay. A semantics for shape. Science of Computer Programming, 25:251-283, 1995.
13. C. B. Jay and J. R. B. Cockett. Shapely types and shape polymorphism. In ESOP '94: 5th European Symposium on Programming, Lecture Notes in Computer Science, pages 302-316. Springer-Verlag, 1994.
14. P. T. Johnstone. Topos Theory. Academic Press, 1977.
15. C. McBride. The derivative of a regular type is its_type of one-hole contexts. URL http://www.dur.ac.uk/c.t.mcbride/.2001.
16. E. Moggi, G. Bellè, and C. B. Jay. Monads, shapely functors and traversals. Electronic Notes in Theoretical Computer Science, 29, 1999.
17. P. Taylor. Practical Foundations of Mathematics. Cambridge University Press, 1999.