Programiing finger trees in CoQ

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2007, Pages 13-24

  Sozeau, Matthieu ^a,b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b INRIA   (France)

Author keywords

Certification; CoQ; Dependent types; Finger trees

Indexed keywords

CERTIFICATION; COQ; DEPENDENT TYPES; FINGER TREES;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; PARAMETERIZATION; PROBLEM SOLVING;

TREES (MATHEMATICS);

EID: 38849098935     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1291151.1291156     Document Type: Conference Paper

References (21)

1. Edwin Brady, Conor McBride, and James McKinna. Inductive families need not store their indices. In Stefano Berardi, Mario Coppo, and Ferruccio Damiani, editors, TYPES, volume 3085 of LNCS, pages 115-129. Springer, 2003.
2. Adam. Chlipala. Position paper: Thoughts on programming with proof assistants. In PLPV'06: Proceedings of the Programming Languages meets Program Verification Workshop, August 2006.
3. Coq. The Coq proof assistant. coq.inria.fr
4. Thierry Coquand. Alfa/agda. In Freek Wiedijk, editor, The Seventeen Provers of the World, volume 3600 of LNCS, pages 50-54. Springer, 2006.
5. Jean-Christophe Filliâtre and Pierre Letouzey. Functors for proofs and programs. In David A. Schmidt, editor, ESOP, volume 2986 of LNCS, pages 370-384. Springer, 2004.
6. Seth Fogarty, Emir Pasalic, Jeremy Siek, and Walid Taha. Concoqtion: indexed types now! In G. Ramalingam and Eelco Visser, editors, PEPM, pages 1.12-121. ACM, 2007.
7. Haskell. The Haskell programming language. haskell.org.
8. Ralf Hinze and Ross Paterson. Finger Trees: A Simple General-purpose Data Structure. J. Funct. Program., 16(2):197-217, 2006.
9. Pierre Letouzey. A new extraction for coq. In Herman Geuvers and Freek Wiedijk, editors, TYPES'02, volume 2646 of LNCS, pages 200-219. Springer, 2002.
10. Conor McBride. Dependency Typed Functional Programs and Their Proofs. PhD thesis, University of Edinburgh, 1999.
11. Conor McBride and James McKinna. The view from the left. J. Funct. Program., 14(1):69-111, 2004.
12. Alexandre Miquel. The implicit calculus of constructions. In TLCA, volume 2044 of LNCS, pages 344-359. Springer, 2001.
13. OCaml. The Ocaml programming language. caml.inria.fr
14. Sam Owre and Natarajan Shankar. The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, SRI International, Menlo Park, CA, August 1997.
15. Catherine Parent. Synthesizing proofs from programs in the Calculus of Inductive Constructions. In Bernhard Möller, editor, MPC, volume 947 of LNCS, pages 351-379. Springer, 1995.
16. Christine Paulin-Mohring. Inductive definitions in the system COQ. In Typed Lambda Calculi and Applications, volume 664 of LNCS, pages 328-345. Springer, 1993.
17. Tim Sheard. Languages of the future. SIGPLAN Notices, 39(12): 119-132,2004.
18. Matthieu Sozeau. Subset coercions in Coq. In TYPES'06, volume 4502 of LNCS, pages 237-252. Springer, 2007.
19. Benjamin Werner. On the strength of proof-irrelevant type theories. 3rd International Joint Conference on Automated Reasoning, 2006.
20. Hongwei Xi. Applied Type System (extended abstract). In post-workshop Proceedings of TYPES 2003, pages 394-408. Springer-Verlag LNCS 3085, 2004.
21. Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), San Antonio, Texas, pages 214-227, January 1999.