Hello,
with a large Agda development, I have a reproducible segmentation fault
that I have been able to localise to the serialisation
(Agda.TypeChecking.Serialise.encode), which heavily relies on Data.HashTable.
Now I find that Data.HashTable (from GHC-7.0.1) has a CPP-enabled DEBUG version
I am not certain, but this may be the same problem that I once had,
and that was solved by updating to binutils-2.20.
ld --version
GNU ld (GNU Binutils) 2.20.1.20100303
Wolfram
On Fri, Feb 18, 2011 at 11:34:03AM +0100, José Pedro Magalhães wrote:
Hi all,
I'm getting the same error as
Wojciech Moczydlowski, Jr [EMAIL PROTECTED] (Khaliff TM) wrote:
The second question - does anybody know about a GHC/Haskell library with
graphs implementation?
Depending on what precisely you need, Martin Erwig's
``Functional Graph Library'' might contain something useful for you:
Simon Peyton-Jones [EMAIL PROTECTED] writes:
| elegant. If MVar's were instances of Ord as well as Eq, a
| neat solution would
| be to always get the least MVar first, but they aren't. So
| what should one do?
But you could make Flag an instance of Ord
data Flag =
Simon Peyton-Jones [EMAIL PROTECTED] answers my question:
| This is something that I have long been wondering about
| (perhaps it is just because of my ignorance):
| Wouldn't stable pointers be a cheaper and more appropriate means
| to get Ord for MVars, STRefs, and IORefs?
Could
On Sat, Dec 31, 2011 at 11:43:26PM +0200, Yitzchak Gale wrote:
Serge D. Mechveliani wrote:
I have ghc-7.4.0.20111219 made from source and tested it on the
DoCon-2.12 application -- thanks to people for their help!
It looks all right.
This was -- with skipping the module Random
Now it
guards''
Best wishes,
Wolfram
-
@InProceedings{Kahl-2004a,
author = {Wolfram Kahl},
title ={Basic Pattern Matching Calculi: A Fresh View on Matching
Failure},
crossref = {FLOPS2004},
pages ={276--290},
DOI
During one of my long Agda runs (with GHC-7.4.2), I observed the following
output, with run-time options
+RTS -S -H11G -M11G -K256M
:
7694558208 30623864 3833166176 0.11 0.11 234.75 234.7900 (Gen: 0)
7678904688 29295168 3847737784 0.11 0.11 242.04 242.0900 (Gen:
On Thu, Feb 14, 2013 at 03:48:51PM +0100, Joachim Breitner wrote:
Yesterday, I experimented a bit with base’s code, [...]
Maybe the proper is to reverse the whole approach: Leave base as it is,
and then build re-exporting smaller packages (e.g. a base-pure) on top
of it. The advantage is:
On Sat, Aug 01, 2015 at 06:31:38AM +1000, Erik de Castro Lopo wrote:
I maintaing multiple versions of GHC on all the machines I use regularly
for Haskell development. I have:
* ghc-7.6.3 installed under /usr/lib/ghc-7.6/
* ghc-7.8.4 installed under /usr/lib/ghc-7.8/
* ghc-7.10.2 installed
Cher Sébastien,
> Thanks. Unfortunately, the paper has been written in French.
No need to add ``Unfortunately''... ;-)
> Will come back with a link ASAP!
I guess that many will agree with my opinion:
Links to French papers are welcome, too!
Amicalement,
Wolfram
11 matches
Mail list logo
