Skip to Main content Skip to Navigation
Journal articles

Transporting functions across ornaments

Abstract : Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-construction software. However, this extreme accuracy is also a curse: a datatype is the combination of a structuring medium together with a special purpose logic. These domain-specific logics hamper any attempt to reuse code across similarly structured data. In this article, we capitalise on the structural invariants of datatypes. To do so, we first adapt the notion of ornament to our universe of inductive families. We then show how code reuse can be achieved by ornamenting functions. Using these functional ornaments, we capture the relationship between functions such as the addition of natural numbers and the concatenation of lists. With this knowledge, we demonstrate how the implementation of the former informs the implementation of the latter: the user can ask the definition of addition to be lifted to lists and she will only be asked the details necessary to carry on adding lists rather than numbers. Our presentation is formalised in a type theory with a universe of datatypes and all our constructions have been implemented as generic programs, requiring no extension to the type theory.
Document type :
Journal articles
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Pierre-Évariste Dagand Connect in order to contact the contributor
Submitted on : Saturday, December 28, 2013 - 2:49:40 PM
Last modification on : Friday, January 21, 2022 - 3:19:38 AM
Long-term archiving on: : Friday, March 28, 2014 - 10:05:52 PM


Files produced by the author(s)




Pierre-Évariste  Dagand, Conor  Mcbride. Transporting functions across ornaments. Journal of Functional Programming, Cambridge University Press (CUP), 2014, 24 (2-3), pp.67. ⟨10.1017/S0956796814000069⟩. ⟨hal-00922581⟩



Les métriques sont temporairement indisponibles