legal 1.2 (or 1.3)
Haskell programs, and why?
Answers next week,
---
David Lester, Dept CS, Manchester University, Manchester M13 9PL UK.
-- begin 1 --
-- end 1 --
-- begin 2 --
{}
-- end 2 --
-- begin 3 --
main = print "\'"
-- end 3 --
-- begin 4 --
main = print &#x
askell allow
> these sort of optimizations?
What I would hope is that user-placed parentheses would prevent
constant-folding. The alternative is that the Haskell compiler becomes
a skilled Numerical Analyst.
---
David Lester.
produce a fully abstract
denotational semantics for Haskell, then I withdraw my objection
forthwith
... on the otherhand, it is undeniable that it would, on occasions,
be a useful debugging technique.
---
David Lester, Informationsbehandling, Chalmers TH, 412-96 Goteborg, Sweden.
[but usually:
ctions.
A fudge 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 Goteb
ackers! We aren't numeric
> experts like some of you 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.
John says:
> [...]
> However, it isn't true that computers cannot handle real numbers.
> There have been several papers on exact real arithmetic (I believe
> by Corky Cartwright and David Lester). The idea is to use lazy
> representations of unbounded data structure
rbert Muller (Trier) and I agree on our results to a 1000 decimal
places.
Just let me know if you need more digits...
---
David Lester
ly what you'd want.
David Lester, Manchester University.
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
