You can search for identifiers within the package.
in-package search v0.2.0
The theory of booleans.
val b0 : bool
b0 is false aka 0 bit
b0
false
0
val b1 : bool
b1 is true aka 1 bit
b1
true
1
val inv : bool -> bool
inv x inverts x.
inv x
x
val and_ : bool -> bool -> bool
and_ x y is a conjunction of x and y.
and_ x y
y
val or_ : bool -> bool -> bool
or_ x y is a disjunction of x and y.
or_ x y