Functors for proofs and programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2986, Issue , 2004, Pages 370-384

  Filliâtre, Jean Christophe ^a   Letouzey, Pierre ^a  

^a Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; THEOREM PROVING;

COQ PROOF ASSISTANT; FINITE SET; FUNCTORS; LOGICAL FRAMEWORKS; MODULE SYSTEMS; PARAMETERIZED; STANDARD LIBRARIES; VERIFICATION RESULTS;

FORMAL VERIFICATION;

EID: 35048849013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24725-8_26     Document Type: Article

References (16)

1. The Coq Proof Assistant, http://coq.inria.fr/.
2. The Objective Caml language, http://caml.inria.fr/.
3. Stephen Adams. Functional pearls: Efficient sets - a balancing act. Journal of Functional Programming, 3(4):553-561, October 1993. Expanded version available as Technical Report CSTR 92-10, University of Southampton.
4. G. M. Adel'son-Vel'skn and E. M. Landis. An algorithm for the organization of information. Soviet Mathematics-Doklady, 3(5):1259-1263, September 1962.
5. Jacek Chrza̧szcz. Implementing modules in the system Coq. In 16th International Conference on Theorem Proving in Higher Order Logics, University of Rome III, September 2003.
6. Jacek Chrza̧szcz. Modules in Type Theory with generative definitions. PhD thesis, Warsaw University and Université Paris-Sud, 2003. To be defended.
7. Judicaël Courant. A Module Calculus for Pure Type Systems. In Typed Lambda Calculi and Applications 97, Lecture Notes in Computer Science, pages 112 - 128. Springer-Verlag, 1997.
8. Leo J. Guibas and Robert Sedgewick. A dichromatic framework for balanced trees. In 19th Annual Symposium on Foundations of Computer Science, pages 8-21, Ann Arbor, Michigan, 16-18 October 1978. IEEE.
9. Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Conference record of POPL '94: 21st ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 123-137, Portland, OR, January 1994.
10. Ralf Hinze. Constructing red-black trees. In editor Chris Okasaki, editor, Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages, WAAAPL'99, pages 89-99, Paris, France, September 1999. Also technical report of Columbia University, CUCS-023-99.
11. Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269-303, 2000.
12. Pierre Letouzey. A New Extraction for Coq. In Herman Geuvers and Freek Wiedijk, editors, Types for Proofs and Programs, Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, volume 2646 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
13. Pierre Letouzey. Programmation fonctionnelle certifiée en Coq. PhD thesis, Université Paris Sud, 2003. To be defended.
14. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
15. Philip Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.
16. Hongwei Xi. Dependently Typed Data Structures. In Proceedings of Workshop of Algorithmic Aspects of Advanced Programming Languages (WAAAPL '99), pages 17-32, Paris, September 1999.