On 8/4/07, Dan Piponi <[EMAIL PROTECTED]> wrote:
>
> On 8/4/07, Albert Y. C. Lai <[EMAIL PROTECTED]> wrote:
> > There is no reason to expect complex ** to agree with real **.
>
> There's every reason. It is standard mathematical practice to embed
> the integers in the rationals in the reals in the
On 7/9/07, Daniel McAllansmith <[EMAIL PROTECTED]> wrote:
I wouldn't want to comment on the validity of his claim, maybe he's wrong, or
maybe he's... well, anyway... what I will say is I got a chuckle out of
the 'Citations' that Amazon lists.
As amusing as that thought is, it seems that this i
On 6/10/07, Brandon S. Allbery KF8NH <[EMAIL PROTECTED]> wrote:
You're pretty close, actually :) Names derived from Hebrew were
fairly common in the Bible belt back when he was born. ("Haskell"
from השקל, wisdom. I half suspect "Curry" has a Biblical origin
as well, from קרי.)
Bible belt
On 2/22/07, Ruben Zilibowitz <[EMAIL PROTECTED]> wrote:
I see that there has been some discussion on the list about prime
finding algorithms recently. I just wanted to contribute my own
humble algorithm:
[snip]
Comparing it to some of the algorithms in:
http://www.haskell.org/pipermail/haskell
On 4/7/06, Jared Updike <[EMAIL PROTECTED]> wrote:
> > given an Ord instance (for a type T) a corresponding Eq instance can be
> > given by:
> >
> > instance Eq T where
> > a == b = compare a b == EQ
>
> where did this second -^ == come from? (I guess if if Ordering
> derives Eq :-) I think
On 4/6/06, Brian Hulley <[EMAIL PROTECTED]> wrote:
> What about:
>
> class Eq a where (==), (/=) :: ...
> class PartialOrd a where
> (<), (>) :: a->a->Bool
> x > y = y < x
>
> class (PartialOrd a) => TotalOrd a where x <= y = not (y < x)
>-- => not meaning inheritance but just a
