How about this? Don't say Santa never comes:
Foo.hs:5:
Ambiguous type variable(s) `a' in the constraint `Eq a'
arising from use of `==' at Foo.hs:5
In the first argument of `', namely `(b == b)'
In a guard for an equation for `example': (b == b) (a == a)
-Original
I've put up a binary distribution of 4.04pl1 for hppa1.1-hp-hpux, available
from the usual place.
Simon
Hi Folks,
I've updated the 4.04 distributions on the web site to patchlevel 1. Please
install the new version if you're using the original 4.04, since it contains
a fix for at least one bug that could cause spurious crashes.
Also in this update:
- several bug fixes
- gcc 2.95
On Wed, 15 Sep 1999, George Russell wrote:
Re parser combinators. I think I was obviously too rude about
these, because of my previous bad experience. Naively it seems
to me that there is a trade-off. I am not prepared to settle
for anything less than having my grammar statically checked
George Russell wrote:
[...] So far we've established that Happy is unnecessarily slow.
To be convinced about that, I still need to see some correct figures:
* Detailed timing how long *parsing* Haskell with the Happy
generated parser needs (excluding the time for lexing and
the
Simon Marlow wrote:
[snip]
Hmm, you're probably doing a large chunk of renaming too. I just added an
error call right after the parser in Main.lhs.
The MLj parser/lexer doesn't actually rename, but it does tokenise all
identifiers in the lexer. Symbols already known aren't even copied out of
Simon Marlow writes:
That should be http:\\www.cs.uu.nl\groups\ST\Software\Parse, I
think.
Hey, I just grabbed the link reference from his file :-).
"blazingly fast" isn't very useful. Show me the NUMBERS :-)
Well, my Rosetta grammer wouldn't be very useful. Grab them yourself,
or
