Hi Dmitri,
I don't have answers for all your questions. But some, at least.
--- Dmitri O.Kondratiev [EMAIL PROTECTED] wrote:
-- Ok, then I can
derive MyOrd class directly from Ord:
class Ord a = MyOrd a where
(%), (%=), (%), (%=) :: a - a - Bool
x % y = x y
x %=
y =
--- [EMAIL PROTECTED] wrote:
Do you have an example of use of seq on
a function type? (Of course I
don't want to ban it, just change its behaviour.)
I don't have any wisdom to offer on how we would want to ban or change
the behavior of seq on a function type without using type classes. Nor
--- Huazhi (Hank) Gong [EMAIL PROTECTED] wrote:
Thank you very much
for introducing tail recursion.
It's my first time to hear this. :)
However, I'm wondering whether every loop structure from C like language can
be translated to this kind of tail recursion?
Yes, as discovered by
John
--- [EMAIL PROTECTED] wrote:
Jerzy Karczmarczuk wrote:
OK, I think
that this subject matured enough to rest in peace...
I would have to
agree with that, although...
Since the subject is not going to rest, why
not also jump in?
Well, each partial list is finite.
I think quite
a few
--- [EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
1:_|_
is certainly finite. In what sense is it not?
I see that point. I have
been using finite as, by convention, equal to total and finite. And so
have others. As always with convention, one can argue. I won't, of course.
Sorry, see my
--- Matthias Fischmann [EMAIL PROTECTED] wrote:
On Thu, Jun 22,
2006 at 09:22:34AM +0100, Simon Peyton-Jones wrote:
To: Brian Hulley
[EMAIL PROTECTED], Joel Reymont [EMAIL PROTECTED]
Cc: haskell-cafe@haskell.org
From: Simon Peyton-Jones [EMAIL PROTECTED]
Date: Thu, 22 Jun
2006 09:22:34
--- Cale Gibbard [EMAIL PROTECTED] wrote:
As an example of this sort
of thing, I know that there are only 4
values of type a - Bool (without
the class context). They are the
constant functions (\x - True), (\x -
False), and two kinds of
failure (\x - _|_), and _|_, where _|_ is pronounced
