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
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
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:
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:
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
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
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
On Tue, Feb 01, 2011 at 06:01:04PM +0300, Pavel Perikov wrote:
If anyone interested...
Agda-2.2.9 compiled perfectly with 7.0.1 release but with 7.1.20110131 the
compiler had a few problems including impossible happened when building
profiling library.
Possibly related:
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
have a tool that mechanises this instance generation,
available at:
http://sqrl.mcmaster.ca/~kahl/Haskell/ModuleTools/
More about this in the forthcoming TFP 2009 proceedings paper:
@InCollection{Kahl-2009_TFP,
author = {Wolfram Kahl},
title ={Haskell Module Tools
On Sat, Dec 12, 2009 at 05:30:44AM +0200, Thanos Tsouanas wrote:
Up to now I've only used binary versions of GHC, but since
my operating system's (OpenBSD) version of GHC is
lagging behind (currently at 6.6.1), I need to update it.
I tried using my system's ghc-6.6.1 to compile ghc-6.10.4
Simon Peyton Jones answered me:
| do { a - getChar
|; rec { b - f c
| ; c - g b }
|; putChar c
|; return b }
| This last point notwithstanding,
| I find the scoping rules very unintuitive!
| (b and c appear to escape their apparently
Simon Peyton Jones wrote:
Recursive do-notation.
~~
The change is this. Instead of writing
mdo { a - getChar
; b - f c
; c - g b
; putChar c
; return b }
you would write
do { a - getChar
; rec { b - f c
Simon Peyton Jones wrote:
What is the info for an instance?
Do we need a way to ask for all the instances of a class
(or rules for a function)
regardless of what module those instances come from? etc
Does this ring bells for anyone else?
It does --- but completely outside the
Duncan Coutts wrote:
Sadly not because portage is not clever enough to deal with the kind of
dependencies you end up with by doing that. Portage does not know that
some libs are installed for one ghc and some for another, so it'd try
and satisfy a dependency for mtl using the mtl you'd
Duncan Coutts wrote:
We could slot multiple versions of a lib for the same ghc, but not slot
ghc itself.
Why not library slots named
ghc-6.4
ghc-6.6
ghc-6.8
(or finer), each depending on the repective compiler slot?
The different slots of gtk+ also
It would also be nice to have the
case issue with Mac OS X document, as recent file systems have been
case-insensitive for a while.
Just a quick note: At Mac OS X install time
(or other file system creation time)
you can choose case sensitivity for HPFS+
(the default file system on Mac OS
You do not perchance have one for powerpc, do you? I attempted to
bootstrap from GHC 6.6.1, but I keep getting errors about Illegal
Instructions,
Try to force
./configure --build=powerpc-mac-darwin
or whatever is appropriate under MacOS ---
without it, ./configure will identify the
| Illegal signature in pattern: a
| Use -XPatternSigs to permit it
|
I am very happy to see
that it doesn't recommend -fglasgow-exts anymore!
However, I still would prefer
Use LANGUAGE pragma with extension ``PatternSigs'' to permit it
since it points out even more
Has anyone successfully built it on ppc64 yet? The latest build I can
find in a distro is ghc-6.4.2 in gentoo. Has anyone tried ghc [6.6.1] on
ppc64?
I have a gentoo binary package built some time ago from the
gentoo ebuild for 6.6.1:
http://sqrl.mcmaster.ca/~kahl/Haskell/ghc
Adrian Hey wrote:
Duncan Coutts wrote:
One might hope that in this case we could hoist the extraction of the
dictionary members outside the inner loop.
This possibility had crossed my mind too. If HOFs really are faster
(for whatever reason) then it should be possible for a
6.4 and 6.4.1: When repeating a build (with ghc --make) all modules
are rebuild even if nothing has changed. With earlier compilers,
only linking takes place in this setting. Can I change this
behaviour? I cannot develop this way.
Should not happen, if it does there
Nicole Gabler [EMAIL PROTECTED] wrote:
During runtime I want the program to output =
information about the status every time another file is parsed. That =
doesn't work, the output appears much later, mostly not until end of =
program. But I need these outputs at that specific time, so what
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
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:
26 matches
Mail list logo
