~/jendhub

def new

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/array.bend:316

import bend-collections-laws-crypto@1.0.0.0/proofs/lib/array.bend as Array
import Base

316def new(-T: Data, +d: Nat, +v: T) -> {Array.new(T, d, v) == thaw(T, trep(T, d, v)) : Array<T>}:
317  match d:
318    case 0n:
319      {==}
320    case 1n+p:
321      %Equal.sym(Array<T>, Array.new(T, p, v), thaw(T, trep(T, p, v)), new(T, p, v)) : {ANode{_, _} == ANode{thaw(T, trep(T, p, v)), thaw(T, trep(T, p, v))} : Array<T>}
322      {==}

Uses (6)

Used by (1)