Transporting functions across ornaments

Pierre-Evariste Dagand, Conor McBride

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

14 Citations (Scopus)

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 effort of code reuse among similarly structured data. In this paper, we exorcise our datatypes by adapting 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.
Original languageEnglish
Title of host publicationICFP '12 Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Place of PublicationNew York
Pages104-113
Number of pages10
DOIs
Publication statusPublished - 2012

Keywords

  • dependent types
  • ornaments
  • functions
  • domain-specific logics
  • transporting functions

Cite this

Dagand, P-E., & McBride, C. (2012). Transporting functions across ornaments. In ICFP '12 Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (pp. 104-113). New York. https://doi.org/10.1145/2364527.2364544