the
state, then the parts of s0 that are not shared should be collectable.
Cheers,
Theo Norvell
Dr. Theodore Norvell, Assistant Professor [EMAIL PROTECTED]
Memorial University of Newfoundlandhttp://www.engr.mun.ca/~theo
On Tue, 27 Jul 1999, Andreas C. Doering wrote:
let x=[1..] in x==x
would not terminate in the first case but succeed in the second.
But, much worse
let x = (a,b) in x `req` x = True
but
(a,b) `req` (a,b) = False
So referential
other introductory texts of monads): it stops right
before getting really interesting!
Along the same lines and subject to many of the same criticisms is
http://www.engr.mun.ca/~theo/Misc/haskell_and_monads.htm.
Any comments on improving it would be welcome.
Cheers,
Theo Norvell
a compiled C or
Pascal program, as Hugs is an interpreter. It might be interesting to
compare compiled Haskell to C or Pascal.
Cheers,
Theo Norvell
Dr. Theodore Norvell [EMAIL PROTECTED]
Electrical and Computer Engineering
.
I don't want to use the let, because, really I'd like to exend the
data type to be a sum and the case expression to make a decision. What
I really want is a state monad that supports emergency stops. The case
expression is in the implementation of =.
BTW I am using NHC 1.3.
Cheers,
Theo Norvell
