Polytypic properties and proofs in Coq

Proceedings of the 2009 ACM SIGPLAN Workshop on Generic Programming, WGP'09, Co-located with the International Conference on Functional Programming, ICFP 2009

Volumn , Issue , 2009, Pages 1-12

  Verbruggen, Wendy ^a   DeVries, Edsko ^a   Hughes, Arthur ^a  

^a TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

Languages; Theory; Verification

Indexed keywords

HASKELL; LANGUAGES; PROOF ASSISTANT;

FUNCTIONAL PROGRAMMING; LINGUISTICS;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 70450176700     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1596614.1596616     Document Type: Conference Paper

References (30)

1. Andreas Abel. Type-based termination of generic programs. Science of Computer Programming, 74(8):550-567, 2009. Special Issue on Mathematics of Program Construction (MPC'06).
2. Artem Alimarine. Generic Functional Programming: Conceptual Design, Implementation and Applications. PhD thesis, Radboud Universiteit Nijmegen, The Netherlands, 2005.
3. Thorsten Altenkirch and Conor McBride. Generic programming within dependently typed programming. In Proceedings of the IFIP TC2/WG2.1 Working Conference on Generic Programming, pages 1-20. Kluwer, B.V., 2003.
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. Coq'Art: Interactive Theorem Proving and Program Development. Springer-Verlag, 2004.
6. Venanzio Capretta. General recursion via coinductive types. Logical Methods in Computer Science, 1(2):1-18, 2005.
7. N. G. de Bruijn. A lambda calculus notation with nameless dummies. Indagationes Mathematicae, 34:381-392, 1972.
8. Edsko de Vries. Coq-club archives: Question about guardedness in cofixpoint, April 2009. http://logical.saclay.inria.fr/-coq-puma/messages/ aa72f538ea88b2e7.
9. Jeremy Gibbons. Datatype-generic programming. In School on Datatype- Generic Programming, volume 4719 of Lecture Notes in Computer Science, pages 1-71. Springer-Verlag, 2006.
10. Ralf Hinze. Polytypic values possess polykinded types. In MPC'00: 5th International Conference on Mathematics of Program Construction, 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 Proceedings of the 2000 ACM SIGPLAN 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 School on Datatype-Generic Programming, volume 4719 of Lecture Notes in Computer Science, pages 150-208. Springer-Verlag, 2006.
15. Ralf Hinze and Andres Löh. Generic programming in 3D. Science of Computer Programming, 2007. To appear.
16. Ralf Hinze, Johan Jeuring, and Andres Löh. Type-indexed data types. Sci. Comput. Program., 51(1-2):117-151, 2004.
17. Ralf Hinze, Johan Jeuring, and Andres Löh. Comparing approaches to generic programming in Haskell. In School on Datatype-Generic Programming, volume 4719 of Lecture Notes in Computer Science, pages 72-149. Springer-Verlag, 2006.
18. th ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages, pages 470-482. ACM Press, 1997.
19. Ralf Lämmel and Simon Peyton Jones. Scrap your boilerplate: A practical design pattern for generic programming. In TLDI'03: ACM SIGPLAN International Workshop on Types in Language Design and Implementation, volume 38, pages 26-37. ACM Press, 2003.
20. th International Symposium on Practical Aspects of Declarative Languages, volume 2257 of Lecture Notes in Computer Science, pages 137-154. Springer-Verlag, 2002.
21. Andres Löh. Exploring Generic Haskell. PhD thesis, Instituut voor Programmatuurkunde en Algoritmiek, Utrecht, The Netherlands, 2004.
22. Conor McBride. Elimination with a motive. In TYPES'00: Selected papers from the International Workshop on Types for Proofs and Programs, pages 197-216. Springer-Verlag, 2002.
23. Peter Morris, Thorsten Altenkirch, and Conor McBride. Exploring the regular tree types. In TYPES'04: Types for Proofs and Programs, volume 3839 of Lecture Notes in Computer Science, pages 252-267. Springer- Verlag, 2006.
24. Peter Morris, Thorsten Altenkirch, and Neil Ghani. Constructing strictly positive families. In CATS'07: Theory of Computing, volume 65 of Conferences in Research and Practice in Information Technology (CRPIT), 2007.
25. Ulf Norell. Functional generic programming and type theory. Master's thesis, Computing Science, Chalmers University of Technology, 2002.
26. 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. Springer-Verlag, 1999.
27. Alexey Rodriguez, Johan Jeuring, Patrik Jansson, Alex Gerdes, Oleg Kiselyov, and Bruno C. d. S. Oliveira. Comparing libraries for generic programming in Haskell. In Haskell'08: Proceedings of the First ACM SIGPLAN Symposium on Haskell, pages 111-122. ACM Press, 2008.
28. Alexey Rodriguez, Stefan Holdermans, Andres Löh, and Johan Jeuring. Generic programming with fixed points formutually recursive datatypes. In ICFP'09: Proceeding of the 14th ACM SIGPLAN international conference on Functional programming. ACM Press, 2009. To appear.
29. Tim Sheard. Generic programming in mega. In Spring School on Datatype-Generic Programming, volume 4719 of Lecture Notes in Computer Science. Springer-Verlag, 2007.
30. Wendy Verbruggen, Edsko de Vries, and Arthur Hughes. Polytypic programming in Coq. In WGP'08: Proceedings of the ACM SIGPLAN Workshop on Generic Programming, pages 49-60. ACM Press, 2008.