Functors for Proofs and Programs (2003)
by
Jean-Christophe Filliatre
,
Pierre Letouzey
| Citations: | 13 - 2 self |
BibTeX
@MISC{Filliatre03functorsfor,
author = {Jean-Christophe Filliatre and Pierre Letouzey},
title = {Functors for Proofs and Programs},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents the formal verication with the Coq proof assistant of several applicative data structures implementing nite sets. These implementations are parameterized by an ordered type for the elements, using functors from the ML module system. The verication follows closely this scheme, using the newly Coq module system.
Citations
| 375 | Deforestation: Transforming programs to eliminate trees - Wadler - 1990 |
| 251 | A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994 |
| 212 | A dichromatic framework for balanced trees - Guibas, Sedgewick - 1978 |
| 196 | Purely Functional Data Structures - Okasaki - 1998 |
| 154 | An algorithm for the organization of information - Adelson-Velskii, Landis - 1962 |
| 73 | A modular module system - Leroy - 2000 |
| 39 | A new extraction for Coq - Letouzey - 2003 |
| 23 | MC2: A Module Calculus for Pure Type Systems - Courant - 2006 |
| 14 | Dependently typed data structures - Xi - 1999 |
| 9 | Constructing Red-Black Trees - Hinze - 1999 |
| 2 | Modules in Type Theory with generative denitions - Chrzszcz - 2003 |
| 1 | Functional pearls: Ecient sets a balancing act - Adams - 1993 |
| 1 | Implementing modules in the system Coq - Chrzszcz - 2003 |
| 1 | Programmation fonctionnelle certie en Coq - Letouzey - 2003 |
