I tried mmm-mode with a few configurations, but I get into trouble
when using other haskell-mode features. Also, the wiki page on
haskell-mode (
http://www.haskell.org/haskellwiki/Haskell_mode_for_Emacs#Literate_Haskell
) specifically mentions mmm-mode tricks are not needed anymore and
shouldn't
On 28 September 2011 16:25, Mathijs Kwik math...@bluescreen303.nl wrote:
I tried mmm-mode with a few configurations, but I get into trouble
when using other haskell-mode features. Also, the wiki page on
haskell-mode (
http://www.haskell.org/haskellwiki/Haskell_mode_for_Emacs#Literate_Haskell
On 09/27/2011 11:54 PM, Thomas DuBuisson wrote:
The crypto-api test modules have been split out into their own
package, crypto-api-tests. Additionally, the tests now use the
test-framework package. This should make it much easier for
hash/cipher maintainers to integrate into their existing
On 09/28/11 12:47 AM, Anthony Cowley wrote:
I am not aware of as good a story for Arduino-level development. Atom
may be an appropriate foundation for such an effort, but I also hope
that we can get GHC ARM support sorted out, and then use platforms
like the forthcoming Raspberry Pi as the
Hi,
Apologies if this is an off-topic for the list,
If someone here managed to build network 2.3.05 on windows 7 with ghc-7.2.1
, could you kindly pass me the trick?
The config step fails with missing header. I tried running it with mingw
(tried with the latest one too - just in case :
Hello,
Sorry for the delay but I made a patch and sent a pull request:
https://github.com/haskell/network/pull/18
After consideration, I realized that Johan's opinion is better.
Please read the comment of this request above.
When the next network package will be released, this problem
Hi,
Am Mittwoch, den 28.09.2011, 09:30 +0200 schrieb Karel Gardas:
Please note GHCi support is still missing...
which implies that Template Haskell does not work. So if you are
considering using TH in your library when it is avoidable, remember that
you are making your code unusable on most
So currently, it's okay to make Haskell code that targets Android
smartphones, the Beagleboard, the Raspberry Pi or the OpenPandora as long as
you use the development version of GHC?
2011/9/28 Karel Gardas karel.gar...@centrum.cz
On 09/28/11 12:47 AM, Anthony Cowley wrote:
I am not aware of
On 09/28/11 10:42 AM, Yves Parès wrote:
So currently, it's okay to make Haskell code that targets Android
smartphones, the Beagleboard, the Raspberry Pi or the OpenPandora as long as
you use the development version of GHC?
No, it's not that easy. As cross-compiling is not working (yet!) then
This means not only kernel should be the same (w.r.t. its
API/functionality) but also standard libc and other runtime libraries.
Yes, this is what I understood. I wasn't talking about portable *binaries*,
just about the ARM platforms which were efficient enough to run GHC.
I guessed one would
Hi,
On 09/28/11 10:35 AM, Joachim Breitner wrote:
Am Mittwoch, den 28.09.2011, 09:30 +0200 schrieb Karel Gardas:
Please note GHCi support is still missing...
which implies that Template Haskell does not work. So if you are
considering using TH in your library when it is avoidable, remember
Karel Gardas wrote:
Hi,
On 09/28/11 10:35 AM, Joachim Breitner wrote:
Am Mittwoch, den 28.09.2011, 09:30 +0200 schrieb Karel Gardas:
Please note GHCi support is still missing...
which implies that Template Haskell does not work. So if you are
considering using TH in your library
It helps if I actually CC the right mailing list...
-- Forwarded message --
From: Ivan Lazar Miljenovic ivan.miljeno...@gmail.com
Date: 28 September 2011 20:02
Subject: Re: [Haskell] getting started
To: haskell shubhammaheshwa...@gmail.com
Cc: c...@haskell.org
On 28 September
On 09/28/11 11:06 AM, Yves Parès wrote:
This means not only kernel should be the same (w.r.t. its
API/functionality) but also standard libc and other runtime libraries.
Yes, this is what I understood. I wasn't talking about portable *binaries*,
just about the ARM platforms which were efficient
Yes, but compilation might be damn slow.
I forget about the SheevaPlugs (ARMv5 Kirkwood 1,2 GHz)! They are kind of
cheap for what they offer, it's a very nice embedded platform.
2011/9/28 Karel Gardas karel.gar...@centrum.cz
On 09/28/11 11:06 AM, Yves Parès wrote:
This means not only kernel
On 27 September 2011 01:07, Nicu Ionita nicu.ion...@acons.at wrote:
I wonder why the transformers library does not use this kind of state monad
definition.
One disadvantage of ContT and I guess any CPS based monad transformer
is that they interact badly with exception handling functions like
On 09/28/11 12:41 PM, Yves Parès wrote:
Yes, but compilation might be damn slow.
I forget about the SheevaPlugs (ARMv5 Kirkwood 1,2 GHz)! They are kind of
cheap for what they offer, it's a very nice embedded platform.
Yes, or you can even attempt to install some ARMv5 linux on ARMv7
platform.
Interesting, so what have you used to get that speedup?
A monad stack of ContT and State (*)? Just the Cont monad?
(*) If so, were you using the strict version of State?
Would it be possible to see the differences between the 2 versions of you
code?
2011/9/27 Nicu Ionita nicu.ion...@acons.at
Bas van Dijk v.dijk@gmail.com wrote:
Because of this reason I don't provide a MonadTransControl instance
for ContT in monad-control[2].
Is that even possible? I tried hard to come up with just a MonadFix
instance for CPS-based monads, and I failed. I would think that
MonadTransControl is
On Sat, Sep 17, 2011 at 1:38 AM, Jesse Schalken jesseschal...@gmail.comwrote:
There might be a way to do it, I don't know, but this sounds like an
XYhttp://www.perlmonks.org/index.pl?node_id=542341
problem http://mywiki.wooledge.org/XyProblem. Can I ask what you're
trying to achieve by doing
On 28 September 2011 14:25, Ertugrul Soeylemez e...@ertes.de wrote:
Bas van Dijk v.dijk@gmail.com wrote:
Because of this reason I don't provide a MonadTransControl instance
for ContT in monad-control[2].
Is that even possible?
I once tried and failed so I believe it's not possible.
Bas
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
Hi Michael,
I recommend Attoparsec when parsing raw data into custom data types.
There aren't as many examples and tutorials as there are for Parsec,
but the API is very similar, and some of the important differences are
listed on Attoparsec's Hackage entry. There are also helpful examples
of its
Sai Hemanth K saihema...@gmail.com schrieb im Newsbeitrag
news:canok7kum7-g5bwhj6btrraruykyl1xyltfr9rd4ke5sovbi...@mail.gmail.com...
Hi,
Apologies if this is an off-topic for the list,
If someone here managed to build network 2.3.05 on windows 7 with ghc-7.2.1
, could you kindly pass
I've released a new version of network, 2.3.0.6, that contains the fix.
On Wed, Sep 28, 2011 at 1:34 AM, Kazu Yamamoto k...@iij.ad.jp wrote:
Hello,
Sorry for the delay but I made a patch and sent a pull request:
https://github.com/haskell/network/pull/18
After consideration, I
Let me take this opportunity to ask for a co-maintainer that can help me
keep the network package working on Windows. I don't have easy access to a
Windows machine (or even VM) anymore so testing on Windows is hard. What I'd
really like is a buildbot that builds the following Jenkins job as a
Hello, all.
I have released 'Peggy' a new parser generator .
It is based on Parsing Expression Grammer (PEG) [1],
and generates efficient packrat parsers.
# Where to get it
* Hackage page (http://hackage.haskell.org/package/peggy)
* github repository (https://github.com/tanakh/peggy).
* Some
Am 28.09.2011 14:05, schrieb Yves Parès:
Interesting, so what have you used to get that speedup?
A monad stack of ContT and State (*)? Just the Cont monad?
This is a module with a state monad transformer that I used before (the
name STPlus is misleading - and sorry for the long email):
{-#
Am 28.09.2011 02:35, schrieb Ryan Ingram:
My guess is that Cont plays really nicely with GHC's inliner, so
things that end up looking like
return x = \y - ...
get optimized really well
return x = f
-- inline =
= ContState $ \s0 k - runCS (return x) s0 $ \a s1 - runCS (f a) s1 k
On 25/09/2011, at 18:20, Chris Smith wrote:
class Ord a = Range a where
rangeFromTo :: a - a - [a] -- subsumes Ix.range / Enum.enumFromTo
rangeFromThenTo :: a - a - a - [a]
inRange :: (a, a) - a - Bool
-- Does have instances for Float/Double. List ranges desugar to this.
-- Also
On 29 September 2011 07:56, Roman Leshchinskiy r...@cse.unsw.edu.au wrote:
On 25/09/2011, at 18:20, Chris Smith wrote:
class Ord a = Range a where
rangeFromTo :: a - a - [a] -- subsumes Ix.range / Enum.enumFromTo
rangeFromThenTo :: a - a - a - [a]
inRange :: (a, a) - a - Bool
--
On 28/09/2011, at 23:23, Ivan Lazar Miljenovic wrote:
On 29 September 2011 07:56, Roman Leshchinskiy r...@cse.unsw.edu.au wrote:
On 25/09/2011, at 18:20, Chris Smith wrote:
class Ord a = Range a where
rangeFromTo :: a - a - [a] -- subsumes Ix.range / Enum.enumFromTo
rangeFromThenTo
Welcome to issue 201 of the HWN, a newsletter covering developments in
the Haskell community. This release covers the week of September 18 to
24, 2011.
You can find the HTML version of this issue at:
http://contemplatecode.blogspot.com/2011/09/haskell-weekly-news-issue-201.html
Announcements
On Wed, Sep 28, 2011 at 8:09 PM, Daniel Santa Cruz dstc...@gmail.comwrote:
Welcome to issue 201 of the HWN, a newsletter covering developments in
the Haskell community. This release covers the week of September 18 to
24, 2011.
You can find the HTML version of this issue at:
Hi Thomas,
this should be on the haskell-cafe or haskell-beginners mailing list.
Haskell@... is mainly for announcements.
You have:
f :: Monad m =
a - m b
Data.Traversable.mapM :: (Monad m, Traversable t) =
(a - m b) - t a - m (t b)
So, if you define g with
g
35 matches
Mail list logo
