evaluation of that
function. Is there any hope of being able to do this within the
existing GHC libraries?
If not, is it even possible to determine after-the-fact how much
stack or heap space a function evaluation required?
Thanks,
Jeff Newbern
--
Jeff Newbern [EMAIL PROTECTED]
Nomaware, Inc
will require a
different strategy, and will undoubtedly be more difficult.
I will have to become more familiar with the GHC RTS, I think...
Thanks again,
Jeff Newbern
On Sat, 2004-01-03 at 02:33, Alastair Reid wrote:
I would really like to be able to set resource limits on a per-function
basis. I
this on the PragProg list, and
I didn't have the knowledge to respond. It's a point you might want to
address, perhaps in this section?:
http://www.nomaware.com/monads/html/laws.html#nowayout
[Discussion of whether I/O monad makes Haskell impure]
--
Jeff Newbern [EMAIL PROTECTED]
Nomaware
(or anyone else) have ideas, I'd like to hear
them.
Thanks again,
Jeff
On Tue, 2003-08-12 at 18:24, Peter G. Hancock wrote:
Jeff Newbern wrote (on Tue, 12 Aug 2003 at 17:20):
(proposed revisions)
In the section No Way Out:
--
The IO monad is a familiar example of a one
Hello,
I have put up all-in-one archives of the tutorial for people who
prefer to read it offline.
http://www.nomaware.com/monads/monad_tutorial.tgz
and
http://www.nomaware.com/monads/monad_tutorial.zip
Thanks,
Jeff Newbern
[EMAIL PROTECTED]
__
Do you Yahoo
execution, the issue of purity is
neatly side-stepped.
--
--
Jeff Newbern [EMAIL PROTECTED]
Nomaware, Inc.
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
