Re: [GHC] #5516: Universally quantified GADT context leads to overlapping instance

2011-09-28 Thread GHC
#5516: Universally quantified GADT context leads to overlapping instance -+-- Reporter: andersk | Owner: Type: bug | Status: new

[GHC] #5517: Dumping core-prep goes to stdout.

2011-09-28 Thread GHC
#5517: Dumping core-prep goes to stdout. -+-- Reporter: erikd | Owner: Type: bug | Status: new Priority: normal| Component:

Re: [GHC] #5510: Representation of GHC Errors

2011-09-28 Thread GHC
#5510: Representation of GHC Errors -+-- Reporter: mgsloan1 |Owner: Type: feature request | Status: new Priority: normal|Milestone:

Re: [GHC] #5517: Dumping core-prep goes to stdout.

2011-09-28 Thread GHC
#5517: Dumping core-prep goes to stdout. --+- Reporter: erikd | Owner: Type: bug | Status: closed Priority: normal| Component: Compiler

Re: [GHC] #2528: nub not as reliable as nubBy

2011-09-28 Thread GHC
#2528: nub not as reliable as nubBy -+-- Reporter: jdressel| Owner: Type: bug | Status: new Priority: normal | Milestone: 6.10.1

Re: [GHC] #2528: nub not as reliable as nubBy

2011-09-28 Thread GHC
#2528: nub not as reliable as nubBy -+-- Reporter: jdressel| Owner: Type: bug | Status: new Priority: normal | Milestone: 6.10.1

Re: [GHC] #2528: nub not as reliable as nubBy

2011-09-28 Thread GHC
#2528: nub not as reliable as nubBy -+-- Reporter: jdressel| Owner: Type: bug | Status: new Priority: normal | Milestone: 6.10.1

[GHC] #5518: Some unicode symbols are not allow in literal characters or strings

2011-09-28 Thread GHC
#5518: Some unicode symbols are not allow in literal characters or strings ---+ Reporter: ertai | Owner: Type: bug | Status: new Priority: normal

[GHC] #5519: Some unicode symbols are not allow in literal characters or strings

2011-09-28 Thread GHC
#5519: Some unicode symbols are not allow in literal characters or strings ---+ Reporter: ertai | Owner: Type: bug | Status: new Priority: normal

Re: [GHC] #5514: bad variable escape analysis when TypeFamilies are enabled

2011-09-28 Thread GHC
#5514: bad variable escape analysis when TypeFamilies are enabled -+-- Reporter: dmwit | Owner: Type: bug | Status: new Priority: normal

[GHC] #5520: Spurious warning with new associated types and MultiParamTypeClasses

2011-09-28 Thread GHC
#5520: Spurious warning with new associated types and MultiParamTypeClasses -+-- Reporter: batterseapower| Owner: Type: bug | Status: new

Re: [GHC] #5509: quotes pretty-printer not working as comments specify

2011-09-28 Thread GHC
#5509: quotes pretty-printer not working as comments specify -+-- Reporter: mgsloan1 |Owner: Type: bug | Status: new

Re: [GHC] #5518: Some unicode symbols are not allow in literal characters or strings

2011-09-28 Thread GHC
#5518: Some unicode symbols are not allow in literal characters or strings ---+ Reporter: ertai | Owner: Type: bug | Status: new Priority: normal

Re: [GHC] #5509: quotes pretty-printer not working as comments specify

2011-09-28 Thread GHC
#5509: quotes pretty-printer not working as comments specify -+-- Reporter: mgsloan1 |Owner: Type: bug | Status: new

[GHC] #5521: Allow unknown fields in .cabal with X- at front

2011-09-28 Thread GHC
#5521: Allow unknown fields in .cabal with X- at front -+-- Reporter: zzo38 | Owner: Type: feature request | Status: new Priority: normal|

Re: [GHC] #5521: Allow unknown fields in .cabal with X- at front

2011-09-28 Thread GHC
#5521: Allow unknown fields in .cabal with X- at front --+- Reporter: zzo38| Owner: Type: feature request | Status: closed Priority: normal |

Mysterious function call of timer_settime

2011-09-28 Thread Volker Wysk
Hello! This is the compilation of three messages, which I posted in glasgow-haskell-users. Since the problem probably is a GHC bug, I think glasgow-haskell-bugs is more appropriate. --- Im porting my HsShellScript

[GHC] #5522: mc03 -O -fliberate-case -fspec-constr runs out of memory

2011-09-28 Thread GHC
#5522: mc03 -O -fliberate-case -fspec-constr runs out of memory +--- Reporter: btutt| Owner: Type: bug | Status: new Priority: normal | Component:

Re: [GHC] #5488: GHC-7.2.1 standalone failed to bootstrap ghc-HEAD on windows

2011-09-28 Thread GHC
#5488: GHC-7.2.1 standalone failed to bootstrap ghc-HEAD on windows -+-- Reporter: btutt| Owner: Type: bug | Status: closed Priority:

Re: [GHC] #5506: LLVM AST : needs an LlvmType ctor to represent vectors so that LLVM can generate SIMD instructions

2011-09-28 Thread GHC
#5506: LLVM AST : needs an LlvmType ctor to represent vectors so that LLVM can generate SIMD instructions -+-- Reporter: erikd | Owner: dterei Type: task | Status:

Re: [GHC] #5506: LLVM AST : needs an LlvmType ctor to represent vectors so that LLVM can generate SIMD instructions

2011-09-28 Thread GHC
#5506: LLVM AST : needs an LlvmType ctor to represent vectors so that LLVM can generate SIMD instructions -+-- Reporter: erikd | Owner: dterei Type: task | Status:

Mysterious function timer_settime

2011-09-28 Thread Volker Wysk
Hi! Im porting my HsShellScript library to GHC-7.0.4 and to Cabal/Hackage. It builds and installs fine: ~/src/hsshellscript-3.0.0 $ cabal clean cleaning... ~/src/hsshellscript-3.0.0 $ cabal configure Resolving dependencies... Configuring hsshellscript-3.0.0...

Re: Mysterious function timer_settime

2011-09-28 Thread Volker Wysk
Hi Here's an addition to my Mysterious function timer_settime message: This test program: import HsShellScript main = call (exec /bin/echo [bla bla] -|- exec /bin/cat []) produces this output: test: test: stderr: hPutStr: illegal operation

Re: Mysterious function timer_settime

2011-09-28 Thread Volker Wysk
On Wednesday 28 September 2011 14:27:13 Volker Wysk wrote: I'm almost sure that the two examples work fine in the last working version of HsShellScript. They use GHC-6.11. That is, they work fine when compiled with GHC-6.11. Sorry. ___

[Haskell] getting started

2011-09-28 Thread haskell
i am new to haskell can you tell me the softwares to install in haskell i have install hugs emacs but when i write any code it gives same error can you help me start i have lekash too i have installed some more packages -- View this message in context:

Re: [Haskell] getting started

2011-09-28 Thread Luis Cabellos
On Wed, Sep 28, 2011 at 11:56 AM, haskell shubhammaheshwa...@gmail.comwrote: i am new to haskell can you tell me the softwares to install in haskell i have install hugs emacs but when i write any code it gives same error can you help me start i have lekash too i have installed some more

Re: [Haskell] getting started

2011-09-28 Thread Diego Souza
You may also enjoy reading: http://learnyouahaskell.com/ It is also freely available online. ~dsouza On Wed, Sep 28, 2011 at 02:56:46AM -0700, haskell wrote: i am new to haskell can you tell me the softwares to install in haskell i have install hugs emacs but when i write any code it gives

[Haskell] MSFP 2012: Call for Papers

2011-09-28 Thread James Chapman
Fourth Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 March, Tallinn, Estonia A satellite workshop of ETAPS 2012 http://cs.ioc.ee/msfp/msfp2012/ The fourth workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure.

Re: [Haskell] getting started

2011-09-28 Thread Ivan Lazar Miljenovic
On 29 September 2011 00:15, haskell shubhammaheshwa...@gmail.com wrote: yes i h ave seen this and learn your haskell for great god and wiki books can you tell me the firat script that works so i can tell what is the problem You want a simple working program? Put the following into a file

[Haskell] mapM with Traversables

2011-09-28 Thread thomas burt
Hi - I have a function, f :: Monad m = a - m b, as well as a list of a's. I'd like to produce a sequence (Data.Sequence) of b's, given the a's: g :: [a] - m (Seq b) g a = do Data.Traversable.mapM f a -- type error! I see that Data.Traversable.mapM f a doesn't work... is this like asking the

