| definition: |
checkNotOrd :: Expression a -> Int -> CSM ()
checkNotOrd e _ =
case e of
(Apply sI
(Variable _ _
(QualIdent _ _
(Ident _ "not" _)))
(Paren _
(InfixApply
_
_
(InfixOp _
(QualIdent _ _
(Ident _ op _)))
_ )))
-> checkNotOrd' sI op warnNotOrd
(Apply sI
(Variable _ _
(QualIdent _ _
(Ident _ "not" _)))
(Paren _
(Apply _
(Apply _
(Variable _ _
(QualIdent _ _
(Ident _ op _)
)
)
_)
_)))
-> checkNotOrd' sI op warnNotOrd'
_ -> return ()
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
-- Checks for the use of `not (a op b)` constructs. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Apply},_) |-> _ || ({Literal},_) |-> _ || ({Variable},_) |-> _ || ({Constructor},_) |-> _ || ({Paren},_) |-> _ || ({Typed},_) |-> _ || ({Record},_) |-> _ || ({RecordUpdate},_) |-> _ || ({Tuple},_) |-> _ || ({List},_) |-> _ || ({ListCompr},_) |-> _ || ({EnumFrom},_) |-> _ || ({EnumFromThen},_) |-> _ || ({EnumFromTo},_) |-> _ || ({EnumFromThenTo},_) |-> _ || ({UnaryMinus},_) |-> _ || ({InfixApply},_) |-> _ || ({LeftSection},_) |-> _ || ({RightSection},_) |-> _ || ({Lambda},_) |-> _ || ({Let},_) |-> _ || ({Do},_) |-> _ || ({IfThenElse},_) |-> _ || ({Case},_) |-> _}
|
| name: |
checkNotOrd |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Curry.Types.Expression a -> Prelude.Int -> Control.Monad.Trans.State.StateT Types.CheckState Data.Functor.Identity.Identity () |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |