<hask>runST</hask> is pure. This is very useful, since it allows you to implement externally pure things like in-place quicksort, and present them as pure functions ∀ e. Ord e ⇒ Array e → Array e; without using any unsafe functions.

<hask>runST</hask> is pure. This is very useful, since it allows you to implement externally pure things like in-place quicksort, and present them as pure functions ∀ e. Ord e ⇒ Array e → Array e; without using any unsafe functions.

−

But that type of <hask>runST</hask> is illegal in Haskell-98, because it needs a universal quantifier *inside* the function-arrow! In the jargon, that

+

But that type of <hask>runST</hask> is illegal in Haskell-98, because it needs a universal quantifier *inside* the function-arrow! In the jargon, that type has rank 2; haskell 98 types may have rank at most 1.

−

type has rank 2; haskell 98 types may have rank at most 1.

+

See http://www.haskell.org/pipermail/haskell-cafe/2007-July/028233.html

See http://www.haskell.org/pipermail/haskell-cafe/2007-July/028233.html

Revision as of 12:56, 31 December 2011

1 A discussion on the Haskell irc

TuringTest: ST lets you implement algorithms that are much more efficient with mutable memory used internally. But the whole "thread" of computation cannot exchange mutable state with the outside world, it can only exchange immutable state.

TuringTest: chessguy: You pass in normal Haskell values and then use ST to allocate mutable memory, then you initialize and play with it, then you put it away and return a normal Haskell value.

sjanssen: a monad that has mutable references and arrays, but has a "run" function that is referentially transparent

DapperDan2: it strikes me that ST is like a lexical scope, where all the variables/state disappear when the function returns.

2 An explanation in Haskell-Cafe

The ST monad lets you use update-in-place, but is escapable (unlike IO).
ST actions have the form:

ST s α

Meaning that they return a value of type α, and execute in "thread" s.
All reference types are tagged with the thread, so that actions can only
affect references in their own "thread".

Now, the type of the function used to escape ST is:

runST ::forall α.(forall s. ST s α)-> α

The action you pass must be universal in s, so inside your action you
don't know what thread, thus you cannot access any other threads, thus

runST

is pure. This is very useful, since it allows you to implement externally pure things like in-place quicksort, and present them as pure functions ∀ e. Ord e ⇒ Array e → Array e; without using any unsafe functions.
But that type of

runST

is illegal in Haskell-98, because it needs a universal quantifier *inside* the function-arrow! In the jargon, that type has rank 2; haskell 98 types may have rank at most 1.

3 A few simple examples

In this example, we define a version of the function sum, but do it in a way which more like how it would be done in imperative languages, where a variable is updated, rather than a new value is formed and passed to the next iteration of the function. While in place modifications of the STRef n are occurring, something that would usually be considered a side effect, it is all done in a safe way which is deterministic. The result is that we get the benefits of being able to modify memory in place, while still producing a pure function with the use of runST.