[Haskell] Haskell Weekly News: Issue 201

2011-09-28 Thread Daniel Santa Cruz
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

Re: [Haskell] Haskell Weekly News: Issue 201

2011-09-28 Thread Daniel Santa Cruz
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:

Re: Please apply the comparison function given to nubBy to elements of the list in the order in which they occur in the list.

2011-09-28 Thread Christian Maeder
In case you further want to discuss this, I've re-opened http://hackage.haskell.org/trac/ghc/ticket/2528#comment:10 So, I'm against your proposal, Cale, but suggest that you revert the order in your example (if you want to exploit this behavior). Cheers Christian Am 08.09.2011 02:07, schrieb

Re: [Haskell-cafe] emacs literate haskell mode

2011-09-28 Thread Mathijs Kwik
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

Re: [Haskell-cafe] emacs literate haskell mode

2011-09-28 Thread Ivan Lazar Miljenovic
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

Re: [Haskell-cafe] [ANN] crypto-api-tests

2011-09-28 Thread Vincent Hanquez
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Karel Gardas
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

[Haskell-cafe] network 2.3.05 on windows 7 with ghc-7.2.1

2011-09-28 Thread Sai Hemanth K
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 :

Re: [Haskell-cafe] Binding a socket to all interfaces

2011-09-28 Thread 山本和彦
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Joachim Breitner
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Yves Parès
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Karel Gardas
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Yves Parès
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Karel Gardas
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Erik de Castro Lopo
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

[Haskell-cafe] Fwd: [Haskell] getting started

2011-09-28 Thread Ivan Lazar Miljenovic
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Karel Gardas
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Yves Parès
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

Re: [Haskell-cafe] Much faster complex monad stack based on CPS state

2011-09-28 Thread Bas van Dijk
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

Re: [Haskell-cafe] I for one welcome our new Robotic Overlords

2011-09-28 Thread Karel Gardas
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.

Re: [Haskell-cafe] Much faster complex monad stack based on CPS state

2011-09-28 Thread Yves Parès
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

Re: [Haskell-cafe] Much faster complex monad stack based on CPS state

2011-09-28 Thread Ertugrul Soeylemez
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

Re: [Haskell-cafe] Turn GC off

2011-09-28 Thread Andreas Voellmy
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

Re: [Haskell-cafe] Much faster complex monad stack based on CPS state

2011-09-28 Thread Bas van Dijk
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

Re: [Haskell-cafe] Much faster complex monad stack based on CPS state

2011-09-28 Thread Thomas Schilling
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

Re: [Haskell-cafe] Parsing binary data question

2011-09-28 Thread Eric Rasmussen
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

Re: [Haskell-cafe] network 2.3.05 on windows 7 with ghc-7.2.1

2011-09-28 Thread Rene de Visser
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

Re: [Haskell-cafe] Binding a socket to all interfaces

2011-09-28 Thread Johan Tibell
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

[Haskell-cafe] network package Windows co-maintainer/buildbot needed (Was: network 2.3.05 on windows 7 with ghc-7.2.1)

2011-09-28 Thread Johan Tibell
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

[Haskell-cafe] ANN: Peggy 0.2.1

2011-09-28 Thread Hideyuki Tanaka
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

Re: [Haskell-cafe] Much faster complex monad stack based on CPS state

2011-09-28 Thread Nicu Ionita
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): {-#

Re: [Haskell-cafe] Much faster complex monad stack based on CPS state

2011-09-28 Thread Nicu Ionita
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

Re: [Haskell-cafe] instance Enum Double considered not entirely great?

2011-09-28 Thread Roman Leshchinskiy
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

Re: [Haskell-cafe] instance Enum Double considered not entirely great?

2011-09-28 Thread Ivan Lazar Miljenovic
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 --

Re: [Haskell-cafe] instance Enum Double considered not entirely great?

2011-09-28 Thread Roman Leshchinskiy
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

[Haskell-cafe] Haskell Weekly News: Issue 201

2011-09-28 Thread Daniel Santa Cruz
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

Re: [Haskell-cafe] Haskell Weekly News: Issue 201

2011-09-28 Thread Daniel Santa Cruz
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:

Re: [Haskell-cafe] [Haskell] mapM with Traversables

2011-09-28 Thread Marc Ziegert
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