Practical affine types
JA Tov, R Pucella�- ACM SIGPLAN Notices, 2011 - dl.acm.org
JA Tov, R Pucella
ACM SIGPLAN Notices, 2011•dl.acm.orgAlms is a general-purpose programming language that supports practical affine types. To
offer the expressiveness of Girard's linear logic while keeping the type system light and
convenient, Alms uses expressive kinds that minimize notation while maximizing
polymorphism between affine and unlimited types. A key feature of Alms is the ability to
introduce abstract affine types via ML-style signature ascription. In Alms, an interface can
impose stiffer resource usage restrictions than the principal usage restrictions of its�…
offer the expressiveness of Girard's linear logic while keeping the type system light and
convenient, Alms uses expressive kinds that minimize notation while maximizing
polymorphism between affine and unlimited types. A key feature of Alms is the ability to
introduce abstract affine types via ML-style signature ascription. In Alms, an interface can
impose stiffer resource usage restrictions than the principal usage restrictions of its�…
Alms is a general-purpose programming language that supports practical affine types. To offer the expressiveness of Girard's linear logic while keeping the type system light and convenient, Alms uses expressive kinds that minimize notation while maximizing polymorphism between affine and unlimited types.
A key feature of Alms is the ability to introduce abstract affine types via ML-style signature ascription. In Alms, an interface can impose stiffer resource usage restrictions than the principal usage restrictions of its implementation. This form of sealing allows the type system to naturally and directly express a variety of resource management protocols from special-purpose type systems.
We present two pieces of evidence to demonstrate the validity of our design goals. First, we introduce a prototype implementation of Alms and discuss our experience programming in the language. Second, we establish the soundness of the core language. We also use the core model to prove a principal kinding theorem.
ACM Digital Library