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.
Type de document :
Article dans une revue
Proceedings of the ACM on Programming Languages, ACM, 2018, pp.1-30. 〈10.1145/3158109〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

Contributeur : Thomas Williams <>
Soumis le : lundi 18 décembre 2017 - 10:00:53
Dernière modification le : jeudi 26 avril 2018 - 10:28:49


Fichiers produits par l'(les) auteur(s)




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〉



Consultations de la notice


Téléchargements de fichiers