ImperativeHaskell-2.0.0.0: A library for writing Imperative style haskell.

PortabilityNoMonomorphismRestriction
Stabilityexperimental
MaintainerMatthew Mirman <mmirman@andrew.cmu.edu>
Safe HaskellNone

Control.Monad.Imperative.Operators

Description

Some predefined operators for the imperative monad.

Synopsis

Documentation

(+=:) :: (HasValue r (V k r) i, Num b) => V TyVar r b -> V k r b -> MIO i r ()Source

(-=:) :: (HasValue r (V k r) i, Num b) => V TyVar r b -> V k r b -> MIO i r ()Source

(*=:) :: (HasValue r (V k r) i, Num b) => V TyVar r b -> V k r b -> MIO i r ()Source

(%=:) :: (HasValue r (V k r) i, Integral b) => V TyVar r b -> V k r b -> MIO i r ()Source

(<.) :: (Ord c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r BoolSource

(<=.) :: (Ord c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r BoolSource

(>=.) :: (Ord c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r BoolSource

(>.) :: (Ord c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r BoolSource

(==.) :: (Eq c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r BoolSource

(+.) :: (Num c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r cSource

(*.) :: (Num c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r cSource

(-.) :: (Num c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r cSource

(%.) :: (Integral c, HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r cSource

(/.) :: (HasValue r (V b1 r) i, HasValue r (V b2 r) i, Fractional c) => V b1 r c -> V b2 r c -> V (TyComp i TyVal) r cSource

(&&.) :: (HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r Bool -> V b2 r Bool -> V (TyComp i TyVal) r BoolSource

(||.) :: (HasValue r (V b1 r) i, HasValue r (V b2 r) i) => V b1 r Bool -> V b2 r Bool -> V (TyComp i TyVal) r BoolSource

(~.) :: HasValue r (V b r) i => V b r Bool -> V (TyComp i TyVal) r BoolSource

liftOp2 :: (HasValue r (V b1 r) i, HasValue r (V b2 r) i) => (a -> b -> c) -> V b1 r a -> V b2 r b -> V (TyComp i TyVal) r cSource

liftOp2 f turns a pure function into one which gets executes its arguments and returns their value as a function. It is defined using liftOp.