A Principled Approach to Ornamentation in ML

Abstract : Ornaments are a way to describe changes in datatype definitions reorganizing, adding, or dropping some pieces of data so that functions operating on the bare definition can be partially and sometimes totally lifted into functions operating on the ornamented structure. We propose an extension of ML with higher-order ornaments, demonstrate its expressiveness with a few typical examples, including code refactoring, study the metatheoreti-cal properties of ornaments, and describe their elaboration process. We formalize ornamentation via an a poste-riori abstraction of the bare code, returning a generic term, which lives in a metalanguage above ML. The lifted code is obtained by application of the generic term to well-chosen arguments, followed by staged reduction, and some remaining simplifications. We use logical relations to closely relate the lifted code to the bare code.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01666104
Contributor : Thomas Williams <>
Submitted on : Monday, December 18, 2017 - 10:00:53 AM
Last modification on : Thursday, April 26, 2018 - 10:28:49 AM

File

ornaments-popl18-final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Thomas Williams, Didier Rémy. A Principled Approach to Ornamentation in ML. Proceedings of the ACM on Programming Languages, ACM, 2018, pp.1-30. ⟨10.1145/3158109⟩. ⟨hal-01666104⟩

Share

Metrics

Record views

750

Files downloads

339