uniqueness type

In computing, a unique type guarantees that an object is used in a single-threaded way, with at most a single reference to it. If a value has a unique type it can be modified in place improving the efficiency of functional languages while maintaining 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.

External link

* Dana Harrington's Master Thesis

<< Previous

Word Browser

Next >>

aliens from space
ludichrist
neue slowenische kunst
chedworth
caerleon
chalk figures in the united kingdom
tamara de lempicka
self publishing
muskingum river
harbor defenses of manila and subic bays
fort mills

philippine division
ovulation
vowel shift
patriarch ephiphanius of constantinople
louis ii of france
katie hnida
chain
days of wine and roses
marcello mastroianni
divorce, italian style
dana scott

this sporting life
clean programming language
scalar field
hud (movie)
cat ballou
formal methods
the spy who came in from the cold
isabelle theorem prover
the pawnbroker
hol theorem prover
douglas dunn

oskar werner
carl czerny
alan arkin
herb ritts
cool hand luke
cliff robertson
edge of sanity
lcf theorem prover
charly
the heart is a lonely hunter
computer program analysis

Uniqueness Type

See also

External link