| definition: |
iInfix :: Parser Infix iInfix = word "infix" *> choice [char 'l' *> yield InfixL, char 'r' *> yield InfixR, yield Infix] |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- A parser for an Infix expression | {infixl | infixr | infix}
|
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {<*>._#lambda10}}
|
| name: |
iInfix |
| precedence: |
no precedence defined |
| result-values: |
{<*>._#lambda10}
|
| signature: |
String -> [(CurryInterface.Types.Infix, String)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |