Hello,
thank you for the idea of using variables directly to see what happens.
This is really a simplification for the proof.
At first I thought that there should be a simpler solution and I tried to
modify your approach, so that it applies to >>= as well, but now I am
convinced :-) I have downloa
Naturally, there are many great resources for this at www.haskell.org
Ensure you check out both Alex and Happy for the parsing and sourcing.
(note that Alex is currently being re-written, I'm not sure if the latest
public version has the new format/syntax)
Also, there are a variety of compiler he
Brett G. Giles wrote:
Naturally, there are many great resources for this at www.haskell.org
Ensure you check out both Alex and Happy for the parsing and sourcing.
(note that Alex is currently being re-written, I'm not sure if the latest
public version has the new format/syntax)
I think, parsing (i
I use Haskell and Wash/CGI for administering students lab work. Students
solve programming exercises in pairs, register their pair, and upload
their solution over the web. The pair gets a "home page" on which they can
see their grade and comments from their tutor, and also submit new
solutions if
On Thu, 4 Sep 2003, John Hughes wrote:
> I wrote the system for my (Haskell!) programming course, with 170 students
> last year, and it is now also being used (at least) for our Java course
> and a cryptography course. It consists of about 600 lines of Haskell and
> 18 lines of C.
Just curious. W
Hi,
I wonder why Haskell only allows the unary minus on the left side of an
expression ("lexp" in the grammar).
There should be no problem to uniquely recognize an unary minus right
beside an operation symbol ("qop"). Does the grammar allow two
consecutive qops in other cases?
This would allo
OK, this is an issue I have raised before I think, but I don't remember
what the opinion on it was. The following doesn't compile with ghc
-fglasgow-exts (or Hugs -98):
-- ghc -fglasgow-exts -c TypeLambda.hs
module TypeLambda where
{
class Fc a b | a -> b;
instance Fc Bool Int;
Hello!
> Would it be possible to write a piece of Haskell code which checks
> the monadic laws automatically by simulating evaluation in this way?
To some extent, yes. The proof in the previous message was based on
normalization, with respect to associative laws and some betas. So we
can take
