Suppose you want to define a combinator like this:
combinator :: (forall y. Class y => y -> y) -> (forall x. Class x => x -> x)
This is a function combinator which turns a polymorphic function
into another polymorphic function. As you can see, there is Class
constraint.
So in fact we would lik
Announcing HXML version 0.2, a non-validating XML parser written in Haskell.
It is designed for space-efficiency, taking advantage of lazy evaluation
to reduce memory requirements.
HXML is available at:
http://www.flightlab.com/~joe/hxml >
The current version is 0.2, and is pre-beta qualit
At 2002-03-06 06:13, Ralf Laemmel wrote:
>This is not a bug,
Isn't it? Consider:
class Class x where
combinator' :: (forall y. Class y => y -> y) -> x -> x
This gives:
combinator' :: forall x. Class x => (forall y. Class y => y -> y) -> x
-> x
What happens when you pass something of
One more bulk email --- aren't you the least bit curious to find out
what it's about?
Well, call us Toll Free at 1-888-248-4571.
OR, read on ...
HAVE YOU HEARD OF
HUMAN GROWTH HORMONE (HGH)???
(This product works best for people over 35)
Re
Hello everybody,
Although I didn't manage to reproduce the
bug with a minimal example, I think it is
still important enough to tell you (and
especially the Hugs writers and maintainers).
Yesterday evening, I tried to add some correct
(!) code (by-hand-verifyable; by GHC accepted;
just using plai
