- Haskell-Cafe - Haskell.org

Fwd: SBLP 2014 new deadline
by Simon Thompson 04 May '14

04 May '14

CALL FOR PAPERS - NEW DEADLINE: May 23rd 18th Brazilian Symposium on Programming Languages (SBLP 2014) A member of CBSoft joint conference http://www.ic.ufal.br/evento/cbsoft2014/ to be held in Maceio, Brazil. SBLP happens on Thursday, Oct 2nd, and Friday, Oct 3rd. CBSoft dates are September 28, 2014 to October 3, 2014 This CFP is also available at the webpage of the event: http://www.ic.ufal.br/evento/cbsoft2014/en/call-for-papers-sblp.html IMPORTANT DATES Paper abstract submission: May 23rd, 2014 Full paper submission: May 23rd, 2014 Notification of acceptance: June 27th, 2014 Final papers due: July 11th, 2014 INTRODUCTION The 18th Brazilian Symposium on Programming Languages, SBLP 2014, will be held in Maceio, a beautiful city in the Northeastern part of Brazil. The conference will happen on October 2nd, and October 3rd, 2014. SBLP provides a venue for researchers and practitioners interested in the fundamental principles and innovations in the design and implementation of programming languages and systems. SBLP 2014 invites authors to contribute with technical papers related (but not limited) to: * Program generation and transformation, including domain-specific languages and model-driven development in the context of programming languages. * Programming paradigms and styles, including functional, object-oriented, aspect-oriented, scripting languages, real-time, service-oriented, multithreaded, parallel, and distributed programming. * Formal semantics and theoretical foundations, including denotational, operational, algebraic and categorical. * Program analysis and verification, including type systems, static analysis and abstract interpretation. * Programming language design and implementation, including new programming models, programming language environments, compilation and interpretation techniques. SUBMISSIONS Contributions should be written in Portuguese or English. Papers should fall into one of two different categories: full papers, with at most 15 pages, or short papers, with at most 5 pages. Accepted papers written in English will be published in a volume of Lecture Notes in Computer Science (LNCS), by Springer. For this reason, all papers must be prepared using the LNCS template, available at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0. We encourage the submission of short papers reporting partial results of on-going master dissertations or doctoral theses. Submissions should be done through the SBLP 2014 page at EasyChair, which is available at http://www.easychair.org/conferences/?conf=sblp2014. As in previous editions, a journal's special issue, with selected papers from accepted contributions, is anticipated. Selected papers from the 2003 to the 2008 editions of SBLP were published in special issues of the Journal of Universal Computer Science, by Springer. The post-proceedings of SBLP from 2009 to 2012, also with selected papers from the conference, have been published as special issues of Science of Computer Programming, by Elsevier. KEYNOTE SPEAKERS Louis-Noel Pouchet, University of California Los Angeles Fabrice Rastello, INRIA PROGRAMME CHAIR Fernando Magno Quintao Pereira, UFMG PROGRAMME COMMITTEE Alberto Pardo, Universidad de la Republica Alex Garcia, IME Alvaro Moreira, Federal University of Rio Grande do Sul Andre Rauber Du Bois, Federal University of Pelotas Carlos Camar√£o, Federal University of Minas Gerais Christiano Braga, Fluminense Federal University Fabio Mascarenhas, Federal University of Rio de Janeiro Fabrice Rastello, INRIA Fernando Pereira, Federal University of Minas Gerais Fernando Castor, Federal University of Pernambuco Francisco Carvalho-Junior, Federal University of Ceara Hans-Wolfgang Loidl, Heriot-Watt University Jeremy Singer University of Glasgow Jo√£o Saraiva, University of Minho Joao F. Ferreira, Teesside University Louis-Noel Pouchet, University of California, Los Angeles Lucilia Figueiredo, Federal University of Ouro Preto Luis Barbosa, University of Minho Manuel A. Martins, University of Aveiro Marcello Bonsangue, Leiden University Marcelo Maia, Federal University of Uberlandia Marcelo D'Amorim, Federal University of Pernambuco Mariza Bigonha, Federal University of Minas Gerais Martin Musicante, Federal University of Rio Grande do Norte Noemi Rodriguez, PUC-Rio Peter Mosses, Swansea University Rafael Lins, Federal University of Pernambuco Renato Cerqueira, PUC-Rio Roberto Bigonha, Federal University of Minas Gerais Roberto Ierusalimschy PUC-Rio Rodrigo Geraldo, Federal University of Ouro Preto Sandro Rigo, State University of Campinas Sergio Medeiros, Federal University of Rio Grande do Norte Simon Thompson, University of Kent Varmo Vene, University of Tartu Zongyan Qiu Peking University Simon Thompson | Professor of Logic and Computation School of Computing | University of Kent | Canterbury, CT2 7NF, UK s.j.thompson(a)kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt

