Wolfgang Thaller [EMAIL PROTECTED] writes:
Indeed, my brain is melting, but I did it :-)
Congratulations. How about we found a Bound-thread-induced brain
melt victims' support group?
The melt was entertaining :-)
Besides simplicity, one of the main reasons for moving our select()
call
{-
I have written a program (below) to run a test suite for a list of functions:
[isTotalJunc, isPartialJunc]
where each function receives a datum of type ApplyArg whose value slot is
one element at a time of the list of types below:
[JNone, JOne, JAny, JAll]
I therefore must run 8
Am Donnerstag, 3. März 2005 14:28 schrieb Terrence Brannon:
{-
I have written a program (below) to run a test suite for a list of
functions:
[isTotalJunc, isPartialJunc]
where each function receives a datum of type ApplyArg whose value slot is
one element at a time of the list of types
[moving to the cafe]
On Thu, Mar 03, 2005 at 09:39:17AM -0500, Scott Turner wrote:
Is the behavior of evaluating z unspecified?
z = f (0, z)
f x = case x of
(1,1) - z
_ - 0
Hugs and GHC agree that z evaluates to 0. However, if the first line is
changed to
z = f (z,0)
then both
Am Donnerstag, 3. März 2005 14:28 schrieb Terrence Brannon:
{-
I have written a program (below) to run a test suite for a list of
functions:
[isTotalJunc, isPartialJunc]
where each function receives a datum of type ApplyArg whose value slot is
one element at a time of the list of types
Peter Simons told me that someone has written a DNS resolver in
Haskell that doesn't rely on an FFI call. I'd love to look at it if
it is available...
-Alex-
__
S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com
Thaks a lot for your contribution, this helps me a lot, I see what I've got to do.
However, I understand the first version (Stack.hs), but I can't get what StateM.hs is. Is
it the same version but using state transformers, so as to be able to do IO (which I would
need)? In fact, could you give
