Indexed containers

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 277-285

  Altenkirch, Thorsten ^a   Morris, Peter ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Functional programming; Type theory

Indexed keywords

DATA TYPE; FIXED NUMBERS; GENERIC PROGRAMMING; INDUCTIVE FAMILIES; OTHER APPLICATIONS; POLYMORPHIC FUNCTIONS; TYPE THEORY;

COMPUTER SCIENCE; CONTAINERS;

FUNCTIONAL PROGRAMMING;

EID: 70350594182     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2009.33     Document Type: Conference Paper

References (26)

1. The Coq Development Team, The Coq Proof Assistant Reference Manual - Version 8.1, 2008. [Online]. Available: http://coq.inria.fr
2. D. Turner, "Elementary strong functional programming," First International Symposium on Functional Programming Languages in Education, vol.1022, pp. 1-13, 1985.
3. C. McBride and J. McKinna, "Epigram," 2008, http://www.e-pig.org/.
4. R. Bird and O. de Moor, "Algebra of programming," Deductive Program Design, 1996.
5. The Agda Team, "The agda wiki," 2009, http://wiki.portal. chalmers.se/agda/agda.php.
6. M. Sozeau, "Subset Coercions in Coq," TYPES 2006, LNCS, vol.4502, p. 237, 2007.
7. J. Cheney and R. Hinze, "First-Class Phantom Types," The Fun of Programming, 2003.
8. T. Altenkirch and B. Reus, "Monadic presentations of lambda terms using generalized inductive types," in Computer Science Logic, 1999.
9. T. Altenkirch and J. Chapman, "Big-Step Normalisation," Accepted for publication in JFP, 2008.
10. G. Huet, "The Zipper," Journal of Functional Programming, vol.7, no.5, pp. 549-554, 1997.
11. C. McBride, "The Derivative of a Regular Type is its Type of One-Hole Contexts," 2001, Available online.
12. M. Abbott, T. Altenkirch, and N. Ghani, "Containers - Constructing Strictly Positive Types," Theoretical Computer Science, vol.342, pp. 3-27, September 2005, Applied Semantics: Selected Topics.
13. -, "Categories of containers," in Proceedings of Foundations of Software Science and Computation Structures, 2003.
14. N. Gambino and M. Hyland, "Wellfounded trees and dependent polynomial functors," in Types for Proofs and Programs (TYPES 2003), ser. Lecture Notes in Computer Science, S. Berardi, M. Coppo, and F. Damiani, Eds., 2004.
15. P. Morris, T. Altenkirch, and N. Ghani, "Constructing strictly positive families," in The Australasian Theory Symposium (CATS2007), January 2007.
16. -, "A universe of strictly positive families," Theory of Computation, 2007.
17. T. Altenkirch and P. Morris, "Indexed Containers - Agda formalisation," 2009, http://www.cs.nott.ac.uk/-pwm/ICont.lagda.
18. J.-Y. Girard, "Normal functors, power series and lambdacalculus," Annals of Pure and Applied Logic, vol.37, no.2, pp. 129-177, 1988.
19. A. Joyal, "Foncteurs analytiques et espèces de structures," in Combinatoire énumerative, ser. Lecture Notes in Mathematics, G. Labelle and P. Leroux, Eds., no.1234. Springer- Verlag, 1987, pp. 126-159.
20. M. Fiore, N. Gambino, M. Hyland, and G. Winskel, "The cartesian closed bicategory of generalised species of structures," Journal of the London Mathematical Society, vol.77, no.1, p. 203, 2008.
21. K. Petersson and D. Synek, "A set constructor for inductive sets in Martin-Löf's type theory," in Proceedings of the 1989 Conference on Category Theory and Computer Science, Manchester, UK, ser. LNCS, vol.389. Springer Verlag, 1989.
22. P. Hancock and P. Hyvernat, "Programming interfaces and basic topology," Annals of Pure and Applied Logic, 2006.
23. P. Martin-Löf, Intuitionistic Type Theory. Bibliopolis, 1984.
24. T. Altenkirch, C. McBride, and W. Swierstra, "Observational equality, now!" in Programming Languages meet Program Verification (PLPV2007). New York, NY, USA: ACM, 2007, pp. 57-68.
25. P. Dybjer and A. Setzer, "A finite axiomatization of inductiverecursive definitions," Typed Lambda Calculi and Applications, vol.1581, pp. 129-146, 1999.
26. -, "Indexed induction-recursion," Journal of Logic and Algebraic Programming, vol.66, no.1, pp. 1-49, 2006.