Rose (n-way) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations.
Why do you think that https://github.com/higherkindness/mu-haskell is a good alternative to dual-tree
Rose (n-way) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations.
Why do you think that https://github.com/higherkindness/mu-haskell is a good alternative to dual-tree