Monad/ST
From HaskellWiki
m (→An explanation in Haskell-Cafe) |
m (remove chatter) |
||
(5 intermediate revisions by 4 users not shown) | |||
Line 36: | Line 36: | ||
</haskell> | </haskell> | ||
− | The action you pass must be universal in s, so inside your action you | + | 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 <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. |
− | don't know what thread, thus you cannot access any other threads, thus | + | |
− | <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 type has rank 2; haskell 98 types may have rank at most 1. | 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. | ||
See http://www.haskell.org/pipermail/haskell-cafe/2007-July/028233.html | See http://www.haskell.org/pipermail/haskell-cafe/2007-July/028233.html | ||
− | |||
− | |||
− | |||
− | |||
== A few simple examples == | == A few simple examples == | ||
Line 103: | Line 97: | ||
y' <- readSTRef y | y' <- readSTRef y | ||
writeSTRef x y' | writeSTRef x y' | ||
− | writeSTRef y | + | writeSTRef y $! x'+y' |
fibST' (n-1) x y | fibST' (n-1) x y | ||
</haskell> | </haskell> | ||
− | + | ||
+ | [1] Since we're using Integers, technically it's not constant space, as they grow in size when they get bigger, but we can ignore this. | ||
+ | |||
+ | == References == | ||
+ | * [http://research.microsoft.com/en-us/um/people/simonpj/papers/lazy-functional-state-threads.ps.Z Lazy Functional State Threads, John Launchbury and Simon Peyton Jones] | ||
+ | * [http://www.haskell.org/ghc/docs/latest/html/libraries/base/Control-Monad-ST.html Control.Monad.ST in the base libraries] |
Latest revision as of 15:48, 24 July 2012
import Control.Monad.ST |
The ST monad provides support for strict state threads.
Contents |
[edit] 1 A discussion on the Haskell irc
From #haskell (see 13:05:37 in the log ):
- 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.
[edit] 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 α) -> α
See http://www.haskell.org/pipermail/haskell-cafe/2007-July/028233.html
[edit] 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.
import Control.Monad.ST import Data.STRef import Control.Monad sumST :: Num a => [a] -> a sumST xs = runST $ do -- runST takes out stateful code and makes it pure again. n <- newSTRef 0 -- Create an STRef (place in memory to store values) forM_ xs $ \x -> do -- For each element of xs .. modifySTRef n (+x) -- add it to what we have in n. readSTRef n -- read the value of n, and return it.
An implementation of foldl using the ST monad (a lot like sum, and in fact sum can be defined in terms of foldlST):
foldlST :: (a -> b -> a) -> a -> [b] -> a foldlST f acc xs = runST $ do acc' <- newSTRef acc -- Create a variable for the accumulator forM_ xs $ \x -> do -- For each x in xs... a <- readSTRef acc' -- read the accumulator writeSTRef acc' (f a x) -- apply f to the accumulator and x readSTRef acc' -- and finally read the result
An example of the Fibonacci function running in constant¹ space:
fibST :: Integer -> Integer fibST n = if n < 2 then n else runST $ do x <- newSTRef 0 y <- newSTRef 1 fibST' n x y where fibST' 0 x _ = readSTRef x fibST' n x y = do x' <- readSTRef x y' <- readSTRef y writeSTRef x y' writeSTRef y $! x'+y' fibST' (n-1) x y
[1] Since we're using Integers, technically it's not constant space, as they grow in size when they get bigger, but we can ignore this.