1 0

Re: [Haskell-cafe] Haskell Programming Font with Ligatures
by Garrett Mitchener 03 May '14

03 May '14

I just tried this in gedit and it looks *really* nice! Thanks for putting this together. Doesn't work in emacs though :-(

4 4

Parsec lookAhead with choice (<|>) doesn't work as expected?
by Baojun Wang 03 May '14

03 May '14

Hi List, There is my first email on haskell-cafe, I must admit haskell is a amazing language even though I found it hard to program. I'm trying to use Parsec to parse a text file something like: format 1) HEADER BODY format 2) BODY BODY = many DATA_FIELDS I must distinguish the format is either 1) or 2), because I need process them differently. So I'm trying to use lookAhead & <|>, something like: format1Header = do HEADER_parser1 HEADER_parser2 return .. format2Header = do -- whatever return .. headerVersion = do version <- (lookAhead format1Header) <|> (lookAhead format2Header) return version Howerver if format1Header parser failed headerVersion just return failure without trying format2Header parser. Full source code is attached, you can load the source then just run ``main'' I searched seems similar issue had been reported: https://groups.google.com/forum/#!topic/fa.haskell/NGjQqR05-TA Is there anything I'm fundamentally wrong with lookAhead and <|> in Parsec? How can I get headerVersion works as expected? Thank you Baojun

3 4

Prevent replicateM_ from repeating expensive (pure) computations
by suhorng Y 01 May '14

01 May '14

Hi all, I've been writing loops in a monad using `replicateM_`. However, recently I discovered that it caused my program become extremely slow. For example, > module Main where > > import Control.Monad (replicateM_) > > fib :: Int -> Int > fib 0 = 0 > fib 1 = 1 > fib n = fib (n-1) + fib (n-2) > > main = do > n <- readLn > let fn = fib n > replicateM_ 20 (print fn) The program ran fine if no optimization is turned on. However, when I used `-O` or `-O2` with GHC (7.4/7.6), the program became extremely slow, and if I replaced `replicateM_` by `mapM_`, the problem disappeared. I suspected that GHC inlined `fn`, causing `replicateM_` to recalculate the value in every loop. Though the problem could be solved by either using `mapM_`, lifting `print fn` to a global definition or manually demanding it be evaluated strictly, I would expected `fn` not to be computed multiple times. Any suggestions around this? Thanks! Sincerely, suhorng

2 1

forLoop + strict State monad is much faster than foldl'
by Niklas Hambüchen 01 May '14

01 May '14

This is just a short notice that using foldl' (+) 0 [0..100000::Int] is over 10 times slower than using flip execState 0 $ forLoop (0 :: Int) (< n) (+1) $ \i -> do x <- get put $! x + i with `loopFor` as on https://github.com/nh2/loop. Even using an IORef is twice as fast as the pure foldl' (but still 5 times slower than strict State). The benchmark is at http://htmlpreview.github.io/?https://github.com/nh2/loop/blob/master/resul…. (All benchmarks are linked from https://github.com/nh2/loop.) You can see there that the problem is gone when using Vector.foldl', but only for Int - for Word32 it persists. It seems that manual looping is beneficial even when dealing with prime examples of pure code that GHC ought to optimize well. Niklas

8 20

ANN: hledger-0.23, hledger-web-0.23
by Simon Michael 01 May '14

01 May '14

