Uniqueness type

In computing, a unique type guarantees that an object is used in a single-threaded way, without duplicating references to it. If a value has a unique type it can be modified in place improving the efficiency of functional languages while maintaining their referential transparency. Unique types can also be used to integrate functional and imperative programming languages.

Uniqueness types are implemented in the functional programming languages Clean and Mercury.

A theory of uniqueness types has been proposed by Dana Harrington in his master thesis.

See also

• Linear type
• Linear logic

External link

• Dana Harrington's Master Thesis (http://www.cpsc.ucalgary.ca/~danaha/uniqueness-types.ps)