let vs. case

2000-03-28 Thread Theo Norvell
cs is the same in both cases. 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 >&

Re: Thanks, and new question re existensials

1999-11-07 Thread Theo Norvell
On Sat, 6 Nov 1999, Lennart Augustsson wrote: > Implementing existentials without a context is very easy. It took less than a > day in hbc. But when you want to handle a context on the type variable > as well, which is when it gets interesting, is more complicated. Are there any tutorials or b

Re: OO in Haskell

1999-10-05 Thread Theo Norvell
I could repost this code as well as an > explanation of the many "hacks" I had to due to get around ambiguity > arising fro the use of multiple parameter classes and other > limitations of Haskell. Rather than repost all the code, could you post just enough to show the source of the difficulty? Cheers, Theo Norvell

Re: Monads in plain engllish (Was: Re: Licenses and Libraries)

1999-08-23 Thread Theo Norvell
t text is not bad, but I think it still has a problem (one I found > in two or three 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

Re: Many thanks (re: book recommendations)

1999-08-12 Thread Theo Norvell
theo/Misc/haskell_and_monads.htm (in HTML, no less, so there will be no font problems). Cheers, Theo Norvell Dr. Theodore Norvell [EMAIL PROTECTED] Electrical and Computer Engineeringhttp://www.engr.mun.ca/~theo Engine

RE: Again: Referential Equality

1999-07-27 Thread Theo Norvell
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 > > > >

RE: strict data field

1999-06-10 Thread Theo Norvell
updated 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

Re: Ackermann's function

1999-01-16 Thread Theo Norvell
are comparing speed, I doubt Hugs will outperform 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 [E