- Haskell-Cafe - Haskell.org

ANNOUNCE: grid-1.1
by Amy de Buitléir 10 Sep '12

10 Sep '12

I'm happy to announce a new package called grid: http://hackage.haskell.org/package/grid https://github.com/mhwombat/grid/wiki (wiki) Grid provides tools for working with regular arrangements of tiles, such as might be used in a board game or self-organising map (SOM). Grid currently supports triangular, square, and hexagonal tiles, with various 2D and toroidal layouts. If you need a tile shape or layout that isn't currently provided, please let me know. See Math.Geometry.Grid for an example of how to use the package. Suggestions for improvement are welcome.

6 8

ANNOUCE: Haddock 2.10.0 and 2.11.0
by David Waern 09 Sep '12

09 Sep '12

-------------------------------------------- -- Haddock 2.10.0 and 2.11.0 -------------------------------------------- Two new versions of Haddock have been uploaded to Hackage: version 2.10.0 which comes with GHC 7.4.2 and 2.11.0 which comes with the new GHC 7.6.1! -------------------------------------------- -- Changes in version 2.12.0 -------------------------------------------- * Labeled URLs (e.g <http://example.net/ some label>) * Improved memory usage (new dependency: deepseq) -------------------------------------------- -- Changes in version 2.11.0 -------------------------------------------- * Show deprecation messages for identifiers * List identifiers declared on the same line (with a common type) separately * Don't crash on unicode strings in doc comments * Fix reporting of modules safe haskell mode * Fix a case where we were generating invalid xhtml * Improved --qual option (no crashes, proper error messages) * A new --qual option "aliased" which qualifies identifers by the module alias used in the source code * The Haddock API restores GHC's static flags after invocation * Access to unexported identifiers through the Haddock API again -------------------------------------------- -- Links -------------------------------------------- Homepage: http://www.haskell.org/haddock Hackage page: http://hackage.haskell.org/package/haddock-2.12.0 Bugtracker and wiki: http://trac.haskell.org/haddock Mailing list: haddock(a)projects.haskell.org Code repository: http://darcs.haskell.org/haddock.git -------------------------------------------- -- Contributors -------------------------------------------- The following people contributed patches to this release: Paolo Capriotti Simon Hengel Ian Lynagh Simon Peyton Jones Iavor S. Diatchki David Terei Henning Thielemann David Waern -------------------------------------------- -- Get Involved -------------------------------------------- We would be very happy to get more contributors. To get involved, start by grabbing the code: http://darcs.haskell.org/haddock.git Then take a look at the bug and feature tracker for things to work on: http://trac.haskell.org/haddock

4 4

package categories
by Sergey Mironov 09 Sep '12

09 Sep '12

Hello list. Do we have a guideline for selecting correct category for a package being developed? I'd like to choose between Web.MyLib and Network.MyLib. Or probably just MyLib if I feel ambitious? Sergey.

2 1

ANNOUNCE vkhs-0.0.3
by Sergey Mironov 08 Sep '12

08 Sep '12

I'm happy to announce a new package called VKHS: http://hackage.haskell.org/package/VKHS https://github.com/ierton/vkhs VKHS provides access to Vkontakte [1] (popular Russian social network) API methods. Library can be used to login into the network as a standalone application (OAuth implicit flow as they call it). Interaction with user is not required. For now, vkhs offers limited error detection and no captcha support. Here is an example code: import Web.VKHS.Login import Web.VKHS.Api main = do let client_id = "111111" -- application id, register first let user_of_interest = "222222" let e = env client_id "user(a)example.com" "password" [Photos,Audio,Groups] (Right at) <- login e (Right ans) <- api e at "users.get" [ ("uids",user_of_interest) , ("fields","first_name,last_name,nickname,screen_name") , ("name_case","nom") ] putStrLn ans Internally, library uses small curl-based HTTP automata and tagsoup for jumping over relocations and submitting various 'Yes I agree' forms. Sergey. [1] - http://vk.com

1 0

Haskell with all the safeties off
by David Feuer 08 Sep '12

08 Sep '12

I have no plans to do such a thing anytime soon, but is there a way to tell GHC to allow nasal demons to fly if the program forces bottom? This mode of operation would seem to be a useful optimization when compiling a program produced by Coq or similar, enabling various transformations that can turn bottom into non-bottom, eliminating runtime checks in incomplete patterns, etc.

4 5

ANN: LambdaCube 3D (purely functional rendering engine) is back in business
by Patai Gergely 08 Sep '12

08 Sep '12

Hello all, We recently rebooted the LambdaCube project, which aims to provide a purely functional interface for GPU programming. The details and the background are described in our new blog [1], while the code can be found on GitHub [2]. Cheers, Gergely [1] http://lambdacube3d.wordpress.com/ [2] https://github.com/csabahruska/lc-dsl -- http://www.fastmail.fm - The professional email service

3 2

performance issues with popCount
by Harald Bögeholz 08 Sep '12

08 Sep '12

Dear Haskell Cafe, I am struggling with the performance of the popCount function from Data.Bits. To be more precise: I downloaded the Haskell Platform 2012.2.0.0 from http://hackage.haskell.org/platform/ (64 bit, Mac OS X). In this version I found the popCount function to be broken. If I look in the online documentation at http://hackage.haskell.org/packages/archive/base/4.5.1.0/doc/html/src/Data-… it is already fixed, but included with my Haskell Platform was the broken version. Anyway, I tried this version popCount :: Integer -> Int popCount = go 0 where go c 0 = c go c w = go (c+1) (w .&. (w - 1)) and profiling showed that my program spent 80 % of its time counting bits. So I thought I'm clever and implement a table-based version like this: popCount' :: Integer -> Int popCount' = go 0 where go c 0 = c go c w = go (c+1) (w .&. (w - 1)) popCountN = 10 popCountMask :: Integer popCountMask = shift 1 popCountN - 1 popCountTable :: Array Integer Int popCountTable = listArray (0, popCountMask) $ map popCount' [0 .. popCountMask] popCount :: Integer -> Int popCount 0 = 0 popCount x = popCountTable ! (x .&. popCountMask) + popCount (x `shiftR` popCountN) turns out this is even slower ... now my program spends 90 % of its time counting bits :-(. Any hints? Thanks -- Harald Bögeholz <bo(a)ct.de> (PGP key available from servers) Redaktion c't Tel.: +49 511 5352-300 Fax: +49 511 5352-417 http://www.ct.de/ int f[9814],b,c=9814,g,i;long a=1e4,d,e,h; main(){for(;b=c,c-=14;i=printf("%04d",e+d/a),e=d%a) while(g=--b*2)d=h*b+a*(i?f[b]:a/5),h=d/--g,f[b]=d%g;} (Arndt/Haenel) Affe Apfel Vergaser /* Heise Zeitschriften Verlag GmbH & Co. KG * Karl-Wiechert-Allee 10 * 30625 Hannover * Registergericht: Amtsgericht Hannover HRA 26709 * Persönlich haftende Gesellschafterin: Heise Zeitschriften Verlag * Geschäftsführung GmbH * Registergericht: Amtsgericht Hannover, HRB 60405 * Geschäftsführer: Ansgar Heise, Dr. Alfons Schräder */

4 5

parsing ghc type errors
by Semen Trygubenko 07 Sep '12

07 Sep '12

Dear Haskell-cafe, When dealing with ghc type errors I often see messages like Couldn't match expected type `ghc-prim:GHC.Types.IO{tc 32I} MyTypeNameHere{tc r1d8}' with actual type `ghc-prim:GHC.Types.IO{tc 32I} MyOtherTypeNameHere{tc r1d8}' Could you please help me understand the meaning of the entities in {} and why are they useful, or point to a source of information about them? Messages where familiar types are referenced are easy to read, but occasionally I get messages of the sort with actual type `[( b0{tv t3p} [tau] :: ghc-prim:GHC.Prim.*{(w) tc 34d} )]' How do I go about reading the type [( b0{tv t3p} [tau] :: ghc-prim:GHC.Prim.*{(w) tc 34d} )] ? E.g., where the names 'b0' and '[tau]' come from? What does '(w)' in '{(w) tc 34d}' mean? Thank you, Semen -- Семен Тригубенко

1 0

ANNOUNCE: haskell-src-exts 1.13.5
by Niklas Broberg 07 Sep '12

07 Sep '12

Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.13.5! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * Darcs repo: http://code.haskell.org/haskell-src-exts There are two primary reasons for this release: 1) to add the requested support for UHC's 'js' FFI calling convention (in 1.13.4), and 2) to export a stand-alone token stream lexer (in 1.13.5). NOTE: If after reading the above, you think "wow, a token stream lexer, I'll use that for some kind of refactoring tool", then you're most likely wrong. Please contact me in that case and I'll tell you why. :-) A probably unnecessary warning: This release may fail to parse some files that were previously possible to parse, if they included RULES pragmas using 'forall' as a varid. I really doubt any such exist, and they would not have been accepted by GHC if they did, so I sincerely doubt that anyone will be effected by this. Changelog: 1.13.4 --> 1.13.5 =============== * Expose Language.Haskell.Exts.Lexer, which implements a standalone token stream lexer. The module is re-exported both by Language.Haskell.Exts and by Language.Haskell.Exts.Annotated. 1.13.3 --> 1.13.4 =============== * Fix bug where operators starting with # written in parentheses would not be parsed when UnboxedTuples is turned on. Now works. * Allow 'family' and 'forall' as (non-type) varid's. This adds one more shift/reduce conflict to the parser, and its resolution means that '{-# RULES "name" forall = ... #-}' is not allowed. * Complete the set of FFI calling conventions from the Haskell 2010 report (even if no compiler implements them). Also include the 'js' calling convention, supported by UHC. Cheers, /Niklas

1 0

From monads to monoids in a small category
by Alberto G. Corona 06 Sep '12

06 Sep '12

"Monads are monoids in the category of endofunctors" This Monoid instance for the endofunctors of the set of all elements of (m a) typematch in Haskell with FlexibleInstances: instance Monad m => Monoid (a -> m a) where mappend = (>=>) -- kleisly operator mempty = return The article can be found here: http://haskell-web.blogspot.com.es/2012/07/from-monads-to-monoids-in-small.… I would appreciate some comments.

4 7