Documentation

Bdd.DecisionTree

inductive DecisionTree (n : ) :
Instances For
    Equations
    Instances For
      Equations
      Instances For
        inductive DecisionTree.usesVar {n : } (i : Fin n) :
        Instances For
          theorem DecisionTree.usesVar_iff {n : } (i : Fin n) (T : DecisionTree n) :
          usesVar i T ∃ (i' : Fin n) (l : DecisionTree n) (h : DecisionTree n), T = branch i' l h (i = i' usesVar i l usesVar i h)
          theorem DecisionTree.lift_evaluate {n n' : } {h : n n'} {T : DecisionTree n} {I : Vector Bool n'} :
          (lift h T).evaluate I = T.evaluate (Vector.cast (I.take n))
          theorem DecisionTree.relabel_injective {n : } {T1 T2 : DecisionTree n} {f : } {hf : ∀ (i : Fin n), f i < f n} {h : ∀ (i i' : Fin n), usesVar i T1usesVar i' T2f i = f i'i = i'} :
          relabel hf T1 = relabel hf T2T1 = T2