definition: |
(<%) :: Term -> Term -> Term t1 <% t2 = tcomb "<" [t1, t2] |
demand: |
no demanded arguments |
deterministic: |
deterministic operation |
documentation: |
--- Constrain two SMT-LIB terms with a less-than-relation |
failfree: |
(_, _) |
indeterministic: |
referentially transparent operation |
infix: |
infix |
iotype: |
{(_,_) |-> {TComb}} |
name: |
<% |
precedence: |
4 |
result-values: |
{TComb} |
signature: |
Language.SMTLIB.Types.Term -> Language.SMTLIB.Types.Term -> Language.SMTLIB.Types.Term |
solution-complete: |
operationally complete operation |
terminating: |
yes |
totally-defined: |
reducible on all ground data terms |