August 2012 - Haskell-Cafe

OS-independent auto-monitoring of a program to do things depending on resource usage at runtime
by Alberto G. Corona 28 Aug '12

28 Aug '12

For a caching library, I need to know the runtime usage of memory of the program and the total amount of memory, the total memory used by all the programs etc. I need not do profiling or monitoring but to do different things inside my program depending on memory usage. The search is difficult because all searches go to profiling utilities which I don´t need. Are there some portable way to to this? . The various monitoring libraries indicates that there are ways to do it, but they seem not to allow runtime "internal automonitoring"

3 3

When is a composition of catamorphisms a catamorphism?
by Sebastien Zany 27 Aug '12

27 Aug '12

>From page 3 of http://research.microsoft.com/en-us/um/people/emeijer/Papers/meijer94more.p… : it is not true in general that catamorphisms are closed under composition When is this true?

2 4

Simple shell scripts
by Eric Tanter 27 Aug '12

27 Aug '12

Hi, Here is a simple shell script (upper.hs): import Data.Char main = interact $ map toUpper which composes fine with other scripts: bash-3.2$ yes | head -n 3 | runghc upper.hs Y Y Y but not always: bash-3.2$ yes | runghc upper.hs | head -n 3 Y Y Y <stdout>: hFlush: resource vanished (Broken pipe) Any idea why this error occurs/how to avoid it? (running just: yes | runghc upper.hs gives the expected infinite stream of Ys) Thanks! -- Éric

3 3

map over Bijections
by Sergey Mironov 27 Aug '12

27 Aug '12

Hi. I need map equivalent for Bijection type which is defined in fclabels: data Bijection (~>) a b = Bij { fw :: a ~> b, bw :: b ~> a } instance Category (~>) => Category (Bijection (~>)) where ... I can define this function as follows: mapBij :: Bijection (->) a c -> Bijection (->) [a] [b] -> Bijection (->) [a] [c] mapBij b1 b = (map (fw b1)) `Bij` (map (bw b1)) but do I really need to do it explicitly? Can I obtain same result using some Category combinators or other common stuff? Sergey

3 3

Compiling Haskell targetting different OS/arch
by Thiago Negri 27 Aug '12

27 Aug '12

Is it possible to compile Haskell code targetting a OS/arch that differs from the one where the compiler (GHC) is running? Thanks.

3 2

Cabal Test-suites + custom preprocessors
by Iain Nicol 26 Aug '12

26 Aug '12

Hi café, I am successfully using a custom preprocessor to build my main executable. In particular, I am using UUAGC to preprocess .ag files into .hs files. My Setup.hs file uses 'uuagcLibUserHook' from the package uuagc-cabal to do this, which in particular overrides Cabal's 'buildHook' for me. Now I am trying to add a test-suite (of type exitcode-stdio-1.0). I want the test suite to be able to import the modules which implement the main program. Unfortunately, building the test suite fails, because the .ag files don't seem to be built into .hs files. Does anybody know if Cabal actually supports using custom preprocessors for building a test-suite? If so, is 'buildHook' still the right hook to override? Thanks, -- Iain

2 3

Munich Haskell Meeting
by Heinrich Hördegen 26 Aug '12

26 Aug '12

Dear all, once again, it's time for our monthly get-together. Functional programmers from Munich and other cities will meet on Wed, 29th of August, at 19h30 at Max-Emanuel-Brauerei in Munich. If you plan to join, please go to http://www.haskell-munich.de/dates and click the button! With hope to meet many of you there, Heinrich

1 0

ANN: Monad.Reader Issue 20
by Edward Z. Yang 25 Aug '12

25 Aug '12

*It’s not dead, it’s resting!* I am pleased to announce that Issue 20 of the Monad Reader is now available. http://themonadreader.files.wordpress.com/2012/08/issue20.pdf Issue 20 consists of the following three articles: - "Enumeration of Tuples with Hyperplanes" by Tillmann Vogt - "Understanding Basic Haskell Error Messages" by Jan Stolarek - "The MapReduce type of a Monad" by Julian Porter Feel free to browse the source files. You can check out the entire repository using Git: git clone https://github.com/ezyang/tmr-issue20.git If you’d like to write something for Issue 21, please get in touch! Cheers, Edward

1 0

formal semantics
by Ramana Kumar 25 Aug '12

25 Aug '12

Dear Haskell Cafe I'm looking for information on past and current attempts to write semantics for Haskell. Features I'm particularly interested in are: - formal - mechanised - maintainable - up to date Of course, if nothing like that exists then partial attempts towards it could still be useful. My ultimate aims include: 1. Make it viable to define Haskell formally (i.e. so mechanised semantics can take over the normative role of the Haskell reports). 2. Write a verified (or verify an existing) Haskell compiler (where verified means semantics preserving). Cheers, Ramana

5 11

Dealing poker hands, redux
by Matthew 25 Aug '12

25 Aug '12

So I've finally got some code which shuffles a deck of cards and deals out an arbitrary number of hands. https://gist.github.com/19916435df2b116e0edc type DealerState = State [Card] [[Card]] deck :: [Card] deck = [ (s, r) | s <- suits, r <- ranks ] shuffleDeck :: Int -> RVar [Card] shuffleDeck n = shuffle $ concat $ replicate n deck deal :: Int -> ([[Card]] -> DealerState) deal n = \xs -> state $ \s -> (xs ++ [take n s], drop n s) -- |Deal a number of hands a number of cards each. dealHands :: Int -> Int -> ([[Card]] -> DealerState) dealHands hs cs = foldr1 (<=<) $ replicate hs (deal cs) First of all, I have no idea if this is any good. The way I end up calling dealHands and getting a "real" result is `runState (dealHands 3 7 []) deck`. And I see that I've got nested lambdas all in `deal`. But hey it took me forever to figure it out and it "works." I'm using `shuffle` from Data.Random.Extras, which results in an RVar, and thus the beginning of my perplexity. I'm happy to end up with RVar inside a State monad, but I'm not sure where to start. To be honest, I'm only barely understanding what I'm doing with the State monad as it is. :) Happy for any help whatsoever! - Matthew

2 1