Polytypic programming in Coq

WGP'08 - Proceedings of the 2008 ACM SIGPLAN Workshop on Generic Programming

Volumn , Issue , 2008, Pages 49-60

  Verbruggen, Wendy ^a   De Vries, Edsko ^a   Hughes, Arthur ^a  

^a TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

Coq; Formalization; Generic programming; Kind indexed types; Polytypic programming; Theorem proving

Indexed keywords

COQ; FORMALIZATION; GENERIC PROGRAMMING; KIND-INDEXED TYPES; POLYTYPIC PROGRAMMING;

PROBLEM SOLVING;

THEOREM PROVING;

EID: 64849100385     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1411318.1411326     Document Type: Conference Paper

References (32)

1. Andreas Abel. Type-Based Termination of Generic Programs. Science of Computer Programming, 2007. MPC'06 special issue. Submitted.
2. Artem Alimarine. Generic Functional Programming: Conceptual Design, Implementation and Applications. PhD thesis, Radbound Universiteit Nijmegen, 2005.
3. Thorsten Altenkirch and Conor McBride. Generic programming within dependency typed programming. In Proceedings of the IFIP TC2/VG2.1 Working Conference on Generic Programming, pages 1-20, Deventer. The Netherlands, 2003. Kluwer, B.V. ISBN 1-4020-7374-7.
4. Marcin Benke, Peter Dybjer, and Patrik Jansson. Universes for Generic Programs and Proofs in Dependent Type Theory. Nordic Journal of Computing, 10(4):265-289, 2003.
5. Yves Bertot and Pierre Castéran. Interactive Theorem Proving and Program Development. Springer-Verlag, 2004.
6. Coq Development Team. Coq frequently asked questions (v8.1), 2008. http://coq.inria.fr/doc-eng.html.
7. Thierry Coquand and Gérard Huet. The Calculus of Constructions. Information and Computation, 76(2-3):95-120, 1988. ISSN 0890-5401. doi: http://dx.doi.org/10.1016/0890-5401(88)90005-3.
8. N. G. de Bruijn. A lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae, 34:381-392, 1972.
9. Robert Harper and Robert Pollack. Type Checking with Universes. Theoretical Computer Science, 89:107-136, 1991.
10. Ralf Hinze. Polytypic Values Possess Polykinded Types. In Roland Backhouse and José Nuno Oliveira, editors. 5th International Conference on Mathematics of Program Construction (MPC 2000), volume 1837 of Lecture Notes in Computer Science, pages 2-27. Springer-Verlag, 2000a.
11. Ralf Hinze. Generic Programs and Proofs. Habilitationsschrift, Universität Bonn, Germany, 2000b.
12. Ralf Hinze. Generics for the Masses. Journal of Functional Programming, 16:451-482, 2006.
13. Ralf Hinze and Simon Peyton Jones. Derivable Type Classes. In Graham Hutton, editor, Proceedings of the 2000 ACM SIG-PLAN Haskell Workshop. Electronic Notes in Theoretical Computer Science, Volume 41.1. Elsevier Science, 2000.
14. Ralf Hinze and Andres Löh. Generic Programming. Now! In Roland Backhouse, Jeremy Gibbons, Ralf Hinze, and Johan Jeuring, editors, School on Datatype-Generic Programming, 2006, volume 4719 of Lecture Notes in Computer Science, pages 150-208. Springer-Verlag, 2006a.
15. Ralf Hinze and Andres Löh. "Scrap Your Boilerplate" Revolutions. In Tarmo Uustalu, editor, Mathematics of Program Construction: 8th International Conference (MPC 2006), volume 4014 of Lecture Notes in Computer Science, pages 180-208. Springer-Verlag, 2006b.
16. Ralf Hinze, Johan Jeuring, and Andres Löh. Comparing Approaches to Generic Programming in Haskell. In Roland Backhouse, Jeremy Gibbons, Ralf Hinze, and Johan Jeuring, editors. School on Datatype-Generic Programming, 2006, volume 4719 of Lecture Notes in Computer Science, pages 72-149. Springer-Verlag, 2006a.
17. Ralf Hinze, Andres Löh, and Bruno Oliveira. "Scrap Your Boilerplate" Reloaded. In Proceedings of FLOPS 2006, 2006b.
18. Antonius J. C. Hurkens. A Simplification of Girard's Paradox. In TLCA '95: Proceedings of the Second International Conference on Typed Lambda Calculi and Applications, pages 266-278. Springer-Verlag, 1995.
19. P. Jansson and J. Jeuring. PolyP - A Polytypic Programming Language Extension. In Conference Record 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'97). pages 470-482. ACM-Press, 1997.
20. Ralf Lämmel and Simon Peyton Jones. Scrap Your Boilerplate: A Practical Design Pattern for Generic Programming. In ACM SIGPLAN International Workshop on Types in Language Design and Implementation (TLDI'03), volume 38, pages 26-37. ACM Press, 2003.
21. Ralf Lämmel and Simon Peyton Jones. Scrap Your Boilerplate with Class: Extensible Generic Functions. In Proceedings of the tenth ACM SIGPLAN International Conference on Functional Programming (ICFP'05), pages 204-215. ACM Press, 2005.
22. Andres Löh. Exploring Generic Haskell. PhD thesis. Instituut voor Programmatuurkunde en Algoritmiek, 2004.
23. Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.
24. Peter Morris, Thorsten Altenkirch, and Conor McBride. Exploring the Regular Tree Types. In Jean-Christophe Filliâtre, Christine Paulin-Mohring, and Benjamin Werner, editors, Types for Proofs and Programs (TYPES 2004), volume 3839 of Lecture Notes in Computer Science, pages 252-267. Springer-Verlag, 2006.
25. Peter Morris, Thorsten Altenkirch, and Neil Ghani. Constructing Strictly Positive Families. In Joachim Gudmundsson and Barry Jay, editors. Theory of Computing (CATS 2007). Conferences in Research and Practice in Information Technology (CRPIT), Volume 65, 2007.
26. Ulf Norell. Functional generic programming and type theory. Master's thesis, Computing Science, Chalmers University of Technology, 2002.
27. Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Geoffrey Washburn. Simple unification-based type inference for GADTs. In Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, pages 50-61, 2006.
28. Holger Pfeifer and Harald Rueß. Polytypic Abstraction in Type Theory. In Roland Backhouse and Tim Sheard, editors, Workshop on Generic Programming (WGP'98). June 1998.
29. Holger Pfeifer and Harald Rueß. Polytypic proof construction. In TPHOLs '99: Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics, pages 55-72, London, UK, 1999. Springer-Verlag. ISBN 3-540-66463-7.
30. Tim Sheard. Generic Programming in Ωmega. In Roland Backhouse, Jeremy Gibbons. Ralf Hinze, and Johan Jeuring, editors, Spring School on Datatype-Generic Programming, volume 4719 of Lecture Notes in Computer Science. Springer-Verlag, 2007.
31. M. H. Sørensen and P. Urzyczyn. Lectures on the Curry-Howard Isomorphism. Elsevier, 2006.
32. Wendy Verbruggen. Coq sources for this paper, 2008. https://www.cs.tcd. ia/~varbruwj/pub/.