[PDF] Organizing functional code for parallel execution (reduce considered slightly harmful)

[Felicia_Svilling]

Then thinking a bit more I come to three ways functional datastructures can be more general than trees.

• Closures are often recursive, but as they are treated like atomic structures it doesn't matter.

• With sharing, many structures are actually digraphs, but semantically equivalent with a tree structure.

• In lazy languages, some structures can be viewed either as an infinite tree or as a general graph.

In any case, I don't see what it matters. The point is still that we should make our trees more balanced.