Array.perfect: def of bend-collections-laws-crypto@1.0.0.0
Import: import bend-collections-laws-crypto@1.0.0.0/proofs/lib/array.bend as Array
Lines 42-51 of bend-collections-laws-crypto@1.0.0.0/proofs/lib/array.bend: https://jend.leeeet.dev/read.txt?path=bend-collections-laws-crypto@1.0.0.0/proofs/lib/array.bend&start_line=42&end_line=51

import Base

def perfect(-T: Data, +d: Nat, t: Tree<T>) -> Bool:
  match d t:
    case 0n TLeaf{x}:
      True{}
    case 0n TNode{l, r}:
      False{}
    case 1n+p TLeaf{x}:
      False{}
    case 1n+p TNode{l, r}:
      Bool.and(perfect(T, p, l), perfect(T, p, r))

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.and
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-crypto@1.0.0.0/proofs/lib/array.bend&name=Tree