def AP.reflect.go

bend-osdev-array@0.1.0.1 · PROOF.bend:1550

import Base
import bend-osdev-array@0.1.0.1/array.bend as A

1550def AP.reflect.go(-T: Data, +d: Nat, -a: Array<T>, h: {A.Arrays.is_perfect(T, d, a) == True{} : Bool}, +f: T, r: &t: AP.Tree<T> -> {AP.build(T, t) == a : Array<T>}) -> &xs: List<&2, T> -> {A.Arrays.of_list(T, d, xs, f) == a : Array<T>} & {List.length(&2, T, xs) == A.Arrays.slots(d) : Nat}:
1551  (t, e) = r
1552  AP.reflect_list(T, d, a, h, f, t, e)