- Haskell-Cafe - Haskell.org

Re: [Haskell-cafe] OT: the format checker for ICFP 2010 papers, help!
by Wouter Swierstra 01 Apr '10

01 Apr '10

I just thought I'd pass on Stephanie's response, as she couldn't post to the list: > It looks like the SIGPLAN class file has gotten out of sync with the paper requirements and > is producing a slightly too large textblock. I just checked the template (filled out with random text) > against the format checker. It fails. > > In this situation, it seems wisest to go with the class file instead of the stated height requirement. > I've upped the format checker to a max 9.5in height to account for this discrepancy. Hope this helps, Wouter

1 0

OT: the format checker for ICFP 2010 papers, help!
by Iustin Pop 01 Apr '10

01 Apr '10

This is off-topic, apologies in advance, but I hope people here have experience with this. I submitted a paper for ICFP but the paper checker says: “Margins too small: text block bigger than maximum 7in x 9in on pages 1–6 by 4–5% in at least one dimension”. Now, I've used the standard class file and template, didn't alter any of the margins/columns spacing, my paper size is set to letter, and pdflatex doesn't give me any overfull hboxes. Does anyone know why the error happens in this case? Also, if the format checker is available somewhere for download so that I can pre-check my paper, that'd be great. thanks, iustin

3 3

ANN: fastirc 0.2.0
by Ertugrul Soeylemez 01 Apr '10

01 Apr '10

[For some reason, my Mail to the 'haskell' list was rejected. I have contacted the mailing list owner and am posting here instead.] Hello there fellow Haskellers, I'm developing a library called 'fastirc' for fast and convenient Internet Relay Chat (IRC) software development. It uses attoparsec and ByteStrings and the latest release also includes a client framework, which you can use to write bots and user agents easily. Here is the Hackage page: http://hackage.haskell.org/package/fastirc Even though I marked the library as 'alpha' quality, it seems to work well currently. Feel free to try it out and if you find anything odd, just drop me a message (or a patch). =) If you would like to contribute, please contact me first, so I can tell you whether your ideas would be incorporated into the 'fastirc' package or whether it would be better to fork off a new project. By the way, please note that although unlikely right now the interface might change slightly from release to release. I'm planning to stabilize it by version 0.4.0. Also note that the library uses monadLib instead of mtl/transformers, where the monad transformer interface is slightly different. Particularly inside the 'Bot' monad you can run IO computations using 'inBase' instead of 'liftIO'. For more differences, just read the monadLib docs. I hope it will be useful. Greets, Ertugrul -- nightmare = unsafePerformIO (getWrongWife >>= sex) http://blog.ertes.de/

1 0

Re: [Haskell-cafe] Where are the haskell elders?
by gladstein＠gladstein.com 01 Apr '10

01 Apr '10

>Perhaps without spewing it to thousands of readers while you're at it? Ahem.

1 0

new focus for Happstack
by Jeremy Shaw 01 Apr '10

01 Apr '10

Hello, I've been thinking a lot recently about the direction and future of the Happstack project. These days we hear a lot about technologies to allow servers to push data, such as Comet, Ajax Push, Reverse Ajax, Two-way-web, HTTP Streaming, and HTTP server push among others. HTML 5 includes something called 'Web Sockets'. In short, it seems that the 'stateless' web model is a complete failure. People want sockets! Furthermore, the big sites of the day are 'social media' sites such as Facebook, Twitter, Youtube, Four Square, etc. Well, it's clear to me where the industry is headed, and I think this is a great chance for Haskell to be the leader. persistent connection + social web site == BBS That's right! The return of the BBS is upon us. So, without further ado, I would like to announce the happstack-bbs project: darcs get http://src.seereason.com/happstack-bbs/ You can connect right now to the world's newest Haskell BBS. Simple open a terminal which supports ansi & utf-8, and run: telnet hacketeria.com 2525 Patches welcome (and sorely needed!) - jeremy

3 2

Intro to Haskell Crypto Libs
by Günther Schmidt 01 Apr '10

01 Apr '10

Hi all, I'm just starting with Haskells Crypto Libs. Is there a good intro to the subject? I intend to use it for license key generation. Günther

2 1

benchmarking pure code
by Paul Brauner 01 Apr '10

01 Apr '10

Hello, I'm writing a library for dealing with binders and I want to benchmark it against DeBruijn, Locally Nameless, HOAS, etc. One on my benchmark consists in 1. generating a big term \x.t 2. substituting u fox in t The part I want to benchmark is 2. In particular I would like that: a. \x.t is already evaluated when I run 2 (I don't want to measure the performances of the generator) b. the action of substituting u for x in t were measured as if I had to fully evaluate the result (by printing the resulting term for instance). After looking at what was available on hackage, i set my mind on strictbench, which basically calls (rnf x `seq` print "") and then uses benchpress to measure the pure computation x. Since I wanted (a), my strategy was (schematically): let t = genterm rnf t `seq` print "" bench (subst u t) I got numbers I didn't expect so I ran the following program: let t = genterm print t bench (subst u t) and then I got other numbers! Which were closer to what I think they should be, so I may be happy with them, but all of this seems to indicate that rnf doesn't behave as intended. Then I did something different: I wrote two programs. One that prints the result of (subst u t): let t = genterm let x = (subst u t) print x bench (print x) recorded the numbers of that one and then ran the program: let t = genterm bench (print (subst u t)) got the numbers, and substracted the first ones to them. By doing so, I'm sure that I get realistic numbers at least: since I print the whole resulting term, I've got a visual "proof" that it's been evaluated. But this is not very satisfactory. Does anyone have an idea why calling rnf before the bench doesn't seem to "cache" the result as calling show does? (my instances of NFData follow the scheme described in strictbench documentation). If not, do you think that measuring (computation + pretty printing time - pretty printing time) is ok? Regards, Paul

4 8

why doesn't time allow diff of localtimes ?
by briand＠aracnet.com 01 Apr '10

01 Apr '10

which is a variation of the question, why can't I compare localtimes ? or am I missing something in Time (yet again). Thanks, Brian

5 6

Re: building "encoding" on Windows?
by John Lato 01 Apr '10

01 Apr '10

> From: Andrew Coppin <andrewcoppin(a)btinternet.com> > >> A new version is due to be release >> pretty soon (somewhere begin april). It has Mingw and Msys included, and >> also some pre-built binaries like cabal and haddock. > > Plain GHC has included Haddock for a while now. It seems to me that > including the entirity of MinGW and MSYS is overkill, but what do I know > about the matter? I was however under the impression that to use Unix > emulators such as these, you have to run everything from a seperate > shell rather than the usual Windows shell. MSys is probably unnecessary, but mingw is necessary to to get configure scripts to run. I wholeheartedly applaud including both of these, because a lot more of hackage will really be just a "cabal install" away. MSys is the separate shell, but you can use mingw with the Windows "cmd" shell if you wish. > > My hope is that the more useful C libraries will get added to HP so that > I can start using them. (E.g., I'd love to be able to do sound synthesis > using Haskell, but there aren't any libraries for accessing the sound > hardware...) I've gotten portaudio to work on Windows. You'll probably need to build and install the C portaudio library manually. John

1 0

ANN: logfloat 0.12.1
by wren ng thornton 01 Apr '10

01 Apr '10

-------------------------------------------- -- logfloat 0.12.1 -------------------------------------------- This package provides a type for storing numbers in the log-domain, primarily useful for preventing underflow when multiplying many probabilities as in HMMs and other probabilistic models. The package also provides modules for dealing with floating numbers correctly. -------------------------------------------- -- Changes since 0.12.0.1 -------------------------------------------- * Fixed a number of bugs where LogFloat values would become NaN when they should not. These bugs involved using normal-space positive infinity and so would not affect clients using the package for probabilities. The fixes do introduce some extra checks though. If anyone is using the package for probabilities in a large enough project and could run some benchmarks to see how 0.12.1 compares to 0.12.0.1 I'd love to hear the results. (I'm not sure that doing microbenchmarks would actually give much insight about real programs.) If the overhead is bad enough I can add a LogProb type which ensures things are proper probabilities in order to avoid the new checks. -------------------------------------------- -- Compatibility / Portability -------------------------------------------- The package is compatible with Hugs (September 2006) and GHC (6.8, 6.10, 6.12). For anyone still using GHC 6.6, the code may still work if you replace LANGUAGE pragma by equivalent OPTIONS_GHC pragma. The package is not compatible with nhc98 and Yhc because Data.Number.RealToFrac uses MPTCs. The other modules should be compatible. -------------------------------------------- -- Links -------------------------------------------- Homepage: http://code.haskell.org/~wren/ Hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/logfloat Darcs: http://code.haskell.org/~wren/logfloat/ Haddock (Darcs version): http://code.haskell.org/~wren/logfloat/dist/doc/html/logfloat/ -- Live well, ~wren

1 0