
24 Jan
2007
24 Jan
'07
4:27 a.m.
On Wed, 2007-01-24 at 00:33 +0200, Yitzchak Gale wrote:
My challenge is:
1. Find a way to model strictness/laziness properties of Haskell functions in a category in a way that is reasonably rich.
The reason it's not obvious for categories is because the semantics for Haskell comes from domain theory (CPOs etc) not categories. Domains can describe the issues of strictness in data types quite precisely, including the lifted function space. Duncan