nondeterminism
A monad and monad transformer for nondeterministic computations.
| LTS Haskell 22.39: | 1.5 |
| Stackage Nightly 2024-10-29: | 1.5 |
| Latest on Hackage: | 1.5 |
This version can be pinned in stack with:
nondeterminism-1.5@sha256:cd4da7bc29adf38b260f1851900317a98f239318ed5bcf908d594f70aa0d7fca,1032Module documentation for 1.5
- Control
- Control.Monad
Depends on 3 packages(full list with versions):
Used by 1 package in lts-22.37(full list with versions):
Nondeterminism
This package is available via Hackage where its documentation resides.
This provides nondeterministic computations in Haskell. It implements
an Amb monad in which you can perform nondeterministic choices along
with a monad transformer version, AmbT.
Amb
An example which finds Pythagorean triplets up to a certain size, project Euler problem 9.
import Control.Monad
import Control.Monad.Amb
pyTriple :: (Num t, Ord t) => t -> Amb r (t, t, t)
pyTriple n = do a <- anIntegerBetween 1 n
b <- anIntegerBetween (a + 1) n
c <- anIntegerBetween (b + 1) n
when (a*a + b*b /= c*c) empty
return (a,b,c)
length $ allValues $ pyTriple 100
More examples can be found in tests/test.hs.
Future
- allValues is not lazy in its return value