Discrete value domains #
An equality-ordered type is an omega-CPO: every increasing sequence is constant. The wrapper avoids changing the ordinary arithmetic order on numbers or the Boolean order when using them as runtime values.
A type equipped with the equality order.
- value : α
The underlying value.
Instances For
@[instance_reducible]
instance instDecidableEqDiscreteOrder {α✝ : Type u_1} [DecidableEq α✝] :
DecidableEq (DiscreteOrder α✝)
def instDecidableEqDiscreteOrder.decEq {α✝ : Type u_1} [DecidableEq α✝] (x✝ x✝¹ : DiscreteOrder α✝) :
Equations
Instances For
@[instance_reducible]
Equations
- instReprDiscreteOrder = { reprPrec := instReprDiscreteOrder.repr }
Equations
- instReprDiscreteOrder.repr x✝ prec✝ = Std.Format.bracket "{ " (Std.Format.nil ++ Std.Format.text "value" ++ Std.Format.text " := " ++ (Std.Format.nest 9 (repr x✝.value)).group) " }"
Instances For
@[instance_reducible]
Equations
- DiscreteOrder.instPartialOrder = { le := Eq, le_refl := ⋯, le_trans := ⋯, lt_iff_le_not_ge := ⋯, le_antisymm := ⋯ }
@[instance_reducible]
Equations
- One or more equations did not get rendered due to their size.
def DiscreteOrder.continuousMap {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder β] (f : α → β) :
Every map from a discrete domain is continuous.
Equations
- DiscreteOrder.continuousMap f = { toFun := fun (x : DiscreteOrder α) => f x.value, monotone' := ⋯, map_ωSup' := ⋯ }
Instances For
theorem DiscreteOrder.ωScottContinuous_continuousMap {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder β] :
Constructing a continuous map from a discrete domain is itself continuous.