Hello John,
Friday, February 03, 2006, 12:00:32 PM, you wrote:
JM If we had a good standard poll/select interface in System.IO then we
JM actually could implement a lot of concurrency as a library with no
JM (required) run-time overhead. I'd really like to see such a thing get
JM into the
I've updated the Wiki to add your strict proposal, but rather briefly.
If you want to add stuff, send it to me and I'll add it.
Meanwhile:
| And as a consequence, it is no longer possible to transform a pair of
| bindings into a binding of a pair. In Haskell 98,
|
| p1 = e1
| p2 = e2
|
Simon Peyton-Jones wrote:
I've updated the Wiki to add your strict proposal, but rather briefly.
If you want to add stuff, send it to me and I'll add it.
Meanwhile:
| And as a consequence, it is no longer possible to transform a pair of
| bindings into a binding of a pair. In Haskell 98,
|
|
On Tue, Feb 07, 2006 at 08:15:19PM +, Ben Rudiak-Gould wrote:
Simon PJ thinks that Haskell' should include scoped type variables, and I
tend to agree. But I'm unhappy with one aspect of the way they're
implemented in GHC. What I don't like is that given a signature like
x :: a - a
| I think we should do the simplest thing that could possibly work,
| and then see if we really need more. By work, I mean a compatible
| extension of H98 that makes it possible to add type signatures for
| local bindings (which isn't always possible in H98). How about:
|
| * no implicit
Robert Dockins [EMAIL PROTECTED] writes:
instance (Bin a,Bin b,Bin c,Bin d) = Bin (a,b,c,d)
See the problem? Sooner or later (probably sooner) I'll get tired of
typing. I have to write down an 'instance' declaration for each
value of n. Clearly this can't generalize to all n.
There
On Wed, Feb 08, 2006 at 12:03:54PM +0300, Bulat Ziganshin wrote:
JM If we had a good standard poll/select interface in System.IO then we
JM actually could implement a lot of concurrency as a library with no
JM (required) run-time overhead. I'd really like to see such a thing get
JM into the
Sometimes I'd like to use a smart constructor but have pattern
matching as well. There has been talk elsewhere of allowing export of
data constructors for /matching/ but not for /construction/:
module One-
data Picky a = Nil | One a
picky x = if some_complex_thing x then One x
Hello Ian,
Wednesday, February 08, 2006, 9:28:51 PM, you wrote:
nonrecursive let in Haskell so that I could write let x = ...x... in ...,
IL I would argue that the language should discourage variable shadowing, so
IL that shadow warnings can be used to find bugs.
i use such shadowing to change
