Using old code generator

Hi, I'm looking for a workaround for #7574 [1] (I run into it when trying to build the 'statistics' package with profiling enabled with GHC HEAD.) The symptom is ghc-stage2: panic! (the 'impossible' happened) (GHC version 7.7.20130407 for i386-unknown-linux): allocateRegsAndSpill:

RE: Using old code generator

I believe that the old codegen is gone altogether. Please add to the ticket to say that it blocks compilation of a particular package (with instructions for how to reproduce). Is this an important package? Someone should just fix the codegen! Any volunteers? Simon left some breadcrumbs and

Re: Using old code generator

Thanks Simon. 'statistics' is needed for criterion (the benchmarking tool), so yes, I'd say it's important. I'll add more information to the ticket later today. Roman * Simon Peyton-Jones simo...@microsoft.com [2013-04-12 10:32:36+] I believe that the old codegen is gone altogether.

[Haskell] Foundations of Health Information Engineering and Systems (FHIES 2013) - final call for papers

CALL FOR PAPERS Third International Symposium on Foundations of Health Information Engineering and Systems http://www.cs.ox.ac.uk/FHIES2013/ International Institute for Software Technology United Nations University, Macau 21st-23rd August, 2013 BACKGROUND ICT plays an increasingly enabling

[Haskell-cafe] unsafeInterleaveST (and IO) is really unsafe

Timon Gehr wrote: I am not sure that the two statements are equivalent. Above you say that the context distinguishes x == y from y == x and below you say that it distinguishes them in one possible run. I guess this is a terminological problem. The phrase `context distinguishes e1 and e2' is

Re: [Haskell-cafe] unsafeInterleaveST (and IO) is really unsafe [was: meaning of referential transparency]

Lazy I/O *sounds* safe. And most of the alternatives (like conduits) hurt my head, so it is really *really* tempting to stay with lazy I/O and think I'm doing something safe. Well, conduit was created for the sake of a web framework. I think all web frameworks, in whatever language, are

Re: [Haskell-cafe] Set monad

One problem with such monad implementations is efficiency. Let's define step :: (MonadPlus m) = Int - m Int step i = choose [i, i + 1] -- repeated application of step on 0: stepN :: (Monad m) = Int - m (S.Set Int) stepN = runSet . f where f 0 = return 0

Re: [Haskell-cafe] I would like to know how to use the following events handlers : dropTargetOnData, dropTargetOnDrop, dropTargetOnEnter,

If you have figured it all out, I hope you want to write a HaskellWiki page about it. If I pass the gating, I ll publish a kind some HowTo on the differente techniques I dig out already started with this one, where I published my finding in the answer:

Re: [Haskell-cafe] unsafeInterleaveST (and IO) is really unsafe [was: meaning of referential transparency]

On Fri, Apr 12, 2013 at 1:44 AM, o...@okmij.org wrote: As to alternatives -- this is may be the issue of familiarity or the availability of a nice library of combinators. It is certainly not just a matter of familiarity, nor availability. Rather, it's a matter of the number of names that are

Re: [Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority queue implementations

I actually found a (potential) problem with the GHC implementation. See here: https://github.com/nh2/psqueue-benchmarks/blob/db89731c5b4bdd2ff2ef81022a65f894036d8453/QueueBenchmark.hs#L44 If I fromList 100 entries into the queue, it stack space overflows. I got the same problem with the

[Haskell-cafe] Warsaw Haskell Group

Hello! We are organizing a group of Haskell fans from Warsaw, Poland. So far we have set up a community on G+ (https://plus.google.com/u/0/communities/103183708602453146804), a mailing list is on the way. We would like to meet regularly someplace in the capital (we still decide where), and

Re: [Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority queue implementations

Does not compiles under ghc 7.6.2 Date: Sat, 13 Apr 2013 11:09:13 +0800 From: m...@nh2.me To: k...@iij.ad.jp CC: haskell-cafe@haskell.org Subject: Re: [Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority queue implementations I actually found a (potential) problem with the GHC

[Haskell-cafe] GSoC proposal: Data Visualization

Dear Haskell Community, During the last months I used Haskell for machine learning, particularly in the field of Echo State Neural Networks. The main drawback I encountered is that its difficult to visualize and plot data in Haskell in spite the fact there are a couple of plotting libraries. Data

Re: [Haskell-cafe] Will Haskell Platform 2012.4.0.0 uninstall cleanly for the installation of 2013.2.0.0

On Fri, 12 Apr 2013 00:42:15 +0200, KC kc1...@gmail.com wrote: :) You don't really need to uninstall the platform, unless your disk is running out of space; just change your search path (that's actually done automatically at installation time). If you keep the old platform, you can test

Re: [Haskell-cafe] GSoC proposal: Data Visualization

Hello Ernesto, There are a number of efforts underway to provide better data vis libraries for haskell. Likewise, there was some recent discussion on the Diagrams mailing list about data vis tooling, and there should be a few interesting tools surfacing over the coming few months. My immediate

Re: [Haskell-cafe] unsafeInterleaveST (and IO) is really unsafe

On 04/12/2013 10:24 AM, o...@okmij.org wrote: Timon Gehr wrote: I am not sure that the two statements are equivalent. Above you say that the context distinguishes x == y from y == x and below you say that it distinguishes them in one possible run. I guess this is a terminological problem.

[Haskell-cafe] Building the Haskell Platform in Linux

Hi cafe! Probably you all know how to do this, but I myself found confused when building the Haskell Platform in Linux for my first time. I was using Linux for my first time too! The first problem I encountered was to decide what linux packages install to make the ./configure successful in both

Re: [Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority queue implementations

Hi, See here: https://github.com/nh2/psqueue-benchmarks/blob/db89731c5b4bdd2ff2ef81022a65f894036d8453/QueueBenchmark.hs#L44 If I fromList 100 entries into the queue, it stack space overflows. Are you sure that this is a bug of GHC PSQ? I think that replicateM _GHC_CRASH_N causes