A monad and monad transformer for nondeterministic computations.

Version on this page:1.4
LTS Haskell 13.25:1.4
Stackage Nightly 2019-06-12:1.4
Latest on Hackage:1.4

See all snapshots nondeterminism appears in

LicenseRef-LGPL licensed and maintained by Andrei Barbu

Module documentation for 1.4

There are no documented modules for this package.


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.


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.


  • allValues is not lazy in its return value
Depends on 3 packages:
Used by 1 package:
comments powered byDisqus