[Haskell-cafe] Re: Why is this strict in its arguments?

Luke Palmer lrpalmer at gmail.com
Wed Dec 5 06:24:38 EST 2007

On Dec 5, 2007 12:16 AM, Aaron Denney <wnoise at ofb.net> wrote:
> > we (the FPSIG group) defined:
> > data BTree a = Leaf a
> >              | Branch (BTree a) a (BTree a)
> Totally avoiding your question, but I'm curious as to why you
> deliberately exclude empty trees.
> Come to think of it, how can you represent a tree with two elements?

Indeed, this tree is only capable of representing odd numbers of
elements, which can be shown by straightforward induction.


More information about the Haskell-Cafe mailing list