Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
A propagator for the two-point lattice
Documentation
setTop :: P2 -> IO () Source #
Set a propagator to top.
If it was bottom before, runs the actions queued with whenTop
. It does so
_after_ setting the propagator to top, so that cycles are broken.
whenTop :: P2 -> IO () -> IO () Source #
whenTop p act
runs act
if p
is already top, or after setTop p
is run
implies :: P2 -> P2 -> IO () Source #
p1
chains propagators: If implies
p2p1
becomes top, then so does p2
.
isTop :: P2 -> IO Bool Source #
Queries the current state of the propagator. All related calls to setTop
that have executed so far are taken into account.