I'm pleased to announce hledger and hledger-web 0.23! This release includes command-line fixes and polish, a new accounts command, and a number of changes to the balance command relating to --depth, --flat, and multicolumn mode, which I find has made it much more useful. Release notes: http://hledger.org/release-notes#hledger-023-201451 . Contributors to this release: Peter Simons and Marko Kocić. hledger (http://hledger.org) is a command-line tool and haskell library for tracking financial transactions, which are stored in a human-readable plain text format. It can also read CSV or timelog files. It provides useful reports, and can also help you record new transactions interactively. Add-on commands include hledger-web (a web interface), hledger-irr (for calculating internal rate of return) and hledger-interest (for generating interest transactions). hledger is inspired by and largely compatible with Ledger. Installation: cabal update; cabal install hledger [hledger-web] (see http://hledger.org/installing for help) or sponsor a binary at http://hledger.org/download Best! -Simon

1 0

Re: [Haskell-cafe] Stupid newbie question of the day: why is newMVar in the IO monad
by Ryan Yates 01 May '14

01 May '14

There is extra work done to make this safe. See the following: https://github.com/ghc/ghc/blob/af6746fb6b5adb5ba5be6e0f647c4ebe767ce084/rt… https://ghc.haskell.org/trac/ghc/ticket/5558 Ryan On Thu, May 1, 2014 at 8:25 AM, Mikulas Patocka < mikulas(a)artax.karlin.mff.cuni.cz> wrote: > > Also note linked from the global variables page on the wiki is: > > http://www.haskell.org/haskellwiki/Top_level_mutable_state > > > > Important for the `unsafePerformIO` option is the NOINLINE pragma to > ensure > > that only one global variable exists. In the STM case it is also > important > > to use `newTVarIO` rather then `unsafePerformIO $ atomically newTVar` > which > > does not work. > > > > Ryan > > Hi > > I think it isn't correct even with NOINLINE. > > > Read the paper "Haskell on a Shared-Memory Multiprocessor" > http://research.microsoft.com/pubs/67424/2005-haskell.pdf > > Among other things, the paper presents these ideas: > > (section 3.1) When multiple threads start to evaluate the same thunk > concurrently, we could use interlocked compare-and-swap instruction to > make sure that only one thread starts to evaluate it. However, the > compare-and-swap instruction is slow and executing it at every thunk > evaluation decreases performance. So, the designers avoid the > compare-and-swap instruction (section 3.2) and consequently there is a > race condition - there is a small window where two or more threads may > evaluate the same thunk concurrently. > > Normally, this race condition doesn't matter, because Haskell is purely > functional language, so when multiple threads evaluate the same thunk they > end up with the same result - but in this particular example, where one is > using unsafePerformIO to construct a unique variable, it can hurt, because > you end up executing "unsafePerformIO $ newMVar 0" concurrently (section > 3.5 of the paper). > > > So - code like this isn't correct, the numbers returned by "uniq" may not > be unique if we hit the race condition when evaluating "global": > > global :: MVar Integer > global = unsafePerformIO $ newMVar 0 > {-# NOINLINE global #-} > uniq = modifyMVar global (\i -> return (i+1,i)) > > > Has anything changed since that time, so that this construct is safe? > > Mikulas >

1 0

Dealing with GHC 7.8
by Ivan Lazar Miljenovic 01 May '14

01 May '14

I've been trying to update the various Haskell packages for Exherbo, but for some packages I keep getting errors like this (taken from vector-th-unbox, which is ultimately needed by criterion): runhaskell Setup copy --destdir=/var/tmp/paludis/build/dev-haskell-vector-th-unbox-0.2.0.2/image/ Installing library in /var/tmp/paludis/build/dev-haskell-vector-th-unbox-0.2.0.2/image/usr/lib64/x86_64-linux-ghc-7.8.2/vector-th-unbox-0.2.0.2 Setup: Error: Could not find module: Data.Vector.Unboxed.Deriving with any suffix: ["dyn_hi"] in the search path: ["dist/build"] When trying to find solutions for this, every result happens to be for Windows... which this isn't. Has some way of dealing with building packages using just runhaskell Setup changed? -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com http://IvanMiljenovic.wordpress.com

