CurryInfo: finite-map-3.0.0 / Data.FiniteMap.minusFM

definition:
minusFM :: Eq key => FM key elt -> FM key elt -> FM key elt
minusFM (FM le1 fm1) (FM _ fm2) = FM le1 (minusFM' le1 fm1 fm2)
demand:
arguments 2 3
deterministic:
deterministic operation
documentation:
--- (minusFM a1 a2) deletes from a1 any bindings which are bound in a2
failfree:
<FAILING>
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,{FM},{FM}) |-> {FM}}
name:
minusFM
precedence:
no precedence defined
result-values:
{FM}
signature:
Prelude.Eq a => FM a b -> FM a b -> FM a b
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term