Uniqueness Typing Simplified

Courtesy Lambda the Ultimate - Programming Languages Weblog  Mon, 03/03/2008 - 09:14

Uniqueness Typing Simplified , by Edsko de Vries, Rinus Plasmeijer, and David M.

Abrahamson.

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...


 

More related items

Translation of Tree-processing Programs into...
Translation of Tree-processing Programs into Stream-processing Programs based on Ordered Linear Types, Koichi Kodama, Kohei Suenaga, Naoki Kobayashi, JFP 2008. There are two ways to write a...

This Week’s Ruby News: Ruby 1.9.3p0, OmniAuth 1.0,...
The rapid descent of the weather towards winter is getting people to stay in and code and long may it continue given the quality of this week's releases: OmniAuth 1.0, MagLev 1.0, and Ruby...

Imperative Programs as Proofs via Game Semantics
Imperative Programs as Proofs via Game Semantics, Martin Churchill, James Laird and Guy McCusker. To appear at LICS 2011. Game semantics extends the Curry-Howard isomorphism to a three-way...


 

Post new comment

The content of this field is kept private and will not be shown publicly.
computer-internet.marc8.com