scheme :: TREES_2:sch 7
DTreeLambda{ F₁() -> Tree, F₂( object ) -> set } :

ex T being DecoratedTree st
( dom T = F₁() & ( for p being FinSequence of NAT st p in F₁() holds
T . p = F₂(p) ) )