law tl_view

lawful-bytes@0.1.1.0 · proof_same.bend:291

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/bytes.bend as B
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P

291law tl_view:
292  for +m: Nat
293  for +len: U32
294  for +t: P.Tree<U32>
295  for +d: Nat
296  for +s: U32
297  for +j: U32
298  for +acc: List<&2, U32>
299  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
300  for +hj: {U32.to_nat(j) == Nat.add(m, U32.to_nat(s)) : Nat}
301  for +hs: {Nat.is_lt(Nat.add(m, U32.to_nat(s)), U32.to_nat(len)) == True{} : Bool}
302  {Pair.snd(D.Bytes, List<&2, U32>, B.to_list.go(1n+m, B.at(C.BT(len, t), j), j, acc)) == List.append(&2, U32, D.slice(D.view(C.BT(len, t)), U32.to_nat(s), 1n+m), acc) : List<&2, U32>}