Ornaments in practice - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

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.
No file

Dates and versions

hal-01081547 , version 1 (09-11-2014)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
151 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More