I just noticed that the GHC trac was moved to
http://ghc.haskell.org/trac/ghc/ and I cannot login with my old
credentials. Were the old accounts transferred to the new trac? Also,
the registration page [1] does not work.
[1] http://ghc.haskell.org/trac/ghc/register
___
On Jul 6, 2013, at 03:07 , Kiwamu Okabe wrote:
> Umm... Is your question "Is Ajhc's goal that build the compiler for Android"?
> If so, the answer is No.
> The Ajhc's goal is that find the compiler to rewrite the NetBSD kernel
> with Haskell.
>
> But you can do support Android.
> I think porting
Any plans on supporting the popular Raspberry Pi platform? I poked at the
source code a bit, but I didn't even know where to begin.
- jeremy
On Fri, Jul 5, 2013 at 11:01 PM, Kiwamu Okabe wrote:
> We are happy to announce Ajhc 0.8.0.7.
> You can program interrupt handler with Haskell language o
On Fri, Jul 5, 2013 at 11:03 PM, Ömer Sinan Ağacan wrote:
> There's an implicit quantifier in type of `f`, like this: `f :: forall
> a. a -> ListF a a`. When I add `ScopedTypeVariables` and `forall a.
> ...` in top level definition, it's like all `a`s in scope of top level
> definition are same, e
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 08/07/13 19:50, Chaddaï Fouché wrote:
> On Fri, Jul 5, 2013 at 11:03 PM, Ömer Sinan A?acan
> wrote:
>
>> There's an implicit quantifier in type of `f`, like this: `f ::
>> forall a. a -> ListF a a`. When I add `ScopedTypeVariables` and
>> `forall a
So I've been thinking about something, and I'm curious whether anyone
(in particular, people involved with GHC) think this is a worthwhile
idea.
I'd like to implement an extension to GHC to offer a different
behavior for literals with polymorphic types. The current behavior is
something like:
1.
Oops, when I wrote this, I'd assumed it was possible to export
defaults from a module, like an alternate Prelude. But it looks like
they only affect the current module. So this whole thing depends on
also being able to either define defaults in an imported module, or in
options to GHC.
On Mon, J
Hi Fredrik,
First, do you use the latest parsec version (3.1.3)? If not, can you try
the same with 3.1.3?
Second, please upload your code to hpaste.org or a similar service and
give us the link. It's not much fun to extract code from an html email.
Roman
* Fredrik Karlsson [2013-07-08 23:54:17
I just fixed a fairly serious performance problem with postgresql-libpq's
binding to PQescapeStringConn; in was exhibiting a non-linear slowdown
when more strings are escaped and retained.
https://github.com/lpsmith/postgresql-libpq/commit/adf32ff26cdeca0a12fa59653b49c87198acc9ae
If you are usi
On Mon, Jul 8, 2013 at 9:03 PM, Leon Smith wrote:
> I just fixed a fairly serious performance problem with postgresql-libpq's
> binding to PQescapeStringConn; in was exhibiting a non-linear slowdown
> when more strings are escaped and retained.
>
I'd like to point out a somewhat related bottl
Hi everybody!
I am trying to solve the question for a long time:
[*4.12 Harder] Find out the maximum number of pieces we can get by making a
given*
*number of flat (that is planar) cuts through a solid block. It is not the
same*
*answer as we calculated for straight-line cuts of a flat piece of p
I'll have to benchmark withMVar on my system, but (at least on my old
laptop) a safe foreign function call is also on the order of 100ns. As
c_PQescapeStringConn and c_PQescapeByteaConn are currently safe calls,
that would limit the maximum time saved at ~50%.
Perhaps it would make sense to mak
Brian, I think it would be better to provide your email in the thread. E.g.
from http://www.haskell.org/pipermail/haskell-cafe/2013-July/109061.html I
can only reply to the maillist. I'm answering now through Google Groups
hope it will get to you.
Kind regards,
Kirill Zaborsky
воскресенье, 7 и
Hi Roman,
I'm using parsec-3.1.3
I put the code in a gist here - sorry about that.
https://gist.github.com/dargosch/5955045
Fredrik
On Tue, Jul 9, 2013 at 12:08 AM, Roman Cheplyaka wrote:
> Hi Fredrik,
>
> First, do you use the latest parsec version (3.1.3)? If not, can you try
> the same
14 matches
Mail list logo
