Records, sums, cases, and exceptions: Row-polymorphism at work [1/9]

Опубликовано 6 сентября 2016, 16:22

I will present the design of a programming language (called MLPolyR) whose type system makes significant use of row polymorphism (Rémy, 1991). MLPolyR (Blume et al. 2006) is a dialect of ML and provides extensible records as well as their exact dual, polymorphic sums with extensible first-class cases. As I will demonstrate, first-class extensible cases enable code written in a certain style to be re-used in the context of wider types (sum types with more variants) than originally anticipated. This flexibility is similar to the way class-based object-oriented code can be extended by subclassing -- without, however, giving up on extensibility in the dimension of functionality (adding