On Sat, 3 Mar 2012 21:12:26 +0100
David Waern david.wa...@gmail.com wrote:
2012/3/3 Sergei Trofimovich sly...@gmail.com:
It seems to fail to generate buildwrapper documentation.
The minimal example:
-- Base.hs:
module Base where
-- | component in cabal file
data CabalComponent
Pēteris Paikens wrote:
I'm stuck at trying to get Data.Encoding package functional. Cabal
gives the following error message:
This is caused by a problem with the cabal file in the encoding
package. Often it causes the entire GHC package system to
get confused, as pointed out by Brandon.
The
On Sat, Mar 03, 2012 at 10:37:10PM -0500, Ras Far wrote:
letters correspond to grammar, words, or meaning. So we've got love,
too (Aramaic word “Abba” = love of God or so...)
Not quite, it's a familiar/intimate form of father, cf English
papa, dada or daddy.
-Brent
Hi Duncan,
I just wanted to thank you and all the other guys pushing Hackage 2
towards a public release. I just tested the
http://hackage.factisresearch.com/
instance and it's blazingly fast. Cool stuff! The reverse dependencies
are also very useful. I know that sending patches instead of
(apologies if you receive multiple postings)
Dear all,
The program and *new location* for the 11th GhentFPG meeting has been
determined. The meeting will take place on Tuesday, the 20th of March at 19:30
in auditorium V1 of building S9 at Campus De Sterre (Krijgslaan 281, 9000
Gent). We will
Hear hear, that is looking great. Thanks,
-Simon
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2012/3/4 Sergei Trofimovich sly...@gmail.com:
Thanks! Fixed upstream.
Let me bother you with another example (looks like a regression this time).
Example comes from probability-0.2.3.1 package (selfcontained example
attached).
Haddock seems to have stopped liking utf-8 special chars in
Hello Cafe,
I am looking for a data structure that would have the following
informal properties:
- allow efficient retrieval of minimum element for some ordering
relation on a computed property of the elements
- allow efficient update of any element wrt to this property
I have first tried to
Dear Haskell programmers,
I'm very confused, because I really don't know how to handle with IO's and
other datatypes, such as Int or String.
If I want to build a haskell program can I only use IO() method outputs ? How
can I give a Int result from a different method back to the main?
Would this
Just use this rule of thumb. If it is a monad (like IO Int, IO
String) use do - notation. If it isn't a monad (like Int, String),
just use let syntax, same as you did with the first list.
main = do
let ttime = [8,20,10,15]
a = dauer ttime (OPTIONAL let a = dauer ttime)
putStrLn a
On
On Mar 3, 2012, at 12:45 , Malcolm Wallace wrote:
On 3 Mar 2012, at 04:30, Omari Norman wrote:
On the other hand, I notice that attoparsec and polyparse backtrack by
default, and attoparsec claims to be faster than Parsec (I can't remember if
polyparse makes this claim).
In my
On Sun, Mar 4, 2012 at 1:27 PM, Arnaud Bailly arnaud.oq...@gmail.com wrote:
Hello Cafe,
I am looking for a data structure that would have the following
informal properties:
- allow efficient retrieval of minimum element for some ordering
relation on a computed property of the elements
-
Hi! So, it turns out I have a need for a sink that forks input into two other
sinks using the Conduit package. Here is what I came up with:
https://gist.github.com/1975383
Is this the right way to write it? Also, what left over value(s) should I
return in the Done constructor?
I appreciate any
On 3/3/12 10:37 PM, Ras Far wrote:
Now the serendipity with Wren's linguistic research. And even the
freegeek domain. Fantastic. Wren, your slides look great, thanks for
the link, I think I'll read them tonight. Do you have a paper version
of the slides at all? Slides can be a bit terse on
On 3/3/12 10:37 PM, Ras Far wrote:
So we can have ... chiastic freesects? This sounds like too much fun!
I find chiasmus is a term from linguistics?
I'm not sure it's used much in linguistics per se, but it's common
terminology from classics, rhetoric, and poetry. Literally chiastic
just
Hi All,
Can someone please let me know if there is a 64bit target on Windows on the
horizon for GHC?
I am trying to push for changing the current implementation in my
organization in C++ to Haskell - Our primary targets are Windows and Mac.
Not being able to generate 64bit DLL's on Windows would
Thanks a lot. Yes it helps!
Arnaud
On Sun, Mar 4, 2012 at 9:38 PM, Joey Adams joeyadams3.14...@gmail.com wrote:
On Sun, Mar 4, 2012 at 1:27 PM, Arnaud Bailly arnaud.oq...@gmail.com wrote:
Hello Cafe,
I am looking for a data structure that would have the following
informal properties:
-
I don't know if timeline has been established, but my understanding is
that there is a need for this and that the right people are aware of
it and looking into it.
The GHC trac has a ticket for this:
http://hackage.haskell.org/trac/ghc/ticket/1884
On Sun, Mar 4, 2012 at 9:59 PM, C K Kashyap
Hello All
How do I add type annotations to interior locations in an abstract syntax tree?
I have a small ML language where programs are a single expression, but
the expression type has let-rec so it supports recursive function
definitions. Source programs have no type annotations.
I want to
19 matches
Mail list logo
