s admittedly introduce a new
> complication
>
> How should this be clarified?
>
For me, "existentially-bound variables are rigid" works well enough.
They're a somewhat non-obvious case of 'coming from an annotation'
though, and it does warrant
On Wed, 20 Aug 2008, Claus Reinke wrote:
> I seem to be unable to join the ghc chatroom at irc.freenode.net
> at the moment (using Opera). Is that an issue with my irc client or a general
> problem?
>
> 15:47 Joining chat room...
> Disconnected from chat
>
It's probably on your end one way or
On Mon, 18 Feb 2008, TOPE KAREM wrote:
> Hello everyone,
>
> I am just learning to program in Haskell, and I found recursion very
> interesting.
> However, I need to write a recursive function over two lists.
>
> The function must check the elements in the two lists and return an
> element t
On Wed, 5 Dec 2007, Simon Peyton-Jones wrote:
> Nothing deep. Just that "=" means so many things that it seemed better
> to use a different notation.
>
How about ==? Only one meaning so far, and that both on the term level and
equivalent to the constraint.
--
[EMAIL PROTECTED]
Ivanova is a
On Mon, 17 Sep 2007, Neil Mitchell wrote:
> Hi
>
> > case e of b { pati -> rhsi }
> >
> > * evaluates 'e',
> > * binds the resulting value to 'b',
> > * performs case analysis on the result to find which alternative to choose
> > * binds the variables of the pattern to the components of the value
