Rose tree - Wikipedia
In computing, a rose tree is a term for the value of a tree data structure with a variable and unbounded number of branches per node.[ 1] The term is mostly used in the functional programming community, e.g., in the context of the Bird–Meertens formalism.[ 2] Apart from the multi-branching property, the most essential characteristic of rose trees is the coincidence of bisimilarity with identity: two distinct rose trees are never bisimilar.
The name "rose tree" was coined by Lambert Meertens to evoke the similarly named, and similarly structured, common rhododendron.[ 3]
We shall call such trees rose trees, a literal translation of rhododendron (Greek ῥόδον = rose, δένδρον = tree), because of resemblance to the habitus of this shrub, except that the latter does not grow upside-down on the Northern hemisphere.
Any of (a)(b)(c) can be empty. Note that (b) can be seen as a special case of (c) – a sequence is just a map from an initial segment of the set N {\displaystyle \mathbb {N} } of natural numbers.
