Hi Ben,
This is indeed a bug in parsec.
I have written a patch that fixes this. Currently Antoine Latter (current
parsec's maintainer) and I are working on getting these patches into the
next parsec release.
As a workaround until then, you can apply the attached patch manually.
darcs get
Hi Michael,
Kazu recently fixed this (in the stable branch on GitHub) in
Network.listenOn but perhaps the more basic Network.Socket.listen should
also be changed. Lets discuss what's the right thing to do in this thread.
On Wed, Sep 21, 2011 at 1:38 PM, Michael Snoyman mich...@snoyman.comwrote:
I'm getting a stack overflow exception in code like this:
-- applyAction :: A - IO [B]
vs - fmap concat $ mapM applyAction sas
return vs
I don't get it if I change the code to this:
-- applyAction :: A - IO [B]
mapM_
Tim Docker wrote:
I'm getting a stack overflow exception in code like this:
-- applyAction :: A - IO [B]
vs - fmap concat $ mapM applyAction sas
return vs
I don't get it if I change the code to this:
-- applyAction :: A - IO [B]
Daniel Fischer daniel.is.fisc...@googlemail.com writes:
Btw, -0.0 can be problematic too.
How so? As far as I can tell Ord and Eq treat it as equal to 0.0 in
every way,
Yes. Which can be inconvenient if you are interested in whether you got a
-0.0, so if that's the case, you can't simply
On 21/09/11 02:39, Heinrich Apfelmus wrote:
Tim Docker wrote:
I'm getting a stack overflow exception in code like this:
-- applyAction :: A - IO [B]
vs - fmap concat $ mapM applyAction sas
return vs
I don't get it if I change the code to this:
--
I doubt it. Even if you could turn GC completely off, the vast
majority of GHC Haskell programs will run out of memory very quickly.
Lazy evaluation has been called evaluation by allocation; unless
your program has very simple requirements and can live in the
completely-strict fragment of
On Thursday 22 September 2011, 01:00:37, Tim Docker wrote:
I believe the error is happening in the concat because there are
subsequent IO actions that fail to execute. ie the code is equivalent
to:
vs - fmap concat $ mapM applyAction sas
someOtherAction
consume
On Wed, Sep 21, 2011 at 3:39 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Of course, a list of 1 million items is going to take a lot of memory,
unless you generate it lazily. Unfortunately mapM cannot generate its
result lazily because it has to execute all IO actions before
Sorry, forgot to send to the list, But everything works today, and the
commit was pulled from aeson to aeson-native,
so that must have been it. Thanks!
On Wed, Sep 21, 2011 at 8:20 AM, Rune Harder Bak r...@bak.dk wrote:
So you are saying, that this is basically because he has other version
of
On Tue, Sep 20, 2011 at 2:16 PM, Joachim Breitner
m...@joachim-breitner.dewrote:
Hi,
Am Dienstag, den 20.09.2011, 22:07 +0100 schrieb Stephen Tetley:
There have been plans to add rankings to Hackage and a GSOC looked
into adding them.
Roel van Dijk built reverse dependencies for
Tim Docker t...@dockerz.net writes:
mapM_ applyAction sas
Maybe you could try a lazy version of mapM? E.g., I think this would do
it:
import System.IO.Unsafe (unsafeInterleaveIO)
:
mapM' f = sequence' . map f
where sequence' ms = foldr k (return []) ms
k m m' =
Hi,
1. your lookAhead is unnecessary, because your items (atomNames) never
start with %.
2. your try fails in (line 12, column 1), because the last item (aka
atomName) starts consuming \n, before your eol parser is called.
So rather than calling spaces before every real atom, I would call
From: Casey McCann c...@uptoisomorphism.net
CAJ5riwLLu=wAFXm8VPnqRG2Daxxgf=upgxzchydmebgngix...@mail.gmail.com
Content-Type: text/plain; charset=ISO-8859-1
On Tue, Sep 20, 2011 at 8:20 PM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
However, nowadays I tend to think that
Hello,
My fix intended that Haskell code behaves the same in various
environments. That is, one socket catches both IPv4 and IPv6. And the
fix works even in both IPv4-only env and IPv6-only env.
Johan's observation is correct. Network.listenOn is alreay fixed but
Network.Socket.listen, which
On Tue, Sep 20, 2011 at 11:29 PM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
On 21/09/2011, at 2:59 AM, Chris Smith wrote:
On Mon, 2011-09-19 at 22:09 -0700, Evan Laforge wrote:
Then I tried switching to a fixed point format, and discovered my
mistake. Enum is supposed to enumerate every
On Wed, 21 Sep 2011 11:27:31 +0200, Christian Maeder christian.mae...@dfki.de
wrote:
Hi,
1. your lookAhead is unnecessary, because your items (atomNames) never
start with %.
I see.
2. your try fails in (line 12, column 1), because the last item (aka
atomName) starts consuming \n,
On Wed, 21 Sep 2011 09:37:40 +0300, Roman Cheplyaka r...@ro-che.info wrote:
Hi Ben,
This is indeed a bug in parsec.
Ahh good. I'm glad I'm not crazy. Given that it seems the lookahead is
actually unnecessary, looks like I can skip the patch too. Thanks for
your reply!
Cheers,
- Ben
On 09/09/2011, at 8:19 PM, John Lato wrote:
Agreed. Whenever I'd like to use mapM (or any other function for
which a *M_ is available), I've found the following rules helpful:
1. If I can guarantee the list is short (~ n=20), go ahead and use
mapM
2. Otherwise use mapM_, foldM_, or
Anyone know of a Haskell package containing a function for converting a list
of pole/residue pairs into FIR filter tap weights?
Thanks,
-db
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Sep 20, 2011 at 11:47 PM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
On 21/09/2011, at 2:18 PM, Casey McCann wrote:
I still don't see why it makes sense to add separate IEEE comparisons
instead of just adding a standard partial order class, though.
In any mathematical partial order,
On Wed, Sep 21, 2011 at 00:00:26 +0200, Valentin ROBERT wrote:
http://lyah.haskell.fr
Excellent
http://haskell.fr
Since you're starting from fresh, it would be great if the wiki
were running Gitit instead of Mediawiki. Advantages:
- Markdown is used in many places
- You can have a Git/Darcs
Unfortunately the bifunctor.homelinux.net domain stopped working. The
reverse dependencies can now be found at:
http://revdeps.hackage.haskell.org/
The reverse dependency algorithm needs some love. Some packages have
-1 reverse dependencies, which is somewhat strange.
On 20 September 2011 23:07, Stephen Tetley stephen.tet...@gmail.com wrote:
Roel van Dijk built reverse dependencies for Hackage which illustrated
the most popular libraries, unfortunately the link seems broken:
http://bifunctor.homelinux.net/~roel/hackage/packages/hackage.html
The new URL is:
On Wed, Sep 21, 2011 at 16:01, Eric Y. Kow eric@gmail.com wrote:
On Wed, Sep 21, 2011 at 00:00:26 +0200, Valentin ROBERT wrote:
http://lyah.haskell.fr
Excellent
http://haskell.fr
On this particular topic, someone asked me why I did not reuse the FR part
of Haskell wiki. That's a
Hi,
On Wed, Sep 21, 2011 at 7:38 PM, Kazu Yamamoto k...@iij.ad.jp wrote:
Johan's observation is correct. Network.listenOn is alreay fixed but
Network.Socket.listen, which Warp relies on, is not fixed yet. I will
try to fix it. When the next version of the network library will be
released,
On Wed, Sep 21, 2011 at 6:04 AM, Ketil Malde ke...@malde.org wrote:
Tim Docker t...@dockerz.net writes:
mapM_ applyAction sas
Maybe you could try a lazy version of mapM? E.g., I think this would do
it:
Another option is to use a version of mapM that accumulates the result
on the
Hi,
We should consider how we fix this. Right now N.S.listen just wraps the
underlying system call. Is that the right place to set socket options? Perhaps
we should set them when creating the socket instead?
Yes, of course.
If I remember correctly, this option works only between socket() and
On 21 September 2011 17:32, Felipe Almeida Lessa felipe.le...@gmail.com wrote:
On Wed, Sep 21, 2011 at 6:04 AM, Ketil Malde ke...@malde.org wrote:
Tim Docker t...@dockerz.net writes:
mapM_ applyAction sas
Maybe you could try a lazy version of mapM? E.g., I think this would do
it:
On Wed, Sep 21, 2011 at 2:29 AM, Vincent Hanquez t...@snarc.org wrote:
Hi Felipe,
it's good to see more Skein stuff. it's a great crypto hash and one of the
few remaining candidate for SHA-3.
Have you seen the cryptohash package
http://hackage.haskell.org/package/cryptohash ?
I always
On Tue, Sep 20, 2011 at 7:50 PM, informationen informatio...@gmx.de wrote:
doctest: Interpreter exited with an error: ExitFailure 127
You are trying the doctest binary from the command line and not the
library interface?
I tried this with ghc 7.0.3 and doctest 0.4.1 but could not reproduce
it
On Wed, Sep 21, 2011 at 07:30:16PM +0300, Sakari Jokinen wrote:
On Tue, Sep 20, 2011 at 7:50 PM, informationen informatio...@gmx.de wrote:
doctest: Interpreter exited with an error: ExitFailure 127
You are trying the doctest binary from the command line and not the
library interface?
I tried
The skein
package comes with the golden KATs sent by the Skein team to NIST
Great! Care to add that to the crypto-api test code?
Cheers,
Thomas
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Wed, Sep 21, 2011 at 7:52 PM, informationen informatio...@gmx.de wrote:
Do you have any idea, what the error message wants to tell
me. What does interpreter exited with .. mean. If i add a
Doctests starts ghc in interactive mode for evaluating the examples.
interpreter exited with.. means
On Tue, Sep 20, 2011 at 11:33 PM, rocon...@theorem.ca wrote:
For what it's worth, at some point in time I was sketching a proposal to
split the Enum class into two classes because I felt that two distinct ideas
were being conflated. Unfortunately this was years ago and I have forgotten
what
On Wed, Sep 21, 2011 at 12:09 AM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
Yes. Which can be inconvenient if you are interested in whether you got a
-0.0, so if that's the case, you can't simply use (== -0.0).
Okay, problematic is a too strong word, but it's another case that may
On Wed, Sep 21, 2011 at 14:31, Casey McCann c...@uptoisomorphism.net wrote:
My thoughts are that the first interpretation is most naturally suited
to list range syntax, that the second would be better served by a
slightly different syntax to make the predicate more explicit, and
that the
On Wed, Sep 21, 2011 at 2:27 PM, Thomas DuBuisson
thomas.dubuis...@gmail.com wrote:
The skein
package comes with the golden KATs sent by the Skein team to NIST
Great! Care to add that to the crypto-api test code?
I don't really understand how the testing workflow works on the
crypto-api
Hello fellow Haskellers,
this is a proposal to extend the arrow notation (-XArrows). I find
myself writing the following very often:
system :: Wire IO () String
system =
proc _ - do
botAddPeriod - succ ^ noise - ()
botAddSpeed - noise1 - ()
On Wed, Sep 21, 2011 at 2:41 PM, Brandon Allbery allber...@gmail.com wrote:
On Wed, Sep 21, 2011 at 14:31, Casey McCann c...@uptoisomorphism.net wrote:
My thoughts are that the first interpretation is most naturally suited
to list range syntax, that the second would be better served by a
On Wednesday 21 September 2011, 20:39:09, Casey McCann wrote:
On Wed, Sep 21, 2011 at 12:09 AM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
Yes. Which can be inconvenient if you are interested in whether you
got a -0.0, so if that's the case, you can't simply use (== -0.0).
On Tue, Sep 20, 2011 at 10:31:58PM -0400, Richard Cobbe wrote:
I'm starting to play around with GHC's support for view patterns, and I'm
running into what appears to be an annoying limitation of the
implementation.
GHC 7.0.3 (32-bit), MacOS 10.6.8.
First module; defines an abstract type
I think this proposal makes so much sense that I'm surprised it didn't
already work this way.
- Jake
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 09/21/2011 05:01 PM, Felipe Almeida Lessa wrote:
I'm aware of cryptohash. I just went through the lazy route of
binding to the C library instead of implementing those UBI details =).
hehe, fair enough. :-)
It would be nice to merge and have everything on cryptohash though.
And I guess
How does one go about getting an account?
I sent an email to the address provided at
http://hackage.haskell.org/packages/accounts.html but haven't received any
response yet.
Since it's been over 3 weeks, I decided to try my luck here.
___
Haskell-Cafe
On 2011-09-21 22:06, Brent Yorgey wrote:
On Tue, Sep 20, 2011 at 10:31:58PM -0400, Richard Cobbe wrote:
numVarRefs :: Term - Integer
numVarRefs (view - Var _) = 1
numVarRefs (view - App rator rand) = numVarRefs rator + numVarRefs rand
numVarRefs (view - Lam _ body) =
Ertugrul Soeylemez writes:
I find myself writing the following very often:
system :: Wire IO () String
system =
proc _ - do
botAddPeriod - succ ^ noise - ()
botAddSpeed - noise1 - ()
botAddStart - noise1 - ()
botMsg - event
On Wed, Sep 21, 2011 at 1:57 PM, Tim Docker t...@dockerz.net wrote:
On 09/09/2011, at 8:19 PM, John Lato wrote:
Agreed. Whenever I'd like to use mapM (or any other function for
which a *M_ is available), I've found the following rules helpful:
1. If I can guarantee the list is short (~
On Sep 18, 2011, at 11:28 AM, Brandon Allbery allber...@gmail.com wrote:
On Sat, Sep 17, 2011 at 22:11, Anton Tayanovskyy
anton.tayanovs...@gmail.com wrote:
By the way, can Haskell have a type that admits regular expression and
only those? I mostly do ML these days, so trying to write up a
On Wed, Sep 21, 2011 at 5:19 PM, Vincent Hanquez t...@snarc.org wrote:
Also, it seems that cryptohash's Skein is currently broken. The skein
package comes with the golden KATs sent by the Skein team to the
NIST, and passes everything. OTOH, cryptohash's Skein256/Skein512 do
not agree with
I've got this expression
expression = do
w - hello
y - to you
return w
I wanna know how can I reduce it using monad laws
--
View this message in context:
http://haskell.1045720.n5.nabble.com/Monad-Laws-and-Do-Notation-tp4828598p4828598.html
Sent from the Haskell -
On 22 September 2011 11:46, diazepan spanishbizar...@yahoo.com wrote:
I've got this expression
expression = do
w - hello
y - to you
return w
I wanna know how can I reduce it using monad laws
I don't think you can: the best you can do is minimise it with other
monadic
Welcome to issue 200 of the HWN, a newsletter covering developments in
the Haskell community. This release covers the week of September 11 to
17, 2011.
You can find the HTML version of this issue at:
http://contemplatecode.blogspot.com/2011/09/haskell-weekly-news-issue-200.html
From: Sean Leather leat...@cs.uu.nl
I would like to ask GHCi for the type that a type expression will evaluate to,
once all definitions of type synonyms and (when possible) type families have
been inlined.
It appears that I can do some part of this for type T by using :t undefined
:: T:
...
hello,
I second the choice of gitit, if only to follow eat your own dog food
principle. but gitit is also a really great piece of software.
I have really no strong advice on whether or not the wiki should be part of
Haskell.org. but whatever the choice, I will definitely support this
55 matches
Mail list logo
