| definition: |
condTRS :: TRS QName
condTRS = let tTrue = tConst (pre "True")
tFalse = tConst (pre "False")
in [(TermCons condQName [tTrue, TermVar 0, TermVar 1], TermVar 0),
(TermCons condQName [tFalse, TermVar 0, TermVar 1], TermVar 1)]
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
Returns the term rewriting system for an `if-then-else`-function. |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {:}}
|
| name: |
condTRS |
| precedence: |
no precedence defined |
| result-values: |
{:}
|
| signature: |
[(Rewriting.Term.Term (String, String), Rewriting.Term.Term (String, String))] |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |