| definition: |
ppInfix :: Infix -> String ppInfix f = case f of Infix -> "infix" InfixL -> "infixl" InfixR -> "infixr" |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Infix}) |-> {:} || ({InfixL}) |-> {:} || ({InfixR}) |-> {:}}
|
| name: |
ppInfix |
| precedence: |
no precedence defined |
| result-values: |
{:}
|
| signature: |
Curry.Types.Infix -> String |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |