[Haskell-cafe] darcs checkin history?? forgot ....

Hello, If I have a URL for a darcs repository, how can I get a listing of activity ... mainly "checkin" history e.g. name, date timestamp? Thanks, Vasili ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/list

Re: [Haskell-cafe] ANN: Webwire 0.1.0, netwire 1.2.5

2011/9/16 Ertugrul Soeylemez : > Hello fellow Haskellers, > > webwire is an experimental web framework based on the functional > reactive programming library netwire.  It uses WAI under the hood and > right now features only a subset of the very basics of what you need to > write web sites Are you

Re: [Haskell-cafe] ANN: Webwire 0.1.0, netwire 1.2.5

Ertugrul Soeylemez wrote: > webwire is [...] stupid me. =) As always I forgot to link them: Greets, Ertugrul -- nightmare = unsafePerformIO (getWrongWife >>= sex) http://ertes.de/

[Haskell-cafe] ANN: Webwire 0.1.0, netwire 1.2.5

Hello fellow Haskellers, webwire is an experimental web framework based on the functional reactive programming library netwire. It uses WAI under the hood and right now features only a subset of the very basics of what you need to write web sites. Features: * Reactive programming of web sites

Re: [Haskell-cafe] pattern matching instead of prelude.head

On 9/15/11 10:24 PM, Michael Litchard wrote: Someone commented on StackOverflow that pattern matching the first element of a list was preferable to head. This makes sense intuitively. Could someone articulate the reason why this is true? (1) If you call (head xs) you are assuming that xs is non

Re: [Haskell-cafe] pattern matching instead of prelude.head

Pattern matching will warn you if you neglect to consider the empty list. On Fri, Sep 16, 2011 at 10:24 AM, Michael Litchard wrote: > Someone commented on StackOverflow that pattern matching the first > element of a list was preferable to head. This makes sense > intuitively. Could someone articu

[Haskell-cafe] pattern matching instead of prelude.head

Someone commented on StackOverflow that pattern matching the first element of a list was preferable to head. This makes sense intuitively. Could someone articulate the reason why this is true? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http:/

[Haskell-cafe] Enumeratees are killing me

I'm trying to write what I think should be a simple Enumeratee, but I'm just not having any luck getting it to typecheck, and I'm coming to the realization that I still have no idea what I'm doing. The essential thing I want to do is adapt Data.Enumerator.List.concatMapAccum so that the accumulato

Re: [Haskell-cafe] Error in Installing Data.deriveTH

On Thursday 15 September 2011, 21:37:29, mukesh tiwari wrote: > I tried to resolve this issue on #haskell and i got suggestion that it > was due to conflict in > > global and local namespace [ see here for more detail > http://hpaste.org/51376 ]. Yes.The containers in the global db is shadowed b

Re: [Haskell-cafe] [Haskell] [ANNOUNCE] Haskdogs-0.1

On 16 September 2011 04:33, Sergey Mironov wrote:> Shure. But I still need some directory to store unpacked sources. If > not ~/.cabal/var, then it should be something like ~/.haskdogs/. Exact > path doesn't metter actually. I'll add automatic creation of this dir > and maybe it is good idea to mo

[Haskell-cafe] Error in Installing Data.deriveTH

Hello all I am trying to install Data.deriveTH . When i tried cabal install derive , i got this error. ntro@ntro-HP-dx2480-MT-NA121PA:~/Mukesh/assignment_haskell/work$ cabal install deriveResolving dependencies...: cannot satisfy -package Cabal-1.10.2.0: Cabal-1.10.2.0-072fce39d68f011c6a364057

Re: [Haskell-cafe] [Haskell] [ANNOUNCE] Haskdogs-0.1

2011/9/14 Ivan Lazar Miljenovic : > On 14 September 2011 19:18, Sergey Mironov wrote: >> >> Yes, I forgot to mention PATH. I expect somthing like >> >> export PATH="$HOME/.cabal/bin:$PATH" >> >> in .bash_profile or similar. >> >> Also, I probably should remove hasktags from the build-tools. Better

Re: [Haskell-cafe] Categorized Weaknesses from the State of Haskell 2011 Survey

I think a few examples can go a long way. I remembered seeing a lot of requests for examples in the results, so I went back and skimmed the spreadsheet. I found that 11 of the 34 responses under Library Documentation explicitly called out examples as desirable. Combined with Heinrich's experience

Re: [Haskell-cafe] Error in cabal install of monad-par?

Apropos my previous request for help (below): I think I've managed to diagnose it and fix it myself. It looks like I had a previous version of ghc installed (using 'port install ghc', which installed 6.10.x in /opt/local/bin/. The Haskell Platform seems to install 7.0.3, in /usr/bin/. Looks like c

[Haskell-cafe] Error in cabal install of monad-par?

I'm following the instructions on the CUFP "T5 Parallel Programming in Haskell" web page for preparing for the tutorial, where it asks that I should: 'cabal install monad-par'. I'm doing this on a Mac, Snow Leopard 10.6.8, after installing Haskell Platform. I have Xcode 3.2.4 installed. I get t

Re: [Haskell-cafe] Tupling functions

On Thu, Sep 15, 2011 at 7:51 AM, Markus Läll wrote: > Intuitively it seems to be exactly the same as the type families' > aproach, and looks quite clear too. Not exact, no--as written, it's strictly more powerful. Your fundeps go in both directions, whereas the type families didn't (though could

Re: [Haskell-cafe] efficient chop

On Wed, Sep 14, 2011 at 17:31, Ivan Lazar Miljenovic wrote: > On 15 September 2011 01:24, Sean Leather wrote: > > On Wed, Sep 14, 2011 at 05:03, Kazu Yamamoto wrote: > >> > >> I would like to have an efficient implementation of the chop function. > > > > [...] > > > >> > >> Are there any more effi

Re: [Haskell-cafe] Categorized Weaknesses from the State of Haskell 2011 Survey

Malcolm Wallace wrote: In fact, my wish as a library author would be: please tell me what you, as a beginner to this library, would like to do with it when you first pick it up? Then perhaps I could write a tutorial that answers the questions people actually ask, and tells them how to get the st

Re: [Haskell-cafe] static analysis (call graph) tools?

On 15 September 2011 21:40, Johannes Waldmann wrote: > Dear Cafe, > > what tools are there for static analysis of Haskell programs? > > I mean simple things like the call graph (who is calling whom). > Which are, of course, not that simple because of higher order functions. I just answered a simi

Re: [Haskell-cafe] Tupling functions

Using fundeps I came up with this: class T funs arg res | funs -> arg res, arg res -> funs where tuple :: funs -> arg -> res instance (a ~ a0, a0 ~ a1) => T (a0 -> b, a1 -> c) a (b, c) where tuple (f, g) a = (f a, g a) instance (a ~ a0, a0 ~ a1, a1 ~ a2) => T (a0 -> b, a1 -> c, a2 -> d) a

[Haskell-cafe] static analysis (call graph) tools?

Dear Cafe, what tools are there for static analysis of Haskell programs? I mean simple things like the call graph (who is calling whom). Which are, of course, not that simple because of higher order functions. Do leksah/eclipsefp(/ghc api) have something like "show all uses of an identifier" (ec

Re: [Haskell-cafe] regex-applicative library needs your help! (algorithmic challenge)

If you are worried about Denial Of Service attacks then you are worried about (1) memory explosion, and (2) long runtime. Long runtime can and should be solved by running a timeout connected to a thread killer, not at the level of the regular expression engine. The memory explosion is more intere