def mirror
import lawful-arrays@0.1.0.0/proof_tree.bend as ProofTreeimport Base
48def mirror(-T: Data, a: Array<T>) -> Mirror(T, a):
49 match a:
50 case ALeaf{x}:
51 (TLeaf{x}, {==})
52 case ANode{xs, ys}:
53 mirror.node(T, xs, ys, mirror(T, xs), mirror(T, ys))