DMCA
PROGRAM-ing finger trees in Coq (2007)
| Venue: | In ACM SIGPLAN International Conference on Functional Programming. Association for Computing Machinery |
| Citations: | 22 - 4 self |
BibTeX
@INPROCEEDINGS{Sozeau07program-ingfinger,
author = {Matthieu Sozeau},
title = {PROGRAM-ing finger trees in Coq},
booktitle = {In ACM SIGPLAN International Conference on Functional Programming. Association for Computing Machinery},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Finger Trees (Hinze and Paterson 2006) are a general purpose persistent data structure with good performance. Their genericity permits developing a wealth of structures like ordered sequences or interval trees on top of a single implementation. However, the type systems used by current functional languages do not guarantee the coherent parameterization and specialization of Finger Trees, let alone the correctness of their implementation.We present a certified implementation of Finger Trees solving these problems using the PROGRAM extension of COQ. We not only implement the structure but also prove its invariants along the way, which permit building certified structures on top of Finger Trees in an elegant way. Categories and Subject Descriptors D.2.4 [Software/Program
Keyphrases
finger tree program-ing finger tree interval tree good performance program extension elegant way coherent parameterization software program general purpose persistent data structure subject descriptor single implementation current functional language type system ordered sequence certified implementation
