News aggregator

submitted by nuvoo
[link] [2 comments]

The (ever growing) cabal-dev team is happy to announce v. 0.9.2! Cabal-dev is a tool to test development libraries by creating a sandboxed package and dependency build environment. Executing `cabal-dev install` will create a sandbox, named cabal-dev in the current directory, and populate it with the project dependencies, which are built and installed into a package database within the sandbox. This is a bug-fix/maintenance release, but it's worth noting that it is now possible to build cabal-dev from hackage with a recent GHC. We've also decided to focus our efforts to provide support for the current release of GHC, the current Haskell Platform, and the previous Haskell Platform. This is the long-awaited version that actually builds with recent GHC's (7.6, in particular). A great deal of thanks for this release to go to active members of the community who've patiently directed other Haskell users to the github repo for a working cabal-dev, and in particular to the dozens (!) of you who've submitted bug

submitted by PthariensFlame
[link] [3 comments]

How does one create a value of type System.IO.Handle for reading that takes its input from a string instead of a file? I'm looking for the equivalent of java.io.StringReader in Java. Thanks in advance. John

======================================================================== CALL FOR PAPERS 6th International Conference on Software Language Engineering (SLE 2013) Oct 26-28, 2013, Indianapolis, IN, USA (Co-located with SPLASH 2013 and GPCE 2013) General chair: Eric Van Wyk, University of Minnesota, USA Program co-chairs: Martin Erwig, Oregon State University, USA Richard Paige, University of York, UK Keynote speaker: Don Batory, University of Austin, USA http://planet-sl.org/sle2013 ======================================================================== IMPORTANT DATES Deadline for abstracts: June 7, 2013 (Midnight UTC-8, Pacific Standard Time) Deadline for full papers: June 14, 2013 (Midnight UTC-8, Pacific Standard Time) Notification to authors: August 3, 2013 Camera-ready copies due: August 16, 2013 Conference: October 26 -28, 2013 TYPES OF SUBMISSIONS We solicit the following types of papers: - Research papers: These should report a substantial research contribution

Hello guys,

I'm creating some texts about Haskell, and I want to make a "proof" that is possible to write complete programs in Haskell (most of my friends think Haskell as a academic and boring language).

So, what kind of useful program can I create with Haskell? It needs to be challenging, but not complex to understand, and command-line based.

submitted by lsmag
[link] [16 comments]

submitted by jfischoff
[link] [18 comments]

Dmitry Kulagin wrote: HList essentially had those http://code.haskell.org/HList/ HList also implemented records with named fields. Indeed, you need a type-level lookup in an associative list, and for that you need type equality. (The ordinary List.lookup has the Eq constraint, doesn't it?) Type equality can be implemented with type functions, right now. http://okmij.org/ftp/Haskell/typeEQ.html#TTypeable (That page also defined a type-level list membership function).

Hi, I have the following code - It looks like things go okay until concatination is attempted. I get the following output There are 2258 ByteStrings *** Exception: <stdout>: hPutBuf: resource exhausted (Not enough space) I am thinking that I should do strict concatination at each point in the support function - how can I go about doing so? (BS is the lazy.char8 bytestring) connectionGetNBytes :: NC.Connection -> Int -> IO ByteString connectionGetNBytes c n = do bs <- connectionGetNBytes' c n putStrLn ("There are " ++ (show (length bs)) ++ " ByteStrings") return (BS.concat bs) connectionGetNBytes' :: NC.Connection -> Int -> IO [ByteString] connectionGetNBytes' _ 0 = return [] connectionGetNBytes' c n = do l <- NC.connectionGet c n let ll = BS.length l remaining <- connectionGetNBytes' c (n - ll) return (l:crlfStr:remaining) Regards, Kashyap _______________________

Hi, I try to implement typed C-like structures in my little dsl. I was able to express structures using type-level naturals (type Ty is promoted): That allowed to implement all needed functions, including type-level function: But it is not very convenient to identify struct's fields using naturals, and I wanted to change Ty definition to: It is much closer to how C-struct looks, but I was unable to implement required type function: Which just finds a type in a associative list. Could someone give me a hint, how to do it? Or perhaps, is it just impossible thing to do? Thanks! _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe< at >haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Thanks to John Lato and Duncan Coutts for the latest bugfix release! The latest packages should be buildable on GHC 7.6, and the cairo package should behave a bit nicer in ghci on Windows. Thanks to all!

~d