Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 25-minute conference presentation from POPL 2018 exploring how ornaments can be used to describe changes in datatype definitions within ML programming. Learn about a proposed ML extension featuring higher-order ornaments that enables code refactoring through reorganizing, adding, or removing data elements. Discover how the formalization process works through a posteriori abstraction of bare code into a generic term in a meta-language, with lifted code obtained through strategic application and staged reduction. Understand the use of logical relations to establish connections between lifted and bare code, with practical examples demonstrating the expressiveness of this principled approach to ornamentation. Explore key concepts including dependent types, logical relations, and artifacts evaluation through this technical deep-dive presented by Thomas Williams and Didier Rémy from Inria, France.
