[Haskell-cafe] IO is not a monad
robdockins at fastmail.fm
Thu Jan 25 10:22:01 EST 2007
On Jan 25, 2007, at 6:57 AM, Yitzchak Gale wrote:
> Scott Turner wrote:
>> Paul B. Levy's studies of "call-by-push-value" model strictness/
>> laziness using
>> a category theoretic approach.
> That sounds interesting. Do you have a reference for that?
The first sentence of the paper "Call-by-push-value: Deomposing Call-
By-Value and Call-By-Name" reads:
Let us consider typed call-by-value (CBV) and typed call-by-name
(CBN), and observe
convergence at ground type only. (This restriction does not matter in
CBV, but in CBN,
it makes the η-law for functions into an observational equivalence.)
That sounds a lot like it explicitly excludes a polymorphic "seq".
However, I'm not very familiar with this work, so I don't know if
that is a critical restriction, or merely incidental to the
presentation of this paper.
Speak softly and drive a Sherman tank.
Laugh hard; it's a long way to the bank.
More information about the Haskell-Cafe