[Haskell-cafe] Variants of a recursive data structure

Piotr Kalinowski pitkali at gmail.com
Thu Aug 3 08:22:29 EDT 2006

On 03/08/06, Piotr Kalinowski <pitkali at gmail.com> wrote:
> I'm no expert, but was wondering, why not make labelled AST a tree,
> which nodes are tupples holding a node of unlabeled tree and a label ?

Ups, I'm stupid. I guess I should think more before typing anything next time...

Intelligence is like a river: the deeper it is, the less noise it makes

More information about the Haskell-Cafe mailing list