[EMAIL PROTECTED] writes:
> [...]
>
> Could we please have lightweight extensible records for Haskell (as
> in the paper by (Mark|Simon Peyton) Jones in the 1999 Haskell
> Workshop).
Seconded.
Symmetric record catenation, as opposed to extensibility by one field
at a time, would make the H
This is an item for the Haskell Wish List. I'm posting it to the Haskell list,
because that is the current wish-list policy.
Could we please have lightweight extensible records for Haskell (as in the paper
by (Mark|Simon Peyton) Jones in the 1999 Haskell Workshop).
When that happens it will be
I continue arguing for the overlapping instances.
To my
>> It may know how to compute an operation in a more efficient way in
>> the special case, and in a less efficient way in the generic case.
Marcin 'Qrczak' Kowalczyk <[EMAIL PROTECTED]> writes on 6 Feb 2000
> But in a case where it's on
Another kind of rounding can occur when a floating number is
converted between different formats, for example with
processors that internally use a higher precision.
Consider the following two almost identical programs.
-
small powerOf2 exp
| powe
On Wed, 9 Feb 2000, Stefan Friedel wrote:
> Hi everybody, I have a problem. I'm new to haskell and
> I have to write a function that takes the following
> list and finds the average by using recursion and
> adding the numbers together. I'm completely STUCK!
> Thank you.
>
> > sales :: Int -> Fl
