lightweight linear types in system strongfstrong.pdfVIP

Lightweight Linear Types in System F Karl Mazurak Jianzhou Zhao Steve Zdancewic University of Pennsylvania Abstract Given these success stories, it is perhaps surprising that we have We present System F, an extension of System F that uses kinds to yet to see general linear types seriously considered for inclusion in distinguish between linear and unrestricted types, simplifying the a mainstream functional programming language.1 But alas, linear use of linearity for general-purpose programming. We demonstrate types can easily lead to awkward programming models and poten- through examples how System F can elegantly express many use- tially complicated language designs that are difficult both to imple- ful protocols, and we prove that any protocol representable as a ment and to program with. This paper seeks to address these issues DFA can be encoded as an F type. We supply mechanized proofs by introducing System F —pronounced “F-pop”—a language that of System F ’s soundness and parametricity properties, along with is intended to be a simple foundation for practical linear program- a nonstandard operational semantics that formalizes common intu- ming. Rather than aiming at one particular problem, System F lets itions about linearity and aids in reasoning about protocols. programmers enforce their own protocol abstractions through the We compare System F to other linear systems, noting that the