Why is there a space leak in foo1 but not in foo2?
(I.e., in Hugs Nov '99) foo1 eats cells (and eventually runs out) where foo2
doesn't. That is, if I do (length (foo1 100)) I eventually run
out of cells but (length (foo2 100)) runs fine (every GC returns basically
the same amount
k e
-> [e] and even replMin on the information that's there in the type.
-- Dave
-Original Message-
From: Tom Pledger [mailto:[EMAIL PROTECTED]]
Sent: Monday, May 21, 2001 7:25 PM
To: [EMAIL PROTECTED]
Subject: Recursive types?
David Bakin writes:
| I'm having trouble underst
I'm having trouble
understanding recursive types (e.g., as described in Functional Programming
with Overloading and Higher-Order Polymorphism by
Jones.
He gives as an
example
> data Mu f = In
(f (Mu f))
> data NatF s =
Zero | Succ s
> type Nat = Mu
NatF
Among the things I
don't
This article is very good, and having read the conference paper earlier
in the year I finished it with only one question: What's a 'quant' ...
and is it good or bad to be one?
"Ten years ago, Jean-Marc Eber, then a quant at Société
Générale, ..."
-- Dave
-Original Message-
From
Except that he does say in the conclusion of the paper: "This paper
proposes the replacement of monads as a structuring tool for combinator
libraries, by arrows."
I don't think he made that argument though; I think the argument he made was
that arrows could be an alternative structuring tool f
I'm working my way through both papers now (arrows, and deterministic
error-correcting parsers). They're very interesting.
I wanted to point out that I see a similarity to work being done in the C++
community with "template metaprograms" and "active libraries", where some
library developers (t
Hi. For the TeX-impaired, is there any chance of sticking postscript files
on an ftp site? Thanks! -- Dave
>A draft of the Haskell 1.3 report is available by FTP from
>ftp.dcs.glasgow.ac.uk [130.209.240.50] in
>
> pub/haskell/report/draft-report-1.3.dvi.gz [Report]
> pub/hask