2 3

Haskell Weekly News: Issue 293
by Daniel Santa Cruz 01 May '14

01 May '14

Welcome to issue 293 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from April 20 to 26, 2014 Quotes of the Week * monochrom: linux's ulimit for main memory will not help because linux kernel's allocator is a lazy yes-man (think irrefutable pattern) * edwardk: lens is the only library I've ever written that generates hate mail and invites to give talks in almost equal measure * shachaf: You don't need lens to produce or consume lenses. You just need it to complain about them. * glguy_: Reddit has shown you don't need to have used the lens package to complain about it, either Top Reddit Stories * What I Wish I Knew When Learning Haskell 2.0 Domain: dev.stephendiehl.com, Score: 191, Comments: 37 On Reddit: [1] http://goo.gl/PkvrnZ Original: [2] http://goo.gl/ljYe4w * Announcing cabal 1.20 Domain: blog.johantibell.com, Score: 141, Comments: 38 On Reddit: [3] http://goo.gl/H16RoZ Original: [4] http://goo.gl/2r3vBH * Lens is unidiomatic Haskell Domain: ro-che.info, Score: 124, Comments: 231 On Reddit: [5] http://goo.gl/Hm7Zbl Original: [6] http://goo.gl/HrI0L6 * wreq: a capable new HTTP client library Domain: serpentine.com, Score: 121, Comments: 128 On Reddit: [7] http://goo.gl/kUZp4s Original: [8] http://goo.gl/y8QFpR * Applicative became a superclass of Monad Domain: ghc.haskell.org, Score: 94, Comments: 46 On Reddit: [9] http://goo.gl/0OIiPz Original: [10] http://goo.gl/DKCUsD * Open Sourced! Cryptol: A Domain Specific Language for Specifying Cryptographic Algorithms Domain: cryptol.net, Score: 91, Comments: 7 On Reddit: [11] http://goo.gl/32oaZd Original: [12] http://goo.gl/30Y9g0 * Model-view-controller, Haskell-style Domain: haskellforall.com, Score: 81, Comments: 55 On Reddit: [13] http://goo.gl/yJH5Ck Original: [14] http://goo.gl/pjqFPN * Lenses don't compose backwards. Domain: self.haskell, Score: 73, Comments: 35 On Reddit: [15] http://goo.gl/p9e9v8 Original: [16] http://goo.gl/p9e9v8 * 14 Haskell Projects accepted for Google Summer of Code Domain: google-melange.com, Score: 59, Comments: 28 On Reddit: [17] http://goo.gl/bw3jrU Original: [18] http://goo.gl/O91dDJ * New issue of The Monad Reader (#23) Domain: themonadreader.wordpress.com, Score: 48, Comments: 11 On Reddit: [19] http://goo.gl/PgFaAg Original: [20] http://goo.gl/M62yM8 * Lens from the ground up Domain: mth.io, Score: 44, Comments: 25 On Reddit: [21] http://goo.gl/7hb2dZ Original: [22] http://goo.gl/W2C4x2 * Lenses You Can Make at Home Domain: duplode.github.io, Score: 40, Comments: 17 On Reddit: [23] http://goo.gl/5Fx3re Original: [24] http://goo.gl/qs2nbt Top StackOverflow Questions * How do experienced Haskell developers approach laziness at *design* time? votes: 26, answers: 1 Read on SO: [25] http://goo.gl/obf2MG * Lax monoidal functors with a different monoidal structure votes: 14, answers: 3 Read on SO: [26] http://goo.gl/gR954y * Maximizing Haskell loop performance with GHC votes: 13, answers: 2 Read on SO: [27] http://goo.gl/TNaeB7 * What does it mean that the semantics (of Haskell) are affected by the inferred types (of return type polymorphism)? votes: 12, answers: 2 Read on SO: [28] http://goo.gl/e702Su * Write a parallel array Haskell expression once, run on CPUs & GPUs with repa and accelerate votes: 10, answers: 2 Read on SO: [29] http://goo.gl/gvSnV8 * Best way to save 10 GB vector to disk in Haskell votes: 9, answers: 3 Read on SO: [30] http://goo.gl/6SjJeG * What is the purpose of the `Typeable (* -> Constraint) Monoid` instance? votes: 9, answers: 1 Read on SO: [31] http://goo.gl/QeLSHm Until next time, [32]+Daniel Santa Cruz References 1. http://dev.stephendiehl.com/hask 2. http://www.reddit.com/r/haskell/comments/23srcm/what_i_wish_i_knew_when_lea… 3. http://blog.johantibell.com/2014/04/announcing-cabal-120.html 4. http://www.reddit.com/r/haskell/comments/23i6ih/announcing_cabal_120/ 5. http://ro-che.info/articles/2014-04-24-lens-unidiomatic.html 6. http://www.reddit.com/r/haskell/comments/23uzpg/lens_is_unidiomatic_haskell/ 7. http://www.serpentine.com/wreq/ 8. http://www.reddit.com/r/haskell/comments/23q8kc/wreq_a_capable_new_http_cli… 9. https://ghc.haskell.org/trac/ghc/browser/ghc/libraries/base/GHC/Base.lhs?re… 10. http://www.reddit.com/r/haskell/comments/23ob5a/applicative_became_a_superc… 11. http://cryptol.net/index.html 12. http://www.reddit.com/r/haskell/comments/23w3su/open_sourced_cryptol_a_doma… 13. http://www.haskellforall.com/2014/04/model-view-controller-haskell-style.ht… 14. http://www.reddit.com/r/haskell/comments/2407hs/modelviewcontroller_haskell… 15. http://www.reddit.com/r/haskell/comments/23x3f3/lenses_dont_compose_backwar… 16. http://www.reddit.com/r/haskell/comments/23x3f3/lenses_dont_compose_backwar… 17. http://www.google-melange.com/gsoc/projects/list/google/gsoc2014 18. http://www.reddit.com/r/haskell/comments/23mfwj/14_haskell_projects_accepte… 19. http://themonadreader.wordpress.com/2014/04/23/issue-23/ 20. http://www.reddit.com/r/haskell/comments/23u25r/new_issue_of_the_monad_read… 21. http://mth.io/talks/lens-from-the-ground-up/ 22. http://www.reddit.com/r/haskell/comments/23z5xb/lens_from_the_ground_up/ 23. http://duplode.github.io/posts/lenses-you-can-make-at-home.html 24. http://www.reddit.com/r/haskell/comments/241aec/lenses_you_can_make_at_home/ 25. http://stackoverflow.com/questions/23280936/how-do-experienced-haskell-deve… 26. http://stackoverflow.com/questions/23316255/lax-monoidal-functors-with-a-di… 27. http://stackoverflow.com/questions/23315001/maximizing-haskell-loop-perform… 28. http://stackoverflow.com/questions/23282921/what-does-it-mean-that-the-sema… 29. http://stackoverflow.com/questions/23202145/write-a-parallel-array-haskell-… 30. http://stackoverflow.com/questions/23247289/best-way-to-save-10-gb-vector-t… 31. http://stackoverflow.com/questions/23277838/what-is-the-purpose-of-the-type… 32. https://plus.google.com/105107667630152149014/about

1 0

ANN: reinterpret-cast - byte-casting word-size numbers
by Niklas Hambüchen 30 Apr '14

30 Apr '14

Announcing the first version of the reinterpret-cast package: Hackage: http://hackage.haskell.org/package/reinterpret-cast Github: https://github.com/nh2/reinterpret-cast Takes the bit representation of a number and uses it for a different numeric type. This is reinterpret_cast from C++ and float f = 1.23; int i = * (int *) &f; from C. I started writing this because the PointCloudLibrary project (PCL) makes RGB colours available as an int-packed format cast to a float value - that's silly but oh the legacy. I was surprised that fast reinterpret casts are not readily available in base or at least GHC, but there are improvements going on (see links in the README). Meanwhile this package is for dealing with it. The way implemented here is the fastest possible way known to me as of now. In particular, it is faster than what data-binary-ieee754 does at the moment. Contributions are very welcome.

1 0