Simon Peyton-Jones wrote:
(A) data RecContTest a where
Show a => C { showable :: Show a => a } :: RecContTest a
(B) data RecContTest a where
C :: Show a => { showable :: Show a => a } -> RecContTest a
What about
(A') data RecContTest a where
Show a => C { s
Josef Svenningsson wrote:
What I want to know boils down to
this: what order are processes run which have been woken up from a
call to retry?
IIUC, the order of wake up is irrelevant, since *all* the threads will
re-run the transaction in parallel. So, even if thread 1 is the first to
wake up
Roberto Zunino wrote:
(Trac reports "database locked", posting here...)
For those interested, here are the follow-ups:
http://hackage.haskell.org/trac/ghc/ticket/1723
Regards,
Zun.
___
Glasgow-haskell-users mailing list
Glasgow-has
(Trac reports "database locked", posting here...)
Here's unsafeCoerce:
> type family Const a
> type instance Const a = ()
>
> data T a where T :: a -> T (Const a)
>
> coerce :: forall a b . a -> b
> coerce x = case T x :: T (Const b) of
>T y -> y
And this indeed "works"... Here's t
currently distributed only for OS X.)
===
This is for Haskell libs, and does not affect the GMP issues in any way,
AFAICS. GMP is indeed dynamically linked in my linux system.
Regards,
Roberto Zunino.
___
Glasgow-haskell-users mailing list
Glasgow-has
Benedikt Huber wrote:
> (3) So when replacing GMP with the BN library of OpenSSL
Maybe the following license issues with OpenSSL should be taken into
account:
http://www.gnome.org/~markmc/openssl-and-the-gpl.html
Regards,
Zun.
___
Glasgow-haskell-user
Simon Peyton-Jones wrote:
[snip]
> Now you are proposing that
>
> data Bar a = MkBar (!a -> a)
> MkBar f = :MkBar (\x. x `seq` f x)
>
> I suppose you can combine the two notations:
>
> data Baz a = MkBaz !(!a -> a)
> MkBaz f = f `seq` :MkBaz (\x. x `seq` f x)
>
> In
e line.
( I do not dare to suggest modifying ghc/compiler/parser/Lexer.x as in
===
{
\n ;
"#-}"{ token ITclose_prag }
^\# (line)? { begin line_prag1 }
===
... so I'm _not_ suggesting it! ;-) )
Regards,
Roberto Zunino.
__
I noticed that GHC 6.2.2 always parse infix operators as they were
left-associative. For example:
%
Prelude> :info :
-- : is a data constructor
infixr 5 :
(:) :: forall a. a -> [a] -> [a]
Prelude> 1:2:3:[]
Parser
((1 GHC.Base.: 2) GHC.Base.: 3) GHC.Ba
using C headers is pretty much required, or, as the guide itself says,
"You're crazy not to do it". ;-)
Regards,
Roberto Zunino.
signature.asc
Description: OpenPGP digital signature
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
10 matches
Mail list logo
