{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:00:33Z","timestamp":1770274833142,"version":"3.49.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>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 metatheoretical properties of ornaments, and describe their elaboration process. We formalize ornamentation via an a posteriori abstraction of the bare code, returning a generic term, which lives in a meta-language 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.<\/jats:p>","DOI":"10.1145\/3158109","type":"journal-article","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T14:21:49Z","timestamp":1514557309000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["A principled approach to ornamentation in ML"],"prefix":"10.1145","volume":"2","author":[{"given":"Thomas","family":"Williams","sequence":"first","affiliation":[{"name":"Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"R\u00e9my","sequence":"additional","affiliation":[{"name":"Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,12,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500577"},{"key":"e_1_2_2_2_1","volume-title":"Experiments in generic programming: runtime type representation and implicit values. Presentation at the OCaml Users and Developers meeting","author":"Chambard Pierre","year":"2012"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591370.2591396"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796814000069"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034796"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232420.1232424"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07151-0_6"},{"key":"e_1_2_2_8_1","volume-title":"Analysis and synthesis of inductive families. DPhil dissertation","author":"Hsiang-Shang Ko."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.2201\/NiiPi.2013.10.5"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796816000307"},{"key":"e_1_2_2_11_1","volume-title":"https:\/\/personal.cis.strath.ac.uk\/conor.mcbride\/ pub\/OAAO\/LitOrn.pdf","author":"McBride Conor","year":"2011"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951914"},{"key":"e_1_2_2_13_1","volume-title":"Trees that grow. JUCS","author":"Najd Shayan","year":"2016"},{"key":"e_1_2_2_14_1","volume-title":"Views for Standard ML. In In SIGPLAN Workshop on ML. 14\u201323","author":"Okasaki Chris","year":"1998"},{"key":"e_1_2_2_15_1","unstructured":"Scala. 2017. Implicit Parameters. Scala documentation. (2017). https:\/\/docs.scala- lang.org\/tour\/implicit- parameters.html  Scala. 2017. Implicit Parameters. Scala documentation. (2017). https:\/\/docs.scala- lang.org\/tour\/implicit- parameters.html"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1708016.1708023"},{"key":"e_1_2_2_17_1","volume-title":"Views: A way for pattern matching to cohabit with data abstraction.","author":"Wadler Philip","year":"1986"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.198.2"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633628.2633631"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3158109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3158109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:30Z","timestamp":1750212690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3158109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,27]]},"references-count":19,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1145\/3158109"],"URL":"https:\/\/doi.org\/10.1145\/3158109","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,27]]},"assertion":[{"value":"2017-12-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}