At 11:50 AM 8/13/98 +0100, David Lester wrote:
... Edalat and Escardo have
shown that continuity (in the arithmetic sense) is the same as
continuity in the Scott topology sense we are all familiar with.
That's interesting. I'm not familiar with that reference. Would
someone supply it?
Byron
Prompted by the David's message, I'd like to let you know,
that I also have a simple implementation of rational arithmetic.
I am still testing it, but it should be available soon, along
with few other modules.
Possibly not as clever, as David's implementation of rationals
but it has its
[To give people that use threaded e-mail readers a helping hand,
I'd like to encourage posters to use followup/reply when responding,
so that the desired headers are included. -moderator]
Discussing the Numbers in Haskell.
I wrote
Not only Complex but the Real numbers too are impossible to
Hi everybody,
In the discussion about numerics in Haskell, several people are apparently
assuming that you can't compute with real numbers, and that computers must
approximate real numbers using either floating point or rationals.
However, it isn't true that computers cannot handle real
John O'Donnell writes:
The Floating types should be called Floating, and the name Real
should be reserved for numbers that actually obey the algebraic
laws for real numbers.
Here's an issue with the naming scheme proposed above: how many
non-mathematician users will become confused by
Hello,
"Hans" == Hans Aberg [EMAIL PROTECTED] writes:
Hans The idea with calling the floating numbers floating numbers
Hans is that it is possible to implement real numbers too, as in
Hans computer algebra programs.
we have to distinguish between 3 sets:
(1) The set of
At 16:15 +0100 98/08/04, [EMAIL PROTECTED] wrote:
Phil Wadler:
I believe that David A. Turner (of Miranda fame) has an EPSRC
grant to develop arbitrary precision real libraries in Haskell.
Is "arbitrary precision" the same as true real numbers --- or does
it just mean "for this run of the
