CurryInfo: currypp-3.2.0 / CPP.ICode.ParseMonad.fstPM

definition:
fstPM :: PM (a,b) -> PM a
fstPM = liftPM fst
demand:
no demanded arguments
deterministic:
deterministic operation
documentation:
--- fst defined on PM
failfree:
()
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{() |-> {liftPM}}
name:
fstPM
precedence:
no precedence defined
result-values:
{liftPM}
signature:
PM (a, b) -> PM a
solution-complete:
operation might suspend on free variables
terminating:
yes
totally-defined:
reducible on all ground data terms