Lifting an omega-CPO #
Adjoining a fresh bottom preserves omega-completeness and the order within defined values. This is the lift used for lazy values: a defined pair whose fields are partial can acquire more information without changing its tag.
A lifted chain stays defined after its first defined element.
Once a lifted chain becomes defined, its remaining values form a chain in the original domain.
Equations
Instances For
Every increasing sequence in the lifted order has a least upper bound.
The supremum of a lifted chain is bottom precisely when every term is bottom, and otherwise is the lifted supremum of its defined tail.
Equations
- WithBot.omegaCompletePartialOrder = { toPartialOrder := WithBot.instPartialOrder, ωSup := fun (c : OmegaCompletePartialOrder.Chain (WithBot α)) => ⋯.choose, le_ωSup := ⋯, ωSup_le := ⋯ }
A nonbottom tail computes the supremum of the whole lifted chain.
A lifted chain has no information exactly when every term is bottom.
Including defined values preserves suprema of increasing sequences.
The inclusion of a value into its lifted domain.
Equations
- WithBot.coeContinuous = OmegaCompletePartialOrder.ContinuousHom.ofFun (fun (x : α) => ↑x) ⋯
Instances For
Strict extension of a continuous map to a lifted argument.
Equations
- WithBot.extendFun f n = WithBot.recBotCoe ⊥ (⇑f) n
Instances For
Strict extension preserves increasing suprema, including chains that become defined only after a finite delay.
A continuous map extended strictly to a lifted domain.