Was there some significant change/bug introduced to haddock made between
2.10 and 2.12?
When I look at the haddocks for kan-extensions 3.1:
Data.Functor.Yonedahttp://hackage.haskell.org/packages/archive/kan-extensions/3.1/doc/html/Data-Functor-Yoneda.html
which
purports to have been built by
2012/9/19 Brandon Allbery allber...@gmail.com:
On Wed, Sep 19, 2012 at 7:06 AM, Jason Dusek jason.du...@gmail.com wrote:
What I attempted was building a binary with only some C libraries
statically linked, with this command line:
# Build https://github.com/erudify/sssp on Ubunut 12.04
On Sun, Sep 23, 2012 at 12:36 AM, Erik de Castro Lopo
mle...@mega-nerd.com wrote:
Vasili I. Galchin wrote:
Hello Haskellers,
I installed darcs on a Windows 7 machine. A darcs folder was created
under Program Files(x86) folder. However, when I pull up Program... on
the left side, darcs
I have tested it a long time ago. It worked fine.
However, when I need to use darcs on Windows 7 now, I just use the CLI, I
don't really need more.
On Mon, Sep 24, 2012 at 3:07 PM, Magnus Therning mag...@therning.orgwrote:
On Sun, Sep 23, 2012 at 12:36 AM, Erik de Castro Lopo
On Mon, Sep 24, 2012 at 2:53 PM, George Giorgidze giorgi...@gmail.com wrote:
Hi Michael,
Here at the University of Tübingen, I am co-supervising (together with
Jeroen Weijers) a student project implementing the OverloadedLists
extension for GHC. Achim Krause is the student who is working on
Simon Hengel wrote:
On Sun, Sep 23, 2012 at 06:11:59PM +0200, Heinrich Apfelmus wrote:
How do I access internal modules with cabal test , though? Last
time I tried, I could not find a way to expose in the test section
of the cabal file.
It works, if you add the source directory to
Roman Cheplyaka wrote:
* Heinrich Apfelmus apfel...@quantentunnel.de [2012-09-23 10:51:26+0200]
Unfortunately, making literals polymorphic does not always achieve
the desired effect of reducing syntax. In fact, they can instead
increase syntax! In other words, I would like to point out that
Quite a while ago there was a mailing list thread where the idea was
brought up of creating a mailing list for those interested in
combinatorics in the setting of Haskell.
Well, I've finally gotten around to it. If you're interested in
(probably extremely low-traffic) discussion and
On Mon, Sep 24, 2012 at 7:42 AM, Jason Dusek jason.du...@gmail.com wrote:
I am not sure why that happens -- libgcc.a wasn't explicitly
asked for; but it stands to reason that one shouldn't specify
No, but it's required for anything that uses the C compiler (which in this
case would be glibc
With shake I'm not sure exactly how to get started. Should I have a
separate project where I create the build system for the webapp? Or
can I setup something similar to sbt?
Also, how do I handle dependencies with shake? cabal will pull in
packages from hackage and do the needful, is
Michael Snoyman wrote:
The simplest example I can think of is allowing easier usage of Vector:
[1, 2, 3] :: Vector Int
In order to allow this, we could use a typeclass approach similar to
how OverloadedStrings works:
class IsList a where
fromList :: [b] - a b
| Many of us use the OverloadedStrings language extension on a regular
| basis. It provides the ability to keep the ease-of-use of string
| literal syntax, while getting the performance and correctness
| advantages of specialized datatypes like ByteString and Text. I think
| we can get the
| I remember a similar discussion a few years ago. The question of whether
| or not overloading list literals a good idea notwithstanding, the problem
| with this is that fromList for vectors is highly inefficient. So if
| something like this gets implemented and if vector/array literals are
Hi Andres, list,
On 19/09/12 09:41, Andres Löh wrote:
Oops, I hit send too prematurely, sorry for the seeming bluntness (but it is
still a blunt message, can't apologize for that I suppose):
No need to apologize. There's a need for informal meetings as much (or
even more) as there is for
14 matches
Mail list logo
