Containers: Constructing strictly positive types

Theoretical Computer Science

Volumn 342, Issue 1, 2005, Pages 3-27

  Abbott, Michael ^a   Altenkirch, Thorsten ^b   Ghani, Neil ^c  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^c UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Category theory; Coinduction; Container functors; Final coalgebras; Induction; Initial algebras; Type theory; W Types

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; CONTAINERS; FUNCTIONS; SET THEORY;

CATEGORY THEORY; COINDUCTION; CONTAINERS FUNCTIONS; FINAL COALGEBRAS; INDUCTION; INITIAL ALGEBRAS; TYPE THEORY; W-TYPES;

DATA STRUCTURES;

EID: 23844441246     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.002     Document Type: Article

References (38)

1. M. Abbott, Categories of containers, Ph.D. Thesis, University of Leicester, 2003.
2. M. Abbott, T. Altenkirch, N. Ghani, Categories of containers, in: Proc. Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, Vol. 2620, Springer, Berlin, 2003, pp. 23-38.
3. M. Abbott, T. Altenkirch, N. Ghani, C. McBride, Derivatives of containers, in: Sixth International Conference on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, Vol. 2701, Springer, Berlin, 2003, pp. 16-30.
4. M. Abbott, T. Altenkirch, N. Ghani, Representing nested inductive types using W-types, in: International Colloquium on Automata, Languages and Programming, ICALP, 2004, pp. 59-71.
5. M. Abbott, T. Altenkirch, N. Ghani, C. McBride, Constructing polymorphic programs with quotient types, in: Seventh International Conference on Mathematics of Program Construction (MPC 2004), Lecture Notes in Computer Science, Vol. 3125, February 2004, pp. 2-15.
6. M. Abbott, T. Altenkirch, N. Ghani, C. McBride, ∂ for data, February 2004, submitted for publication.
7. A. Abel, T. Altenkirch, A predicative strong normalisation proof for a λ -calculus with interleaving inductive types, in: Types for Proof and Programs, TYPES '99, Lecture Notes in Computer Science, Vol. 1956, Springer, Berlin, 2000, pp. 1-18.
8. P. Aczel On relating type theories and set theories Lecture Notes in Comput. Sci. 1657 1999 1 18
9. T. Altenkirch, Constructions, Inductive types and strong normalization, Ph.D. Thesis, University of Edinburgh, November 1993.
10. T. Altenkirch, Extensional equality in intensional type theory, in: 14th Symposium on Logic in Computer Science, 1999, pp. 412-420.
11. T. Altenkirch, B. Reus, Monadic presentations of lambda terms using generalized inductive types, in: J. Flum, M. Rodríguez-Artalejo (Eds.), CSL'99, Lecture Notes in Computer Science, Vol. 1683, Springer, Berlin, 1999, pp. 453-468.
12. J. Bénabou Fibrations petites et localement petites C.R. Acad. Sci. Paris 281 1975 A831 A834
13. J. Bénabou Fibred categories and the foundations of naive category theory J. Symbol. Logic 50 1 1985 10 37
14. R. Bird, and R. Paterson Generalised folds for nested datatypes Formal Aspects Comput. 11 3 1999 200 222
15. F. Borceux, Handbook of Categorical Algebra 2, Encyclopedia of Mathematics, Vol. 51, Cambridge University Press, Cambridge, 1994.
16. R.L. Crole Categories for Types 1993 Cambridge University Press Cambridge
17. P. Dybjer Representing inductively defined sets by wellorderings in Martin-Löf's type theory Theoret. Comput. Sci. 176 1997 329 335
18. N. Gambino, M. Hyland, Wellfounded trees and dependent polynomial functors, in: S. Berardi, M. Coppo, F. Damiani (Eds.), Types for Proofs and Programs (TYPES 2003), Lecture Notes in Computer Science, Springer, Berlin, 2004, pp. 210-225.
19. R. Hasegawa Two applications of analytic functors Theoret. Comput. Sci. 272 1-2 2002 112 175
20. M. Hofmann, On the interpretation of type theory in locally cartesian closed categories, in: Computer Science Logic, CSL94, 1994, pp. 427-441
21. M. Hofmann Extensional Constructs in Intensional Type Theory 1997 Springer Berlin
22. M. Hofmann, Syntax and semantics of dependent types, in: A.M. Pitts, P. Dybjer (Eds.), Semantics and Logics of Computation, Vol. 14, Cambridge University Press, Cambridge, 1997, pp. 79-130.
23. P. Hoogendijk, and O. de Moor Container types categorically J. Function. Program. 10 2 2000 191 225
24. B. Jacobs Categorical logic and type theory Studies in Logic and the Foundations of Mathematics Vol. 141 1999 Elsevier Amsterdam
25. P.T. Johnstone Topos Theory 1977 Academic Press New York
26. A. Joyal, Foncteurs analytiques et espèces de structures, in: Combinatoire Énumérative, Lecture Notes in Mathematics, Vol. 1234, Springer, Berlin, 1986, pp. 126-159.
27. P. Martin-Löf An intuitionistic theory of types: predicative part H.E. Rose J.C. Shepherdson Proceedings of the Logic Colloquium 1974 North-Holland Amsterdam 73 118
28. P. Martin-Löf Intuitionistic Type Theory 1984 Bibliopolis Napoli
29. C. McBride Epigram: practical programming with dependent types 2004 Lecture Notes of the Advanced Functional Programming Summerschool in Tartu Estonia
30. C. McBride, and J. McKinna The view from the left J. Function. Program. 14 1 2004 16 111
31. I. Moerdijk, and E. Palmgren Wellfounded trees in categories Ann. Pure Appl. Logic 104 2000 189 218
32. B. Nordström, K. Petersson, J.M. Smith, Programming in Martin-Löf's Type Theory, International Series of Monographs on Computer Science, Vol. 7, Oxford University Press, Oxford, 1990.
33. R. Paré, D. Schumacher, Abstract families and the adjoint functor theorems, in: P.T. Johnstone, R. Paré (Eds.), Indexed Categories and Their Applications, Lecture Notes in Mathematics, Vol. 661, Springer, Berlin, 1978, pp. 1-125.
34. A. Poigné, Basic category theory, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Handbook of Logic in Computer Science, Vol. 1, Oxford University Press, Oxford, 1992. pp. 413-640.
35. R.A.G. Seely Locally cartesian closed categories and type theory Math. Proc. Camb. Phil. Soc. 95 1984 33 48
36. T. Streicher Semantics of Type Theory 1991 Progress in Theoretical Computer Science Birkhäuser
37. D. Turner, Elementary strong functional programming, in: R. Plasmeijer, P. Hartel (Eds.), First International Symposium on Functional Programming Languages in Education, Lecture Notes in Computer Science, Vol. 1022, Springer, Berlin, 1996, pp. 1-13.
38. B. van den Berg, F. de Marchi, Non-well-founded trees in categories, 2004, arXiv math.CT/0409158.