*First-class labels for extensible rows. (draft)*

Daan Leijen.

Submitted to POPL'05. (PDF, BibTeX)

**Abstract**:
This paper describes a type system for extensible records and variants with first-class 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, closed-world overloading, type case, label selective calculi, and first-class 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 first-class 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.

## Recent comments

16 weeks 1 day ago

16 weeks 2 days ago

16 weeks 2 days ago

38 weeks 3 days ago

42 weeks 5 days ago

44 weeks 2 days ago

44 weeks 2 days ago

47 weeks 5 hours ago

51 weeks 4 days ago

51 weeks 4 days ago