G'day all.
On Mon, Jul 07, 2003 at 11:23:59AM +0100, Simon Peyton-Jones wrote:
> The paper has a strongly tutorial flavour, and comes complete with a
> prototype implementation that you can play with.
Does the prototype implementation not support recursive lets?
*Main> tcs "let fix = (\
Dear Haskellers
For a long time now, Mark Shields and I have been writing a paper
describing GHC's approach to type inference for higher-rank types.
We've finally finished a complete draft:
Practical type inference for arbitrary-rank types
Simon Peyton Jones and Mark Shields
On Monday, 2003-07-07, 09:46, CEST, Arun Kumar S Jadhav wrote:
> Hi All,
> How to define a new unary operator.
The only unary operator in Haskell is unary minus for negating numbers. There
are no other predefined unary operators and it is not possible to define any.
So unary minus is rathe
Hi All,
How to define a new unary operator.
E.g:
I want to use "/\" for intersection over a list of sets
and similarly "\/" for union over a list of sets.
I searched haskell98 report but couldn't find any pointers. Please
let me know if it's allowed in the first place, i
