Should be fixed now. The wiki was recently transferred to a new server and
this got unfortunately broken in the process.
On 18 Jul 2013 22:45, Henk-Jan van Tuyl hjgt...@chello.nl wrote:
L.S.,
It looks like the HaskellWiki images have disappeared; can anybody repair
this? (See for example
There are quite a lot of dependencies between different parts of the AST.
The renamer takes the whole parser output and then discovers its
dependencies. After that you can split things into smaller units
based on this dependency graph.
The renamer and type checker do not necessarily need to be
[I'll be the mentor for this GSoC project.]
I used the MVar approach a while ago and so did Simon Marlow's
original solution. Using MVars and Threads for this should scale well
enough (1000s of modules) and be relatively straightforward.
Error/exception handling could be a bit tricky, but you
To have a single-process ghc --make -j you first of all need internal
thread-safety:
GHC internally keeps a number of global caches that need to be made thread-safe:
- table of interned strings (this is actually written in C and
accessed via FFI)
- cache of interface files loaded, these are
Sounds similar to the bug we had in 6.12.1. It was a simple
accounting bug, i.e., the GC was not invoked, because it didn't know
that the memory was allocated.
On 20 April 2013 22:03, Edward Z. Yang ezy...@mit.edu wrote:
I don't seem to get the leak on latest GHC head. Running the program
in
On 21 December 2012 11:16, Joachim Breitner m...@joachim-breitner.de wrote:
Prelude :script /home/jojo/.cabal/share/ghc-heap-view-0.4.0.0/ghci
Prelude let x = [1..10]
Prelude x
[1,2,3,4,5,6,7,8,9,10]
Prelude :printHeap x
_bh [S# 1,S# 2,S# 3,S# 4,S# 5,S# 6,S# 7,S# 8,S# 9,S# 10]
Note that
Yes, Criterion always discards the time of the first evaluation.
On 18 October 2012 15:06, Janek S. fremenz...@poczta.onet.pl wrote:
So the evaluation will be included in the benchmark, but if bench is
doing enough trials it will be statistical noise.
When I intentionally delayed my dataBuild
On 18 October 2012 13:15, Janek S. fremenz...@poczta.onet.pl wrote:
Something like this might work, not sure what the canonical way is.
(...)
This is basically the same as the answer I was given on SO. My concerns about
this solutions are:
- rnf requires its parameter to belong to NFData
Just to explain what's going on. It looks like you are compiling a
module that uses template haskell, which in turn relies on GHCi bits.
In particular, GHCi has a custom linker for loading compiled code.
This linker is very fragile and tends to break whenever the platform
GCC/linker changes.
Does `ghc-pkg check` report any issues?
On 6 October 2012 15:24, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Hi,
I am installing postgres hackage (cannot remember the exact name
right now). When it compiling the template haskell part I got the
following error message.
I
It's a wiki. I went ahead and fixed it, this time.
To paraphrase Bryan O'Sullivan: Whenever you think why hasn't anyone done
..., or why doesn't somebody fix ..., you should ask yourself Why don't
*I* do ... or Why don't *I* fix That's how open source works.
(Not trying to be offensive,
On 30 August 2012 09:34, Joachim Breitner breit...@kit.edu wrote:
but from a first glance it seems that you are not using that part of GHC
in your project, right?
No, I don't think I can make use of your work directly. Lambdachine uses
GHC up until the CorePrep phase (the last phase before
On 29 August 2012 15:21, Joachim Breitner breit...@kit.edu wrote:
Hi Facundo,
Am Mittwoch, den 29.08.2012, 10:26 -0300 schrieb Facundo Domínguez:
upd_noupd n =
let l = myenum' 0 n
in last l + length l
This could be rewritten as
My thoughts on the matter got a little long, so I posted them here:
http://nominolo.blogspot.co.uk/2012/08/beyond-package-version-policies.html
On 17 August 2012 12:48, Heinrich Apfelmus apfel...@quantentunnel.dewrote:
Brent Yorgey wrote:
Yitzchak Gale wrote:
For actively maintained
You may concatenate the licenses of all the packages you are using. GHC
includes the LGPL libgmp. The license file for each package is mentioned in
the .cabal file.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
GHC does not provide any form of real-time guarantees (and support for
them is not planned).
That said, it's not as bad as it sounds:
- Collecting the first (young) generation is fast and you can control
the size of that first generation via runtime system (RTS) options.
- The older
On 27 July 2012 14:52, Marco Túlio Gontijo e Silva
marcotmar...@gmail.com wrote:
thread blocked indefinitely in an MVar operation
IIRC, that means that a thread is blocked on an MVar and the MVar is
only reachable by that thread. You said you tried adding NOINLINE,
which is usually required for
On 17 July 2012 20:45, tsuraan tsur...@gmail.com wrote:
Is there anything in Criterion that allows for a benchmark to run some
code before or after the thing that it's timing? As an example, I'd
like to time a bunch of database inserts, but beforehand I want to
create the target table, and
I think you should ask this question on the glasgow-haskell-users
mailing list: http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
On 10 July 2012 18:20, Nicolas Trangez nico...@incubaid.com wrote:
All,
While working on my vector-simd library, I noticed somehow memory I'm
using
It's described in Andy Gill's PhD thesis (which describes the
foldr/build fusion).
http://ittc.ku.edu/~andygill/paper.php?label=GillPhD96 Section 4.4
describes the basic ideas. There aren't any further details, though.
Max's Strict Core paper also describes it a bit (Section 6):
Bryan, do you remember what the issue is with C++ in this case? I
thought, adding a wrapper with extern C definitions should do the
trick for simpler libraries (as this one seems to be). Is the
interaction with the memory allocator the issue? Linker flags?
On 11 June 2012 06:38, Bryan
On 8 June 2012 01:39, Andrew Myers asm...@gmail.com wrote:
Hi Cafe,
I'm working on inspecting some data that I'm trying to represent as records
in Haskell and seeing about twice the memory footprint than I was
expecting.
That is to be expected in a garbage-collected language. If your
program
On 29 March 2012 22:03, Sjoerd Visscher sjo...@w3future.com wrote:
Some more bikeshedding:
Perhaps ffor, as in
ffor = flip fmap
or perhaps
infixr 0 $$
($$) = flip ($)
xs $$ \x - ...
I don't think it makes sense to add a whole new operator for that.
You can just use
On 26 March 2012 13:29, Christian Siefkes christ...@siefkes.net wrote:
On 03/26/2012 01:26 PM, Gabriel Dos Reis wrote:
It is not the precision of Char or char that is the issue here.
It has been clarified at several points that Char is not a Unicode character,
but a Unicode code point. Not
On 24 March 2012 12:53, Henrik Nilsson n...@cs.nott.ac.uk wrote:
Hi all,
Thomas Schilling wrote:
I think most here agree that the main advantage of the current
definition is only pedagogical.
But that in itself is not a small deal. In fact, it's a pretty
major advantage.
Moreover
On 24 March 2012 20:16, Ian Lynagh ig...@earth.li wrote:
Hi Johan,
On Sat, Mar 24, 2012 at 11:50:10AM -0700, Johan Tibell wrote:
On Sat, Mar 24, 2012 at 12:39 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Which brings me to the fundamental question behind this proposal: Why do we
On 24 March 2012 22:27, Ian Lynagh ig...@earth.li wrote:
On Sat, Mar 24, 2012 at 05:31:48PM -0400, Brandon Allbery wrote:
On Sat, Mar 24, 2012 at 16:16, Ian Lynagh ig...@earth.li wrote:
On Sat, Mar 24, 2012 at 11:50:10AM -0700, Johan Tibell wrote:
Using list-based operations on Strings are
On 24 March 2012 22:15, Ian Lynagh ig...@earth.li wrote:
On Sat, Mar 24, 2012 at 08:38:23PM +, Thomas Schilling wrote:
On 24 March 2012 20:16, Ian Lynagh ig...@earth.li wrote:
Correctness
==
Using list-based operations on Strings are almost always wrong
Data.Text
If you're not otherwise attached to MacPorts, you might want to check
out Homebrew [1]. Its integration with the rest of OS X is generally
more smoothly and I haven't come across any missing packages yet.
[1]: http://mxcl.github.com/homebrew/
On 22 March 2012 16:34, Warren Harris
On 18 March 2012 19:29, ARJANEN Loïc Jean David arjanen.l...@gmail.com wrote:
Good point, but rather than specifying in the standard that the new string
type should be the Text datatype, maybe the new definition should be that
String is a newtype with suitable operations defined on it, and
I don't understand this discussion. He explicitly said If you are
willing to depend on a recent version of base. More precisely, he
meant GHC 7.4 which includes the latest version of base. Yes, this is
incompatible with the Haskell2010 standard, but it did go through the
library submission
That will give you the wrong answer for an expression like:
(let x = 1 in x + y) + x
Unless you do a renaming pass first, you will end up both with a bound
x and a free x.
On 25 February 2012 16:29, Sjoerd Visscher sjo...@w3future.com wrote:
On Feb 24, 2012, at 10:09 PM, Stephen Tetley
,x],[])
I.e. free variables y and x, no bound variables. Is that not correct?
Sjoerd
On Feb 25, 2012, at 7:15 PM, Thomas Schilling wrote:
That will give you the wrong answer for an expression like:
(let x = 1 in x + y) + x
Unless you do a renaming pass first, you will end up both
On 15 February 2012 16:17, Dan Maftei ninestrayc...@gmail.com wrote:
1 When profiling my code with -auto-all, my .prof file names some
sub-expressions with a backslash. Cf. below. What are these?
e_step
e_step.ewords
e_step.\
e_step.\.\
It's usually the (potential) mentors who do the rating. I know we did that
two years ago; can't remember last year, though.
On 13 February 2012 23:45, Greg Weber g...@gregweber.info wrote:
http://hackage.haskell.org/trac/summer-of-code/report/1
There is a column 'Priority'. And there are now
On 26 January 2012 09:24, Christopher Brown cm...@st-andrews.ac.uk wrote:
Hi Thomas,
By static semantics I mean use and bind locations for every name in the
AST.
Right, that's what the renamer does in GHC. The GHC AST is parameterised
over the type of identifiers used. The three different
, 2012 at 2:31 PM, Thomas Schilling
nomin...@googlemail.com wrote:
On 26 January 2012 09:24, Christopher Brown cm...@st-andrews.ac.uk
wrote:
Hi Thomas,
By static semantics I mean use and bind locations for every name in the
AST.
Right, that's what the renamer does in GHC
I assume by static semantics you mean the renamed Haskell source code.
Due to template Haskell it (currently) is not possible to run the
renamer and type checker separately. Note that the type checker
output is very different in shape from the renamed output. The
renamed output mostly follows
wrote:
On Tue, Jan 10, 2012 at 9:25 AM, Steve Horne
sh006d3...@blueyonder.co.uk wrote:
Also, what papers should I read? Am I on the right lines with the ones I've
mentioned above?
Thomas Schilling gave you a good response with papers so I will give
you a different perspective on where
Based on your stated background, the best start would be the (longer)
paper on the Spineless Tagless G-machine [1]. It describes how graph
reduction is actually implemented efficiently. Since then there have
been two major changes to this basic implementation: Use of eval/apply
(a different
On 17 December 2011 05:39, Gregory Crosswhite gcrosswh...@gmail.com wrote:
On Dec 17, 2011, at 9:58 AM, Thomas Schilling wrote:
Wll... I've gotten a little bit of a different perspective on this
since working at a company with very high code quality standards (at
least for new code
On 16 December 2011 11:10, Ganesh Sittampalam gan...@earth.li wrote:
On 16/12/2011 10:59, Giovanni Tirloni wrote:
On Fri, Dec 16, 2011 at 7:08 AM, Ganesh Sittampalam gan...@earth.li
mailto:gan...@earth.li wrote:
Q: If an umbrella non-profit organisation The Haskell Foundation was
On 16 December 2011 13:36, Ganesh Sittampalam gan...@earth.li wrote:
Would a donation to haskell.org include a fee to SPI? I couldn't find
any information on their website.
Yes - 5% goes to SPI to cover their overheads. It's detailed in
On 16 December 2011 17:44, Niklas Broberg niklas.brob...@gmail.com wrote:
With all due respect, the sentiments you give voice to here are a large part
of what drives me to do this project in the first place. Haskell is not GHC,
and I think that the very dominant position of GHC many times leads
On 15 December 2011 06:29, Chris Wong chrisyco+haskell-c...@gmail.com wrote:
class (Applicative f, Monoid f) = Alternative f where
-- | Keep repeating the action (consuming its values) until it
fails, and then return the values consumed.
I think this should be collect rather than consume
What exactly are the hopes for such a type checker? I can understand
it being interesting as a research project, but as a realistic tools
there are two huge issues:
1. It's going to take a LOT of time to reach feature parity with
GHC's type checker.
2. Assuming that can be done, how is it
May I ask what the problem is you're trying to solve?
If you want to access datafiles in an installed program then Cabal can
help you with that. See
http://www.haskell.org/cabal/users-guide/#accessing-data-files-from-package-code
If you want to do more complicated things, maybe take a look at
On 12 December 2011 22:39, Antoine Latter aslat...@gmail.com wrote:
But now they look as if they are of equal importance with the other
class methods, which is not really true.
Maybe, but something like this is best fixed by improving
documentation, not by shuffling things around and needlessly
I would be interested in what the hold-up is with the two Cabal
projects. Does the work need more clean-up or is it just stuck in the
Duncan-code-review pipeline? If Duncan is indeed the bottleneck,
maybe we should look into ways of taking some of the work off Duncan.
On 11 December 2011 02:57,
On 21 November 2011 17:34, Brandon Allbery allber...@gmail.com wrote:
Haddock carries the same license as GHC.
More to the point, Haddock uses ghc internals these days; it's not just a
matter of bundling, and the licenses *must* be compatible.
No. If the haddock library any program that
Chalmers University in Gothenburg, Sweden has a master's programme
that includes a compiler construction course. For the lectures from
last term, see:
http://www.cse.chalmers.se/edu/course/TDA282/lectures.html
When I took it in 2006 it was a very practical course -- your task was
to implement a
On 9 October 2011 14:54, Joachim Breitner m...@joachim-breitner.de wrote:
Hi,
Am Freitag, den 07.10.2011, 10:52 -0400 schrieb Ryan Newton:
What about just using the Data.Bits instance of Integer? Well,
presently, the setBit instance for very large integers creates a whole
new integer,
It would be really useful to see the threadscope output for this.
Apart from cache effects (which may well be significant at 12 cores),
the usual problems with parallel GHC are synchronisation.
When GHC wants to perform a parallel GC it needs to stop all Haskell
threads. These are lightweight
Well, you can get something close with the help of IORefs, but I
forgot the details. I believe this is the paper that explains it:
Value recursion in the continuation monad by Magnus Carlsson
http://www.carlssonia.org/ogi/mdo-callcc.pdf
On 28 September 2011 15:15, Bas van Dijk
On 16 September 2011 16:31, Ryan Newton rrnew...@gmail.com wrote:
I started playing around with Leksah and scion/emacs (searching for what's
the type of this expr support) and was a little disappointed that this
functionality doesn't seem to exist yet. Or am I wrong and it exists
How about moving/adding the repo to https://github.com/haskell? That
would be a nice canonical and easy to find location, IMHO.
On 9 September 2011 05:03, steffen steffen.sier...@googlemail.com wrote:
Hi,
check out this one:
https://github.com/urso/dotrc/blob/master/vim/syntax/haskell.vim
A
stg_newByteArrayzh is defined in the runtime system. Presumably you
need to link against the GHC runtime system. If that doesn't help try
asking your question on the glasgow-haskell-us...@haskell.org mailing
list.
On 6 September 2011 16:52, David Banas dba...@banasfamily.net wrote:
Hi all,
On 5 September 2011 13:41, Sebastian Fischer fisc...@nii.ac.jp wrote:
Hi again,
I think the following rules capture what Max's program does if applied
after the usual desugaring of do-notation:
a = \p - return b
--
(\p - b) $ a
a = \p - f $ b -- 'free p' and 'free b' disjoint
--
On 5 September 2011 15:49, Sebastian Fischer fisc...@nii.ac.jp wrote:
On Mon, Sep 5, 2011 at 10:19 PM, Thomas Schilling nomin...@googlemail.com
wrote:
a = \p - f $ b -- 'free p' and 'free b' disjoint
--
((\p - f) $ a) * b
Will there also be an optimisation for some sort of simple
I don't quite understand how this would work. For example, would it work
for these examples?
do x - blah
let foo = return
foo (f x) -- Using an alias of return/pure
do x - Just blah
Just (f x) -- another form of aliasing
do x - blah
return (g x x) -- could perhaps
On 1 September 2011 08:44, Evan Laforge qdun...@gmail.com wrote:
Yes, the plan was to eventually have a parallel --make mode.
If that's the goal, wouldn't it be easier to start many ghcs?
Yes. With Scion I'm in the process of moving away from using GHC's
compilation manager (i.e., --make)
to parallelize ghc internally, so even compiling one file could
parallelize. That would be cool and all, but seems like a lot of work
compared to just parallelizing at the file level, as make would do.
It was Thomas Schilling, and he wasn't trying to parallelise the
compilation of a single file
On 30 August 2011 01:16, Evan Laforge qdun...@gmail.com wrote:
Interesting, maybe I misremembered? Or maybe there was some other guy
who was trying to parallelize?
Just out of curiosity, what benefit does a thread-safe ghc provide? I
know ghc api users have go to some bother to not call
-users mailing
list.
On 28 August 2011 17:57, Chris Smith cdsm...@gmail.com wrote:
On Sun, 2011-08-28 at 17:47 +0100, Thomas Schilling wrote:
I don't think you can link GHCi with binaries compiled in profiling
mode. You'll have to build an executable.
Okay... sorry to be obtuse, but what exactly
I don't think you can link GHCi with binaries compiled in profiling
mode. You'll have to build an executable.
On 28 August 2011 16:38, Chris Smith cdsm...@gmail.com wrote:
Okay, I should have waited until morning to post this... so actually,
things still work fine when I build without
Yep, I've been thinking about that. It could work, but I don't know
how type functions interact with SYB.
It doesn't solve the issue of having traversals with different
semantics, though. I.e., sometimes you want to look inside
SyntaxExpr, sometimes you don't. ATM, you have to customise the
GHC's parse tree contains lots of placeholders. You are not supposed
to look at them until a specific phase has been run. For example,
anything of type SyntaxExpr is an error thunk until the renamer has
been run. Unfortunately, SyntaxExpr is just a type synonym, so
there's no way to distinguish
On 25 July 2011 08:22, Paul R paul.r...@gmail.com wrote:
Hi Café,
Thomas I think () is fairly uncontroversial because:
Thomas (...)
Thomas 2. It's abstract. i.e., no intended pronunciation
How can that be an advantage ? A text flow with unnamed (or
unpronounceable) symbols makes reading,
Yes, this has sort-of been agreed upon in a GHC ticket about a year
ago: http://hackage.haskell.org/trac/ghc/ticket/3339
I had a patch in Darcs, but then came the switch to Git. I ported it
to Git, but didn't iron out all the issues. That was quite a while
ago so it's currently a bit bitrotten.
set of core libraries.
On Sun, Jul 24, 2011 at 11:39 AM, Thomas Schilling
nomin...@googlemail.com wrote:
Yes, this has sort-of been agreed upon in a GHC ticket about a year
ago: http://hackage.haskell.org/trac/ghc/ticket/3339
I had a patch in Darcs, but then came the switch to Git. I ported
Reference counting usually has much higher overheads than garbage
collection and is tricky to parallise. It's main advantage is quicker
release of memory.
I believe the main feature of ARC is that the user does not need to
manually keep reference counts up to date. I heard from people using
Does Bernie Pope's http://www.haskell.org/haskellwiki/Ministg work for you?
On 11 June 2011 21:19, Florian Weimer f...@deneb.enyo.de wrote:
I'm looking for a simple implementation of the STG machine to do some
experiments, preferably implemented in something with memory safety.
Performance is
While I would guess that your superlinear speedup is due to the large
variance of your single-core case, it is indeed possible to have
superlinear speedup.
Say you have a problem set of size 32MB and an L2 cache of 8MB per
core. If you run the same program on one CPU it won't fit into the
cache,
My guess is that you're doing all indexing work inside a single GHC
API session. When loading external packages GHC caches all .hi files
in memory -- and never unloads them. Therefore, if you have a large
package DB, that'll consume a lot of memory. For similar reasons you
can also run into
On 24 April 2011 03:26, Ranjit Jhala jh...@cs.ucsd.edu wrote:
Does anyone have a clue as to how to get a hold on an appropriate
environment? (I would have thought that the HscEnv obtained _after_
compiling some file f would populated with at least the names
needed to compile f) that is, if I
unsafePerformIO traverses the stack to perform blackholing. It could
be that your code uses a deep stack and unsafePerformIO is repeatedly
traversing it. Just a guess, though.
2011/3/24 Björn Peemöller b...@informatik.uni-kiel.de:
Hello,
we have a strange performance behaviour when we use
OK, thanks.
On 12 March 2011 14:25, Ian Lynagh ig...@earth.li wrote:
It turns out that even an i386 build made on 10.6 won't work on 10.5:
http://hackage.haskell.org/trac/ghc/ticket/4996
And even if this is fixable, it won't help, as we'll have to drop 10.5
support in order to support
I installed ghc (x86) from the bindist tarball like so:
$ wget http://www.haskell.org/ghc/dist/7.0.2/ghc-7.0.2-i386-apple-darwin.tar.bz2
$ tar -xjf ghc-7.0.2-i386-apple-darwin.tar.bz2
$ cd ghc-7.0.2-i386-apple-darwin
$ ./configure --prefix=$HOME/local
$ make install
$ ghc --version
The Glorious
...@gmail.com wrote:
Missing XCode? Or is that not relevant?
On Fri, Mar 11, 2011 at 10:39 AM, Thomas Schilling
nomin...@googlemail.com wrote:
I installed ghc (x86) from the bindist tarball like so:
$ wget
http://www.haskell.org/ghc/dist/7.0.2/ghc-7.0.2-i386-apple-darwin.tar.bz2
$ tar -xjf ghc
My guess is that they're waiting for the next (and final) stable
release of 7.0, which should happen in the next few weeks.
On 1 February 2011 08:27, Max Cantor mxcan...@gmail.com wrote:
January has come and gone and HP 2011 has not come with it. Is there an
updated timetable for the next
On 21 January 2011 09:13, Simon Peyton-Jones simo...@microsoft.com wrote:
I'm pretty keen on the whole plugin idea, because it makes the compiler more
extensible and lowers the barrier to entry. My only reason for delay is that
I wanted to review the design (as seen by a plug-in author).
On 13 January 2011 08:54, Roman Leshchinskiy r...@cse.unsw.edu.au wrote:
On 12 Jan 2011, at 23:31, Edward Z. Yang ezy...@mit.edu wrote:
Excerpts from Roman Leshchinskiy's message of Wed Jan 12 18:20:25 -0500 2011:
How would we get the current functionality of darcs-all pull? Is it even
On 11 January 2011 19:07, Roman Leshchinskiy r...@cse.unsw.edu.au wrote:
On 11/01/2011, at 16:14, Tony Finch wrote:
On Mon, 10 Jan 2011, Roman Leshchinskiy wrote:
It also seems to make finding buggy patches rather hard.
Have a look at `git bisect`.
I'm aware of git bisect. It doesn't do
I'd be for a move, but haven't contributed much lately. I use Git for
all my personal projects, so I consider Git to be useful. I
personally find sending patches via Git to be harder than with Darcs,
but if we use Github the pull-request-based model should work well.
I used Git on Windows two
I just want to point out that since the last discussion we collected
some migration advice at
http://hackage.haskell.org/trac/ghc/wiki/GitForDarcsUsers
Some of it may be untested (or wrong), but it should be a good starting point.
On 10 January 2011 22:15, Neil Mitchell ndmitch...@gmail.com
The haskell.org domain expired. It's being worked on.
On 17 December 2010 12:45, Larry Evans cppljev...@suddenlink.net wrote:
On 12/17/10 01:32, Max Bolingbroke wrote:
[snip]
I can't speak for your monad based approach, but you may be interested
in Neil Mitchell's Haskell DSL for build
Yes, modification times are reported in seconds, so you'll have to
wait on average 0.5s for a file change to be visible via the
modification date. Due to buffers and filesystem optimisations it
might even take longer.
On 16 December 2010 16:50, Arnaud Bailly arnaud.oq...@gmail.com wrote:
Yes, the current syntax highligthing plugin (SyntaxHighlight_GeSHi) is
quite annoying. It's the version that comes with debian which has the
advantage that it will be updated automatically. However, it the
surrounding div class=inline-code is my attempt at hacking around
the fact that it doesn't
Could you please add your package to the wiki section at
http://haskell.org/haskellwiki/Applications_and_libraries/Concurrency_and_parallelism#MPI
?
On 9 December 2010 21:40, Dmitry Astapov dmi...@well-typed.com wrote:
Dear Haskellers,
We are pleased to announce the release of
I don't have access to the wordpress site, but here's a quick way to fix the
links:
- Replace links of the form: http://www.haskell.org*/sitewiki/images*
/8/85/TMR-Issue13.pdf
- With: http://www.haskell.org*/wikiupload*/8/85/TMR-Issue13.pdf
/ Thomas
On 11 December 2010 23:28, Jason Dagit
It's still available at http://haskell.cs.yale.edu/yarrow/
I believe the correct new location will be on community server. See
http://community.haskell.org/ for instructions on how to get an
account there.
On 10 December 2010 12:23, Frank Rosemeier fr...@rosemeier.info wrote:
Dear
On 10 December 2010 01:40, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
On Wed, Dec 8, 2010 at 6:46 PM, Henk-Jan van Tuyl hjgt...@chello.nl wrote:
On Wed, 08 Dec 2010 10:03:40 +0100, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Hi,
Formerly, I had IORef and some
On 5 December 2010 08:29, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
Thomas Schilling schrieb:
I created http://www.haskell.org/haskellwiki/MigratingWikiContent to
list known issues and workarounds. Please feel free to extend that
page where needed.
I liked to add
Should be fixed. PDF previews are currently broken, but images should be fine.
2010/12/3 Eugene Kirpichov ekirpic...@gmail.com:
Hello,
Any news on this one?
01.12.2010, в 11:53, Yitzchak Gale g...@sefer.org написал(а):
Eugene Kirpichov wrote:
I looked at a couple pages of mine...
and
On 1 December 2010 15:18, Johan Tibell johan.tib...@gmail.com wrote:
On Wed, Dec 1, 2010 at 3:28 PM, Henk-Jan van Tuyl hjgt...@chello.nl wrote:
On Tue, 30 Nov 2010 22:47:30 +0100, Ian Lynagh ig...@earth.li wrote:
Hi all,
The haskell.org server migration is now complete.
Please let us know
I created http://www.haskell.org/haskellwiki/MigratingWikiContent to
list known issues and workarounds. Please feel free to extend that
page where needed.
/ Thomas
___
Haskell mailing list
Haskell@haskell.org
On 1 December 2010 18:55, Christopher Done chrisd...@googlemail.com wrote:
If someone will allow me to send them an extension for WikiMedia I will
write one. It shouldn't be complex at all, so code review will be trivial.
Please let me know! I'm sure other people here are interested to know who
I think a nicer way to solve that issue is to use Cabal's MIN_VERSION macros.
1. Add CPP to your extensions. This will cause cabal to
auto-generate a file with MIN_VERSION_pkg macros for each pkg in
build-depends.
2. GHC 6.12.* comes with template-haskell 2.4, so to test for that use:
#ifdef
On 17 November 2010 19:21, JP Moresmau jpmores...@gmail.com wrote:
Hello, I'm the maintainer for EclipseFP, which involves using the scion
library and the GHC API to provide IDE functionality. I have a little issue
that no doubt stems from me not understanding the GHC API well, and I would
be
For packages with many items in the index, these pages can get a bit
huge. How about a permuted index like
http://www.lispworks.com/documentation/HyperSpec/Front/X_Symbol.htm?
E.g., for your use case, you would go to E and then the row with all
the End entries, which would contain all the names
1 - 100 of 337 matches
Mail list logo
