We present a uniqueness type system that is simpler than both Clean's uniqueness system and a system we proposed previously. The new type system is straightforward to implement and add to existing compilers, and can easily be extended with advanced features such as higher rank types and impredicativity. We describe our implementation in Morrow, an experimental functional language with both these features. Finally, we prove soundness of the core type system with respect to the call-by-need lambda calculus. © Springer-Verlag Berlin Heidelberg 2008.
CITATION STYLE
De Vries, E., Plasmeijer, R., & Abrahamson, D. M. (2008). Uniqueness typing simplified. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5083 LNCS, pp. 201–218). https://doi.org/10.1007/978-3-540-85373-2_12
Mendeley helps you to discover research relevant for your work.