[Haskell-cafe] Re: Haskell performance (again)!

[Cale Gibbard]

On 09/10/06, apfelmus at quantentunnel.de <apfelmus at quantentunnel.de> wrote:
> Cale Gibbard wrote:
> > I might also like to point out that by "small" and "large", we're
> > actually referring to the number of ways in which components of the
> > datastructure can be computed separately, which tends to correspond
> > nicely to how one usually pictures small and large pieces of data.
>
> I'm not sure what you mean. I thought it is appropriate to count the
> number of approximations to a given value v, i.e. count how many v'
> there are with
>     v' < v
> in the usual CPO ordering, that is Cons _|_ [1,2] < Cons 3 [1,2] etc.
> That count is either large or small.

Yeah, that's exactly what I'm talking about. :)