On Sun, Feb 05, 2006 at 01:21:08AM +0100, Benjamin Franksen wrote:
We don't have any problems with ensuring good cooperation between
mutable variables and concurrency synchronisation primitives, because
the language doesn't have mutable variables, they are delivered in
the concurrency
On 2006-02-04 at 16:08EST Cale Gibbard wrote:
cartesian xs ys = map (\[x,y] - (x,y)) $ sequence [xs,ys]
I'm lost. Isn't that just like
cartesian xs ys = [(x,y)|x-xs, y-ys]
?
Whereas...
On 04/02/06, Jan-Willem Maessen [EMAIL PROTECTED] wrote:
On Feb 4, 2006, at 1:31 PM, Jon Fairbairn wrote:
On Sun, Feb 05, 2006 at 12:50:16AM +0300, Bulat Ziganshin wrote:
Hello Tomasz,
Saturday, February 04, 2006, 11:18:47 PM, you wrote:
TZ I don't use parallel list comprehensions. I am also zipping trees,
TZ and PLCs don't help me here.
making `zip` a class function should please you :)
Here's a random idea that popped into my head. There have been a few
discussions about unicode support in Haskell'. One of the particular
places this is useful would appear to be type signatures, I was
considering that it would be particularly neat to be able to
represent tuples as cross
Have we considered Restricted Data Types?
http://www.cs.chalmers.se/~rjmh/Papers/restricted-datatypes.ps
Or even absracting over contexts, as described in section 7.5 (p.
14/15) of the above?
Jim
___
Haskell-prime mailing list
Marcin 'Qrczak' Kowalczyk wrote:
Encouraged by Mono, for my language Kogut I adopted a hack that
Unicode people hate: the possibility to use a modified UTF-8 variant
where byte sequences which are illegal in UTF-8 are decoded into
U+ followed by another character.
I don't like the idea of
On 05/02/06, Bulat Ziganshin [EMAIL PROTECTED] wrote:
Hello Tomasz,
Sunday, February 05, 2006, 2:45:44 PM, you wrote:
We don't have any problems with ensuring good cooperation between
mutable variables and concurrency synchronisation primitives, because
the language doesn't have
