User loginNavigation 
Morrow & Firstclass LabelsFirstclass labels for extensible rows. (draft) Abstract: This paper describes a type system for extensible records and variants with firstclass labels; labels are polymorphic and can be passed as arguments. This increases the expressiveness of conventional record calculi significantly, and we show how we can encode intersection types, closedworld overloading, type case, label selective calculi, and firstclass messages. We formally motivate the need for row equality predicates to express type constraints in the presence of polymorphic labels. This naturally leads to an orthogonal treatment of unrestricted row polymorphism that can be used to express firstclass patterns. Based on the theory of qualified types, we present an effective type inference algorithm and efficient compilation method. The type inference algorithm, including the discussed extensions, is fully implemented in the experimental Morrow compiler. Always trust Daan to come up with something both elegant and practical...! However the examples involving bottom (undefined) labels left me skeptical. 
Browse archives
Active forum topics

Recent comments
13 weeks 4 days ago
17 weeks 6 days ago
19 weeks 3 days ago
19 weeks 3 days ago
22 weeks 1 day ago
26 weeks 5 days ago
26 weeks 6 days ago
27 weeks 2 days ago
27 weeks 2 days ago
30 weeks 17 hours ago