expression phrase ⇒ boolean, expression phrase ⇒ boolean
Source: /avail/Avail/Foundation/Logic
Categories: Primitives, Logic
Given two arbitrary
boolean -valued
phrase s, answer a converse implication
phrase. The resulting phrase short-circuits the computation, i.e., only evaluates
b if
a is
true.
boolean, []→boolean
Source: /avail/Avail/Foundation/Logic
Categories: Logic
Compute and answer the converse implication of the arguments. This is equivalent to
a ∨ ¬{@param b }. Short-circuit the computation, i.e., only evaluate
b if
a is false.
|
Position |
Name |
Type |
Description |
Parameters |
1 |
a |
boolean |
|
2 |
b |
[]→boolean |
|
Returns |
boolean |
|
boolean's type, []→(false's type)'s type
Source: /avail/Avail/Foundation/Logic
If the right-hand argument of
_←_ is known statically to be
false, then the static type of the expression is
true.
|
Type |
Description |
Parameter Types |
boolean's type |
|
[]→(false's type)'s type |
|
true's type's type, []→boolean's type
Source: /avail/Avail/Foundation/Logic
If the left-hand argument of
_←_ is known statically to be
true, then the static type of the expression is
true.
|
Type |
Description |
Parameter Types |
true's type's type |
|
[]→boolean's type |
|