Since everyone else is speaking out about records I'll throw in
something about my efforts. I'll also throw in some commentary about
the various issues involved as I go. Although I was responsible for
the implementation, others made valuable contributions to the design.
Warren Burton, Mark
If you are interested in the new I/O system being proposed for Haskell
1.3 you might want to try it out in our latest system. Be aware that
the I/O proposal is not final and there will undoubtedly be changes in
it soon - we will update our release as the I/O proposal changes.
Haskell Hacker Needed!
Yale University Haskell Group
A position is available in the Yale Haskell Group for a Haskell
programmer. We are seeking applicants for a job that will primarily
consist of software development using Haskell, with the principal duty
of
Ian writes:
Should the following be legal or not?
data T a = F (a-a-Bool)
x = F (==)
The compilers all produce an `ambiguous overloading' error, and I am not sure
why. Everything is OK if you give a type declaration for x (x :: Eq a = T a)
or if you add an argument to x.
OK - let's get operational! Dave's choices are:
1) Build the resolution dictionary using the context of Module Two
(the point of declaration)
2) Build the resolution dictionary using the context of Module Three
(the point of use).
While Dave is on the right track, neither of these choices
This is not an error in the compilers! In this example, it is the
context of the derived Eq operator that is the problem. In the
expression NilSet == NilSet, the typing of == is
(==) :: Eq a = a - a - Bool
This `a' is instantiated by Set b (to choose a different type
variable), not Eq b =
I've been away - sorry this response is being made so long after the
original message.
The Haskell IO System
Andy Gill's message about IO points out the fact the monadic IO has
not yet been well integrated into the Haskell IO system. Indeed, to
do this right will require a redesign of the
Dave writes:
Why doesn't Haskell allow you to name components? I know that you
don't *need* to name them, but, like Sandra, I have also seen data
structures with almost two dozen fields. Pattern matching is nice,
but it seems like changing the representation of something could
In answer to your questions:
1) How does functional programming relate to LISP?
Lisp (and Scheme) have first class functions and lexical scoping, the
same as Haskell. At some level you can claim than any language with
these features (including ML) has a strong functional subset.
Certainly
Announcing the release of Yale Haskell 2.0.6
We are releasing the latest version of the Yale Haskell system,
Y2.0.6, in source form. This release includes a binary for the Apple
Macintosh based on MCL. This is primarily a bug fix release. The
user interface has been enhanced somewhat
10 matches
Mail list logo
