trust that this will save anyone wasting too much more time over this
topic.
David Lester.
On Thu, 10 Oct 2002, Ashley Yakeley wrote:
At 2002-10-10 01:29, Ketil Z. Malde wrote:
I realize it's probably far from trivial, e.g. comparing two equal
numbers could easily not terminate
fractions lazily, but proving that it's
correct involves a proof with several thousand cases. A discussion of
that proof can be found in 15th IEEE Symposium on Computer Arithmetic,
Vail 2001. I ought to get around to a journal publication someday.
David Lester.
Anybody wants to do it with me
complaints than I can. I am sorry to hear that you
find yourself embarrassed. You can thank me for my help when you have the
time.
Though, of course, sending to Manchester Metropolitan University,
might have had a slightly greater effect!
www.mmu.ac.uk
is probably what you'd want.
David
Muller (Trier) and I agree on our results to a 1000 decimal
places.
Just let me know if you need more digits...
---
David Lester
are, and are most unlikely to do a good job
of revising Haskell's numeric libraries.
All I ask of compiler hackers is that they do not treat (a+b)+c as
a+(b+c)!
---
David Lester.
-folding. The alternative is that the Haskell compiler becomes
a skilled Numerical Analyst.
---
David Lester.
is possible if we restrict attention at output to non-function
values.
See: Part I of my DPhil thesis, PRG-73, Oxford [1]; or JE Stoy,
"Congruence of two programming language definitions", TCS 13(2), 1981.
---
David Lester, Informationsbehandling, Chalmers TH, 412-96 Goteborg, Sweden.
[b
