The Best of Both Worlds: Linear Functional Programming without Compromise
We present a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming. Unlike previous combinations of linear typing and functional programming, we compromise neither the linear side (for example, our linear values are first-class citizens of the language) nor the functional side (for example, we do not require duplicate definitions of compositions for linear and unrestricted functions). To do so, we must generalize abstraction and application to encompass both linear and unrestricted functions. We capture the typing of the generalized constructs with a novel use of qualified types. Our system maintains the metatheoretic properties of the theory of qualified types, including principal types and decidable type inference. Finally, we give a formal basis for our claims of expressiveness, by showing that evaluation respects linearity, and that our language is a conservative extension of existing functional calculi.
Wed 21 SepDisplayed time zone: Osaka, Sapporo, Tokyo change
15:05 - 16:20
|Talking Bananas: Structural Recursion for Session Types|
|The Best of Both Worlds: Linear Functional Programming without Compromise|
J. Garrett Morris University of Edinburgh, UKDOI
|Context-Free Session Types|