It's a bug, which is fixed in 4.04
Ah-hah... (I could likely have tested this myself, had I had the
gumption...)
(a Win32 version of which is due out shortly.)
Excellent. For one scary moment thoughts like 'Windoze build from
source' were going through my head.
Cheers,
Alex.
It's a bug, which is fixed in 4.04 (a Win32
version of which is due out shortly.)
--sigbjorn
Alex Ferguson [EMAIL PROTECTED] writes:
Observe:
BASH.EXE-2.02$ cat Enum.hs
enumerate :: (Enum a, Bounded a) = [a]
enumerate = [minBound .. maxBound]
data Test = Foo | Bar | Blah |
On Tue 12 Oct, Kevin Atkinson wrote:
I have been meaning to bring this up for quite some time. I think
Haskell could really benefit from a uniqueness typing system as it would
really simplify many things, such as fast array updates.
I have mixed feelings about uniqueness typing. The idea of
It would be nice to be able to say
module Shape(
Shape,
Square :: Int - Shape,
RotateDegrees :: Int - Shape - Shape,
...
) where . . .
Ideally one would want to be able to have instance declarations as well.
This would mean that someone using the Shape
On 07-Oct-1999, Michael T. Richter [EMAIL PROTECTED] wrote:
At 05:12 PM 10/7/99 , you wrote:
Sorry that I really can't explain well why I think that this concept
does not fit into Haskell. I must have heard that such "typecase"
is most often a bad design.
In most situations,
AsmGofer is an extension of TkGofer. TkGofer is an extension of
Gofer in order to support graphical user interfaces. Gofer is a
subset of Haskell.
AsmGofer can be viewed as TkGofer with a notion
of state. You can declare dynamic functions and redefine them
during execution. Here is one example:
XML documents are trees, and processing them is graph traversal. This
paper might be of some theoretical help:
Functional Programming with Graphs, Martin Erwig. 2nd ACM SIGPLAN Int.
Conf. on Functional Programming (ICFP'97), 52-65, 1997 (also in: ACM
SIGPLAN Notices, Vol. 32,No. 8, Aug 1997,
So maybe, as you say, uniqueness typing would be useful in Haskell.
It seems to give Clean a speed advantage for number/array crunching at
present (or so I've heard, though I must confess I've never tried it
in either language).
Unique types do not provide any efficiency advantage over a
Hi Joachim,
| AsmGofer is an extension of TkGofer. TkGofer is an extension of
| Gofer in order to support graphical user interfaces. Gofer is a
| subset of Haskell.
I'd like to urge you to consider making the AsmGofer distribution
more publicly available. I was shocked to find that I couldn't
I should clarify my comment:
If Clean has faster arrays than monadic arrays in
Haskell, it is probably due to other issues, such as laziness.
I did not mean to imply that Haskell directly supports monadic arrays.
But it would be easy to add them in a library, and I believe one is
floating
We are pleased to announce a new release of Hugs, a Haskell
interpreter and programming environment for developing cool
Haskell programs. Sources and binaries are freely available
by anonymous FTP and on the World-Wide Web. The release and
supporting documents can be downloaded
11 matches
Mail list logo
