A universe of strictly positive families

International Journal of Foundations of Computer Science

Volumn 20, Issue 1, 2009, Pages 83-107

  Morris, Peter ^a   Altenkirch, Thorsten ^a   Ghani, Neil ^a  

^a Nottingham University Jubilee Campus   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 65249132259     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054109006462     Document Type: Article

References (28)

1. Michael Abbott. Thorsten Altenkirch, and Neil Ghani, Containers - constructing strictly positive types. Theoretical Computer Science, 342:3-27, September 2005. Applied Semantics: Selected Topics.
2. Michael Abbott, Thorsten Altenkirch, Neil Ghani, and Conor McBride. ∂ for data. Fundamentae Informatica, 65(1,2):1-28, March 2005. Special Issue on Typed Lambda Calculi and Applications 2003.
3. Thorsten Altenkirch, Neil Ghani, Peter Hancock, Conor McBride. and Peter Morris. Indexed containers. Manuscript, available online, April 2007.
4. Thorsten Altenkirch and Conor McBride. Generic programming within dependently typed programming. In Generic Programming, 2003. Proceedings of the IFIP TC2 Working Conference on Generic Programming, Schloss Dagstuhl, July 2002.
5. Thorsten Altenkirch, Conor Mcbride, and Peter Morris. Generic programming with dependent types. In Roland Backhouse, Jeremy Gibbons, Ralf Hinze, and Johan Jeuring, editors, Spring School on Datatype-Generic Programming, volume 4719 of LNCS. Springer-Verlag, 2007.
6. Thorsten Altenkirch, Conor McBride, and Wouter Swierstra. Observational equality, now! In PLPV '07: Proceedings of the 2007 workshop on Programming languages meets program verification, pages 57-68, New York. NY, USA. 2007. ACM.
7. Marcin Benke. Towards generic programming in type theory. Presentation at Annual ESPRIT BRA TYPES Meeting, Berg en Dal., available from http://www.cs. Chalmers. se/∼marcin/Papers/Notes/nijmegen.ps.gz, April 2002.
8. Marcin Benke, Peter Dybjer, and Patrik Jansson. Universes for generic programs and proofs in dependent type theory. Nordic Journal of Computing, 10:265-269, 2003.
9. D. Clarke. R. Hinze. J. Jeuring. A. Löh, and J. de Wit. The Generic Haskell user's guide. Technical report. Technical Report UU-CS-2001-26, Utrecht University. 2001.
10. Peter Dybjer and Anton Setzer. A finite axiomatization of inductive-recursive definitions. Typed Lambda Calculi and Applications, 1581:129-146, 1999.
11. Peter Dybjer and Anton Setzer. Indexed induction-recursion. In Reinhard Kahle, Peter Schroeder-Heister, and Robert F. Stärk, editors, Proof Theory in Computer-Science, volume 2183 of Lecture Notes in Computer Science, pages 93-113. Springer, 2001.
12. Ralf Hinze. Generic programs and proofs. Habilitation Thesis, University of Bonn, Germany, 2000.
13. Ralf Hinze and Andres Löh. "Scrap Your Boilerplate" Revolutions. In Tarmo Uustalu, editor. Mathematics of Program. Construction, 2006, volume 4014 of LNCS, pages 180-208. Springer-Verlag, 2006.
14. Ralf Hinze, Andres Löh. and Bruno Oliveira. Scrap Your Boilerplate Reloaded. Proceedings of the Eighth International Symposium on Functional and Logic Programming (FLOPS 2006), pages 24-26, 2006.
15. Ralf Hinze and Simon Peyton-Jones. Derivable Type Classes. Electronic Notes in Theoretical Computer Science, 41(1), 2001.
16. P. Jansson and J. Jeuring. PolyP-a polytypic programming language extension. Principals of Programming Languages (POPL), 97:470-482, 1997.
17. Patrik Jansson. Functional Polytypic Programming. PhD thesis, Chalmers University of Technology, Göteborg, Sweden, May 2000.
18. Andres Löh. Exploring Generic Haskell. PhD thesis, Utrecht University, Netherlands, September 2004.
19. Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis-Napoli, 1984.
20. Conor McBride. Epigram: Practical programming with dependent types. In Varmo Vene and Tarmo Uustalu. editors, Advanced Functional Programming 2004, Lecture Notes in Computer Science. Springer-Verlag, 2005+. Revised lecture notes from the International Summer School in Tartu, Estonia.
21. Conor McBride and James McKinna. The view from the left. Journal of Functional Programming, 14(1), 2004.
22. Peter Morris. Constructing Universes for Generic Programming. PhD thesis, University of Nottingham, 2000.
23. Peter Morris, Thorsten Altenkirch, and Neil Ghani. Constructing strictly positive families. In The Australasian Theory Symposium (CATS2007), January 2007.
24. Peter Morris, Thorsten Altenkirch, and Conor McBride. Exploring the regular-tree types. In Jean-Christophe Filliatre, Christine Paulin-Mohring, and Benjamin Werner, editors, Types for Proofs and Programs (TYPES 2004), Lecture Notes in Computer Science, 2006.
25. Ulf Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology, 2007.
26. Simon Peyton-Jones, Dimitrios Vytiniotis, Stephanie Weirich. and Geoffrey Washburn. Simple unification-based type inference for GADTs. In The 11th ACM SIG-PLAN International Conference on Functional Programming (ICFP 2006), 2006.
27. Bengt Nordström, Kent Petersson, and Jan Smith. Programming in Martin-Löf's Type Theory: an introduction. Oxford University Press, 1990.
28. Stephanie Weirich. RepLib: A library for derivable type classes. In Andres Löh, editor, Proceedings of the ACM Haskell Workshop, 2006, 2006.