Download now Free registration required
The authors present a uniqueness type system that is simpler than both Clean's uniqueness system and a system they 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. They describe their implementation in Morrow, an experimental functional language with both these features. Finally, they prove soundness of the core type system with respect to the call-by-need lambda calculus.
- Format: PDF
- Size: 211.7 KB