Sorted.from: def of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/sorted.bend as Sorted
Lines 17-23 of bend-lawful-stdlib@0.1.0.0/src/sorted.bend: https://jend.leeeet.dev/read.txt?path=bend-lawful-stdlib@0.1.0.0/src/sorted.bend&start_line=17&end_line=23

import Base
import bend-lawful-stdlib@0.1.0.0/src/class.bend as C

# every element is at least lo, and the list ascends
def from(~A: Data, ~o: C.Ord<A>, lo: A, xs: List<&2, A>) -> Type:
  match xs:
    case Nil{}:
      Unit
    case h <> t:
      (C.Ord.R(A, o, lo, h) & from(~A, ~o, h, t))

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Unit
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/class.bend&name=Ord
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/class.bend&name=Ord.R