Balancing Lists: A Proof Pearl - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Balancing Lists: A Proof Pearl

Abstract

Starting with an algorithm to turn lists into full trees which uses non-obvious invariants and partial functions, we progressively encode the invariants in the types of the data, removing most of the burden of a correctness proof. The invariants are encoded using non-uniform inductive types which parallel numerical representations in a style advertised by Okasaki, and a small amount of dependent types.
Fichier principal
Vignette du fichier
Balancing%20lists.pdf (394.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01097937 , version 1 (22-12-2014)

Licence

Attribution

Identifiers

Cite

Guyslain Naves, Arnaud Spiwack. Balancing Lists: A Proof Pearl. 5th International Conference, ITP 2014, Jul 2014, Vienna, Austria. pp.437 - 449, ⟨10.1007/978-3-319-08970-6_28⟩. ⟨hal-01097937⟩
194 View
92 Download

Altmetric

Share

Gmail Facebook X LinkedIn More