- Haskell-Cafe - Haskell.org

errors while installing yesod 0.8
by Michael Litchard 26 Apr '11

26 Apr '11

Trying to install yesod 0.8 breaks when it's time to install monad-control. Google wasn't very helpful, nor was the error message I received mlitchard@apotheosis:~/monad-control$ cabal install Resolving dependencies... Configuring monad-control-0.2.0.1... cabal: Error: some packages failed to install: monad-control-0.2.0.1 failed during the configure step. The exception was: ExitFailure 11 note: I've been trying to use the cab command to manage my packages, I get the same error as above when I use cab instead of cabal.I mention this just in case there is some unforseen problem having to do with cab/cabal interaction. Has anyone experienced this problem, or know what I can do to get more useful error messages that might reveal the cause of the breakage?

5 20

Storing failing testcases for QuickCheck
by Sönke Hahn 25 Apr '11

25 Apr '11

Hi! I would like to have a library that would allow to use QuickCheck in the normal manner, but it would save test data for failing properties on the filesystem (maybe using the shiny new acid-state?). On consecutive test runs, the saved test data would be used first (before generating new arbitrary test data). I think, this would come in quite handy when doing test driven development. Any comments on this? Does something like this already exist? Cheers, Sönke

3 3

Trouble with currying and uncurrying...
by Angel de Vicente 25 Apr '11

25 Apr '11

Hi, I'm reading "The Craft of Functional Programming" and I found something I don't understand in page 185. It says: "Suppose first that we want to write a curried version of a function g, which is itself uncurried and of type (a,b) -> c. curry g This funtion expects its arguments as a pair, but its curried version, curry g, will take them separately - we therefore have to form them into a pair before applying g to them: curry :: ((a,b) -> c) -> (a -> b -> c) curry g x y = g (x,y) curry multiplyUC will be exactly the same function as multiply." OK, I have tried it and it works, but I don't understand the syntax for curry. Until now I have encountered only functions that take the same number of arguments as the function definition or less (partial application), but this syntax looks a bit new to me. curry is supposed to have as its argument one function of type (a,b) -> c and produce another function, but then the second line gives three arguments to curry, the function itself and the variables x and y. What I'm missing here? Thanks a lot, Ángel de Vicente -- http://www.iac.es/galeria/angelv/ High Performance Computing Support PostDoc Instituto de Astrofísica de Canarias --------------------------------------------------------------------------------------------- ADVERTENCIA: Sobre la privacidad y cumplimiento de la Ley de Protección de Datos, acceda a http://www.iac.es/disclaimer.php WARNING: For more information on privacy and fulfilment of the Law concerning the Protection of Data, consult http://www.iac.es/disclaimer.php?lang=en

4 5

A parallelization problem
by wren ng thornton 24 Apr '11

24 Apr '11

