> The analogous declaration in *Standard* ML, which gets this right, is
>
> fun 'a foo (x:'a) y = (x + 1, (y:'a))
Following up my own post, I thought it might be kind to explain the
arcana of the SML syntax. The explicit 'a between 'fun' and 'foo' is
SML syntax for an explicit type-lambda (
> Regarding the quantification: in ML (OCaml) we can write
> let foo (x:'a) y = (x+1,(y:'a))
> That does not mean that foo has the type forall 'a. 'a -> 'a -> ...
Type annotations in OCaml are completely broken and always have been.
They use 'unifies with' instead of 'is an instance of' an
Sure enough -- it does. Thanks, Duncan. - Conal
On 12/7/06, Duncan Coutts <[EMAIL PROTECTED]> wrote:
On Thu, 2006-12-07 at 13:22 -0800, Conal Elliott wrote:
> Is it possible to get haddock's --prologue flag passed in through
> cabal? Is there perhaps a way to get arbitrary options passed in?
jhc does it via the simple unification type inference algorithm,
modified to push explicitly given kinds down into terms. so, pretty much
exactly the boxy type inference algorithm, where your kind inference
function looks somewhat like
> data Kind =
> Star
> | Fun Kind Kind
>
On Thu, 2006-12-07 at 13:22 -0800, Conal Elliott wrote:
> Is it possible to get haddock's --prologue flag passed in through
> cabal? Is there perhaps a way to get arbitrary options passed in?
If I recall correctly cabal already passes the description in the .cabal
file as the haddock prologue
Is it possible to get haddock's --prologue flag passed in through cabal? Is
there perhaps a way to get arbitrary options passed in?- Conal
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On 12/7/06, Chris Kuklewicz <[EMAIL PROTECTED]> wrote:
Small clarification: You don't need a safepoint in your code. But "unblock
yield" is the right code for a safepoint; the "unblock (return ())" suggested by
the published paper *does not work* in my small test, while "unblock yield"
worked eve
On 12/7/06, Chris Kuklewicz <[EMAIL PROTECTED]> wrote:
Could you add info about where to get your code (or the code) itself to the wiki
at http://haskell.org/haskellwiki/Concurrency_demos/Graceful_exit ?
OK, I did.
"unblock yield" is the right code for a safepoint
Be careful. You are rely
Cat Dancer wrote:
> I have a prospective implementation of a network accept loop with
> graceful shutdown.
>
Could you add info about where to get your code (or the code) itself to the wiki
at http://haskell.org/haskellwiki/Concurrency_demos/Graceful_exit ?
> To avoid the "unlock (return ())" i
Edsko,
Are there any papers that describe how higher kind type inference
(and I
really mean higher kind, not higher rank) is done?
I'm not aware of any specific papers (but maybe someone else can jump
in, here?), but as long as your kind language is simple enough, say
k, v ::= *
Hi,
Are there any papers that describe how higher kind type inference (and I
really mean higher kind, not higher rank) is done?
Thanks,
Edsko
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
11 matches
Mail list logo
