Ornaments in practice

Abstract : Ornaments have been introduced as a way to describe some changes in datatype definitions that preserve their recursive structure, reorganizing, adding, or dropping some pieces of data. After a new data structure has been described as an ornament of older one, some functions operating on the bare structure can be partially or sometimes totally lifted into functions operating on the ornamented structure. We explore the feasibility and the interest of using ornaments in practice by applying these notions in an ML-like programming language. We propose a concrete syntax for defining ornaments of datatypes and the lifting of bare functions to their ornamented counterparts, describe the lifting process, and present several interesting use cases of ornaments.
Document type :
Conference papers
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01081547
Contributor : Pierre-Évariste Dagand <>
Submitted on : Sunday, November 9, 2014 - 2:21:02 PM
Last modification on : Monday, March 18, 2019 - 4:13:13 PM

Identifiers

Collections

Citation

Thomas Williams, Pierre-Évariste Dagand, Didier Rémy. Ornaments in practice. WGP 2014: ACM workshop on Generic programming, Aug 2014, Gothenburg, Sweden. ⟨10.1145/2633628.2633631⟩. ⟨hal-01081547⟩

Share

Metrics

Record views

348