bug in language definition (strictness)

[Mathias Stearn]

On Thu, Aug 6, 2009 at 11:00 AM, Ross Paterson<ross at soi.city.ac.uk> wrote:
> There is no stack overflow in the denotational semantics.

There is currently no denotational semantics simulator with an
infinite stack. Until there is, Haskell programs will have to be
executed on lowly physical computers with all the limitations that is
implied. Can we please make things work well on them?