def from
import bend-lawful-stdlib@0.1.0.0/src/sorted.bend as Sortedimport Base
import bend-lawful-stdlib@0.1.0.0/src/class.bend as C
17# every element is at least lo, and the list ascends
18def from(~A: Data, ~o: C.Ord<A>, lo: A, xs: List<&2, A>) -> Type:
19 match xs:
20 case Nil{}:
21 Unit
22 case h <> t:
23 (C.Ord.R(A, o, lo, h) & from(~A, ~o, h, t))