Hello all, I have some loopy code I'd like to make parallel, but I'm not sure the best way to go about it. Everywhere else in this program I'm using STM, but that seems pretty heavy-handed for this task, and it looks like the perfect place for `par` and friends. So the 10,000ft view of the code is something like: foldl' step (0,state0) xs step (n,stateN) x = (n+1, k stateN) where k = case lookup n stateN of Nothing -> error "oh noes" Just substateN -> insert (n+1) $ foldl' maybeInsert empty (views substateN x) maybeInsert state (k,v) | p (k,v) = state | otherwise = insert k v state That is, for each x that comes in we add a bunch of things to a map datastructure. The thing that makes the inner loop parallelizable is that we happen to know that none of the new keys will (a) conflict with old keys (as indicated by the fact that we're nesting maps), (b) conflict with the other new keys, nor (c) depend on the other new key/value pairs. Thus, we know that we can reassociate the order of insertions without changing the semantics. So the question is, how do I do it? One issue not apparent in this high-level look at the code is that I'm actually using ST for doing the inner loop efficiently, which is why I'm not just using fromList. So far I'm using an IntMap for storing the state. The STM approach would be to store the IntMap in a TMVar and fire off threads to compute and insert each one of the views. But even as lightweight as Haskell's threads are, I worry that the overhead would swamp the benefits. (Of course, it may be viable to push the ST down far enough to use (fromList . catMaybes). Then we could just construct the list and call par on all the elements. That wouldn't do much to parallelize the insertions themselves, but that shouldn't matter too much I hope. Perhaps I've just answered my own question; any other ideas?) -- Live well, ~wren

1 0

generics and sql
by nadine.and.henry＠pobox.com 24 Apr '11

24 Apr '11

Dear Group, Greetings. I have a feeling that what I am trying to do is easy, I just don't know how to say it in Haskell. Let's start with: > {-# LANGUAGE > DeriveDataTypeable, GeneralizedNewtypeDeriving #-} > > import Database.HDBC > import Data.Typeable (Typeable) > import Data.Data > data C = C { str :: String, dbl:: Double } > deriving (Eq, Ord, Typeable, Data) > > a :: C > a = C "twelve" 12.0 > Now I load this up in ghci and I can do the following: toSql . str $ a -- result: SqlString "twelve" toSql . dbl $ a -- result: SqlDouble 12.0 but what I would really like to do is something like: gmapQ toSql $ a which results in: <interactive>:1:7: Could not deduce (Convertible d SqlValue) arising from a use of `toSql' from the context (Data d) bound by a type expected by the context: Data d => d -> SqlValue at <interactive>:1:1-11 Possible fix: add (Convertible d SqlValue) to the context of a type expected by the context: Data d => d -> SqlValue or add an instance declaration for (Convertible d SqlValue) In the first argument of `gmapQ', namely `toSql' In the expression: gmapQ toSql In other words, I'm looking for a function with a signature: (Whatever Instances I neeed here) => a -> [SqlValue] I have tried various incantations of type signatures, but thus far I can't get it right. Can someone point me in the right direction? Thanks. Henry Laxen -- Nadine & Henry Laxen Belle, Venus, Aphrodite 10580 N. McCarran Blvd. Adonis, Miss Parker & Jarod Suite 115-396 Via Alta # 6 Reno, Nevada Chapala, Jalisco, Mexico 89503-1896 CP 45900 The rest is silence. (Hamlet)

3 5

How to use cabal's data-files feature and run in-place?
by Richard Cobbe 24 Apr '11

24 Apr '11

I'm running Haskell Platform 2011.2.0.1 on a MacOS 10.6.7 machine (the machine is 64-bit, but I'm running the 32-bit platform). I'm writing an application for personal use, and I'd like to use Cabal to package it up and handle installation. This way, when I'm working on the program, I won't break the reasonably stable installed version and can continue to use it. (I'm not committed to cabal by any means; suggestions for other ways to accomplish the same thing are more than welcome!) I've got some data files I'd like to package with the application, and Cabal's data-files field is the obvious way to do that. The immediate problem, then, is how to access the files -- I can use the generated Paths_pkg module for the "installed" copy of the app, but then I can't run the thing in-place in ghci in the development directory. I did some googling and came across a blog post (http://neilmitchell.blogspot.com/2008/02/adding-data-files-using-cabal.html) which suggested that I provide my own Paths_pkg.hs file that points to the files' location in the development copy. When I build with Cabal, the generated form of this module would override my hand-written one, and it should therefore work in the installed case as well. Unfortunately, that's not happening. Cabal is clearly generating the module; I can see it in dist/build/autogen. But my copy is overriding the autogenerated one, even for cabal builds -- at least, that's what I'm seeing when I run the binary out of dist/build/<package>/<executable>. Is there a way to be able to use data files in both contexts? FWIW, I'm running cabal as runhaskell Setup.hs configure --user runhaskell Setup.hs build Thanks much, Richard

6 8

http://trac.haskell.org/ not redering correctly
by Erik de Castro Lopo 24 Apr '11

24 Apr '11

Hi all, Trac pages aren't rendering correctly. It seems the HTTP server can't find the CSS files. See below. Cheers, Erik erikd > wget --proxy=off http://trac.haskell.org/trac/chrome/common/css/ticket.css -O /dev/null --2011-04-17 20:11:53-- http://trac.haskell.org/trac/chrome/common/css/ticket.css Resolving trac.haskell.org... 178.63.91.44, 2a01:4f8:121:6::1:10 Connecting to trac.haskell.org|178.63.91.44|:80... connected. HTTP request sent, awaiting response... 404 Not Found 2011-04-17 20:11:56 ERROR 404: Not Found. erikd > wget --proxy=off http://trac.haskell.org/trac/chrome/common/css/trac.css -O /dev/null --2011-04-17 20:28:36-- http://trac.haskell.org/trac/chrome/common/css/trac.css Resolving trac.haskell.org... 178.63.91.44, 2a01:4f8:121:6::1:10 Connecting to trac.haskell.org|178.63.91.44|:80... connected. HTTP request sent, awaiting response... 404 Not Found 2011-04-17 20:28:40 ERROR 404: Not Found. -- ---------------------------------------------------------------------- Erik de Castro Lopo http://www.mega-nerd.com/

3 5

Berlin Haskell Meeting
by Sönke Hahn 23 Apr '11

23 Apr '11

Hi all! The next Berlin Haskell Meeting will be next wednesday: Date: Wednesday, April 27th Time: from 20:00 Location: c-base, Rungestrasse 20, 10179 Berlin I hope, this is not on too short notice. Cheers, Sönke

1 0

Pattern matching on lazy bytestrings: how does it work?
by Tom Brow 23 Apr '11

23 Apr '11

I noticed today that I can pattern match against lazy bytestrings when using the OverloadedStrings extension: import Data.ByteString.Char8 () > > import Data.ByteString.Lazy.Char8 > > >> f :: ByteString -> Bool > > f "abc" = True > > f _ = False > > >> main = do > > print $ f $ fromChunks ["abc"] > > print $ f $ fromChunks ["a","bc"] > > When I run the above, I get: True > > True > > Given that pattern matching is based on data constructors, how is it possible that (Chunk "abc Empty) and (Chunk "a" (Chunk "bc" Empty)) match the same pattern? Tom

3 2

naming convention for maybes?
by Evan Laforge 23 Apr '11

23 Apr '11

Here's a simple issue that's been with me for a while. As do many people, I use plural variable names for lists, so if a Block as called 'block' then [Block] is 'blocks'. The other pattern that comes up a lot is 'Maybe Block'. When I have to name it, I call it 'maybe_block', e.g. maybe_block <- lookup something case maybe_block of Just block -> ... However, this maybe_ prefix is rather long and unwieldy. I have considered things like 'm' or 'mb' but they don't suggest Maybe to me. An 'm' prefix or suffix is already implying 'monad'. If '?' were allowed in identifiers I could use it as a suffix. I could just append 'q' and get used to it... lispers did it with 'p' after all. I suppose 'mby' could be ok, but for some reason it just looks ugly to me. 'opt' looks ok, I suppose, but 'optional' doesn't cover the full range of Maybe's usage (i.e. it's strange to call a failed lookup result "optional"). Does anyone else have a nice convention for this? Hopefully something short but intuitive and nicely reading like the plural convention?

7 7