- Haskell - Haskell.org

Haskell Weekly News: Issue 220
by Daniel Santa Cruz 29 Mar '12

29 Mar '12

Welcome to issue 220 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of March 18 to 24, 2012. Quotes of the Week * shachaf: Type classes are a scary story that you tell new Haskellers so they can go to sleep at night. * acowley: Parametric polymorphism is the inspiring story you tell them to get them riled up and raring to go. It's like Braveheart for programmers. * monochrom: the purpose of types is to ban more programs * rostayob: I was a type constructor, then I took an arrow in the kind * shachaf: @let otherfoolish = not otherwise * flebron: Monoidal objects in the monoidal category of endofunctors on a category. I took a small detour through tensor products to understand monoidal categories better, with one example of such a product. mauke: I have no idea what you just said * weexplat: starts a proposal to replace launchMissiles with atomicDestroyBiosphere * monochrom: rumour: SPJ will write a thick book "A New Science of Kind" * JonathanShapiro: [on abandoning BitC] "And I *still* don't believe in monads. :-)" Top Reddit Stories * Starting the Mezzo Haskell Book Domain: yesodweb.com, Score: 58, Comments: 28 On Reddit: [1] http://goo.gl/pOSlR Original: [2] http://goo.gl/ecy4O * First patches for iPhone cross compiler against GHC head Domain: haskell.org, Score: 55, Comments: 27 On Reddit: [3] http://goo.gl/OOAai Original: [4] http://goo.gl/p7C3L * Retrospective thoughts on BitC by its author, and why type classes didn't work for him Domain: coyotos.org, Score: 44, Comments: 22 On Reddit: [5] http://goo.gl/0sL80 Original: [6] http://goo.gl/5pCp2 * Google Summer of Code 2012 - Haskell.org is participating Domain: haskell.org, Score: 42, Comments: 11 On Reddit: [7] http://goo.gl/9EwzD Original: [8] http://goo.gl/XqcUJ * Conduits vs. Pipes. Using Void as an Input or Output type can reduce the number of concepts (source, sink, conduit) from 3 to 1 (pipe). Domain: twanvl.nl, Score: 34, Comments: 50 On Reddit: [9] http://goo.gl/bc8RB Original: [10] http://goo.gl/eb7oz * Announcing conduit 0.3 Domain: yesodweb.com, Score: 33, Comments: 9 On Reddit: [11] http://goo.gl/JrgV0 Original: [12] http://goo.gl/OsDl7 * Haskell for embedded domain-specific languages (Functional Programming eXchange 2012) Domain: skillsmatter.com, Score: 31, Comments: 4 On Reddit: [13] http://goo.gl/pSREX Original: [14] http://goo.gl/1azVh * Domain theory course Domain: cs.nott.ac.uk, Score: 31, Comments: 5 On Reddit: [15] http://goo.gl/5VHyG Original: [16] http://goo.gl/o2pRC * ANNOUNCE: options, an easy-to-use command-line option parser Domain: self.haskell, Score: 29, Comments: 21 On Reddit: [17] http://goo.gl/s6ktw Original: [18] http://goo.gl/s6ktw * A Case Study in Creating Rich Internet Apps in Haskell (Silk at FP eXchange 2012) Domain: skillsmatter.com, Score: 22, Comments: 18 On Reddit: [19] http://goo.gl/ZdtDq Original: [20] http://goo.gl/Ta2HQ * It just occurred to me that (lift .) defines a functor... Domain: self.haskell, Score: 22, Comments: 15 On Reddit: [21] http://goo.gl/GMzPt Original: [22] http://goo.gl/GMzPt Top StackOverflow Questions * Haskell platform: nested functions and optimization votes: 15, answers: 2 Read on SO: [23] http://goo.gl/nreIr * newtype with RankNTypes votes: 14, answers: 2 Read on SO: [24] http://goo.gl/UT9DV * Pattern Matching - Prolog Vs Haskell votes: 13, answers: 4 Read on SO: [25] http://goo.gl/3hZV1 * How does this definition of ArrowLoop.loop work? votes: 13, answers: 2 Read on SO: [26] http://goo.gl/ocSCM * Data.Set : does it always know best? votes: 12, answers: 2 Read on SO: [27] http://goo.gl/NUjkB * Building a histogram with haskell, many times slower than with python votes: 11, answers: 3 Read on SO: [28] http://goo.gl/kbh5i * What is the scope of let when used without in? votes: 11, answers: 2 Read on SO: [29] http://goo.gl/bNwna * Strange "half to even" rounding in different languages [closed] votes: 11, answers: 3 Read on SO: [30] http://goo.gl/lnPch * Practical reasons for Сhurch Encoding votes: 10, answers: 1 Read on SO: [31] http://goo.gl/xYoef * Can the FFI deal with arrays? If so, how? votes: 9, answers: 3 Read on SO: [32] http://goo.gl/d4R3H Until next time, Daniel Santa Cruz References 1. http://www.yesodweb.com/blog/2012/03/start-mezzo-haskell 2. http://www.reddit.com/r/haskell/comments/r9xdq/starting_the_mezzo_haskell_b… 3. http://www.haskell.org/pipermail/iphone/2012-March/000120.html 4. http://www.reddit.com/r/haskell/comments/r3ge7/first_patches_for_iphone_cro… 5. http://www.coyotos.org/pipermail/bitc-dev/2012-March/003300.html 6. http://www.reddit.com/r/haskell/comments/rbk7z/retrospective_thoughts_on_bi… 7. http://www.haskell.org/pipermail/haskell-cafe/2012-March/100247.html 8. http://www.reddit.com/r/haskell/comments/r5h81/google_summer_of_code_2012_h… 9. http://twanvl.nl/blog/haskell/conduits-vs-pipes 10. http://www.reddit.com/r/haskell/comments/rbgvz/conduits_vs_pipes_using_void… 11. http://www.yesodweb.com/blog/2012/03/announcing-conduit-0-3 12. http://www.reddit.com/r/haskell/comments/r6wdh/announcing_conduit_03/ 13. http://skillsmatter.com/podcast/scala/haskell-for-embedded-domain-specific-… 14. http://www.reddit.com/r/haskell/comments/r22d6/haskell_for_embedded_domains… 15. http://www.cs.nott.ac.uk/~gmh/domains.html 16. http://www.reddit.com/r/haskell/comments/r250h/domain_theory_course/ 17. http://www.reddit.com/r/haskell/comments/rbpmb/announce_options_an_easytous… 18. http://www.reddit.com/r/haskell/comments/rbpmb/announce_options_an_easytous… 19. http://skillsmatter.com/podcast/home/silkapp-a-case-study-in-creating-rich-… 20. http://www.reddit.com/r/haskell/comments/r1xey/a_case_study_in_creating_ric… 21. http://www.reddit.com/r/haskell/comments/raxsk/it_just_occurred_to_me_that_… 22. http://www.reddit.com/r/haskell/comments/raxsk/it_just_occurred_to_me_that_… 23. http://stackoverflow.com/questions/9757515/haskell-platform-nested-function… 24. http://stackoverflow.com/questions/9779301/newtype-with-rankntypes 25. http://stackoverflow.com/questions/9780779/pattern-matching-prolog-vs-haske… 26. http://stackoverflow.com/questions/9856342/how-does-this-definition-of-arro… 27. http://stackoverflow.com/questions/9755851/data-set-does-it-always-know-best 28. http://stackoverflow.com/questions/9772098/building-a-histogram-with-haskel… 29. http://stackoverflow.com/questions/9777399/what-is-the-scope-of-let-when-us… 30. http://stackoverflow.com/questions/9829769/strange-half-to-even-rounding-in… 31. http://stackoverflow.com/questions/9806729/practical-reasons-for-hurch-enco… 32. http://stackoverflow.com/questions/9854782/can-the-ffi-deal-with-arrays-if-…

1 0

ANNOUNCE: haskell-src-exts-1.12.0
by Niklas Broberg 27 Mar '12

27 Mar '12

Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.12.0! * 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 It's been a long while since the last update before this, but it is my definite hope that I will once again be able to update regularly. This major release primarily enables the (relatively) new quasi-quoter syntax. The "major" version bump is questionable, but better safe than sorry. The only backwards incompatible change is that pretty- and exact-printing now use the new quasi-quoter syntax, which makes the round-tripping 'exactPrint . parse' cycle fail for code using the old syntax. There are more changes in the pipeline, some larger and some smaller. Stay tuned! Changelog: 1.11.1 --> 1.12.0 =============== * Move from old [$...| quasi-quote syntax to the new [...| one. The old syntax is still recognized while parsing. * Allow symbols as variables when TypeOperators is enabled. * Rename ExplicitForall in ExplicitForAll, to be consistent with GHC and the Haskell' process. Cheers, /Niklas

2 1

ANNOUNCE: GHC version 7.2.1
by Ian Lynagh 26 Mar '12

26 Mar '12

============================================================= The (Interactive) Glasgow Haskell Compiler -- version 7.2.1 ============================================================= The GHC Team is pleased to announce a new major release of GHC, 7.2.1. The 7.2 branch is intended to be more of a "technology preview" than normal GHC stable branches; in particular, it supports a significantly improved version of DPH, as well as new features such as compiler plugins and "safe Haskell". The design of these new features may evolve as we get more experience with them. See the release notes for more details of what's new and what's changed. We are also using this branch as an opportunity to work out the best workflows to use with git. We expect the 7.2 branch to be short-lived, with 7.4.1 coming out shortly after ICFP as normal. Full release notes are here: http://www.haskell.org/ghc/docs/7.2.1/html/users_guide/release-7-2-1.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

4 3

ADPfusion: Efficient, high-level dynamic programming
by Christian Höner zu Siederdissen 25 Mar '12

25 Mar '12

ADPfusion combines stream-fusion (using the stream interface provided by the vector library) and type-level programming to provide highly efficient dynamic programming (DP) combinators. You can write DP programs in a style similar to Algebraic Dynamic Programming (ADP) (Giegerich et al.), meaning symbolically without explicit indices. The symbolic operators provide a number of advantages: - take care of extracting the correct cell information from data structures (DP matrices) - no more index problems, the grammars are completely free of index calculations by the user - complex operators can be written with "next step" behaviour dependent on other information calculated during runtime - monadic interface - works with pure/monadic, boxed/unboxed, ... data structures - speed close to optimized C (between 1.8x - 3x slower currently -- compared to well-optimized C-code) Hackage: http://hackage.haskell.org/package/ADPfusion 1st example program: http://hackage.haskell.org/package/Nussinov78 Many thanks to Roman Leshchinskiy! Viele Gruesse, Christian Hoener zu Siederdissen ADP: http://bibiserv.techfak.uni-bielefeld.de/adp/adpapp.html

1 0

ANNOUNCE: options, an easy-to-use command-line option parser
by John Millikin 24 Mar '12

24 Mar '12

Hackage: http://hackage.haskell.org/package/options Home page: https://john-millikin.com/software/haskell-options/ API reference: https://john-millikin.com/software/haskell-options/reference/haskell-option… The options package lets library and application developers easily work with command-line options. The following example is a full program that can accept two options, --message and --quiet: ---------------------------------------------------------- {-# LANGUAGE TemplateHaskell #-} import Options defineOptions "MainOptions" $ do stringOption "optMessage" "message" "Hello world!" "A message to show the user." boolOption "optQuiet" "quiet" False "Whether to be quiet." main :: IO () main = runCommand $ \opts args -> do if optQuiet opts then return () else putStrLn (optMessage opts) ---------------------------------------------------------- ---------------------------------------------------------- $ ./hello Hello world! $ ./hello --message='ciao mondo' ciao mondo $ ./hello --quiet $ ---------------------------------------------------------- In addition, this library will automatically create documentation options such as --help and --help-all: ---------------------------------------------------------- $ ./hello --help Help Options: -h, --help Show option summary. --help-all Show all help options. Application Options: --message A message to show the user. --quiet Whether to be quiet. ----------------------------------------------------------

1 0

TFPIE 2012: Second CFP & more
by Marco Morazan 24 Mar '12

24 Mar '12

CALL FOR PAPERS/PRESENTATIONS TFPIE 2012 International Workshop on Trends in Functional Programming in Education 2012 June 11 2012 University of St Andrews, Scotland http://www.cs.ru.nl/P.Achten/TFPIE_2012/TFPIE_2012_home.html *** NEW: The deadline to register for accommodations through the TFP website is March 26th, 2012. *** The deadline to submit articles/abstracts to TFPIE is May 20 The first International Workshop on Trends in Functional Programming in Education, TFPIE 2012, will be co-located with TFP 2012 at the University of St Andrews in Scotland. The goal of TFPIE is to gather researchers, professors, teachers, and all professionals that use or are interested in the use of functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas, and work in progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chairs of TFPIE 2012 will screen submissions to ensure that all presentations are within scope and are of interest to participants. Potential presenters are invited to submit an extended abstract (4-6 pages) or an article (up to 16 pages). The authors of all accepted presentations will have their preprints and their slides made available on the workshop's website/wiki. Any visitors to the TFPIE 2012 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. After the workshop, the program committee will review, using prevailing academic standards, the articles accepted for presentation to select the best for publication in Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and all extended abstracts will not be formally reviewed by the PC. TOPICS OF INTEREST TFPIE 2012 welcomes submissions describing practical techniques used in the classroom, tools used and/or developed, and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: FP and beginning CS students FP in Artificial Intelligence FP in Robotics FP and Music Advanced FP for undergraduates FP in graduate education Engaging students in research using FP FP in Programming Languages FP in the high school curriculum FP as a stepping stone to other CS topics FP and Philosophy If you are not sure if your work is appropriate for TFPIE 2012, please contact the PC chairs by e-mail at: tfpie2012(a)cs.ru.nl . Program Committee Peter Achten, Radboud University Nijmegen Jost Berthold, University of Copenhagen Marc Feeley, University of Montreal Ralf Hinze, University of Oxford Shriram Krishnamurthi, Brown University Michel Mauny, ENSTA Paris Tech James McKinna, UK Marco T. Morazan, Seton Hall University Rinus Plasmeijer, Radboud University Nijmegen Simon Thompson, University of Kent Important Dates May 20 submission of abstract or article May 25 notification of acceptance June 11 TFPIE July 6 submission of formal paper September 10 notification of acceptance October 1 camera-ready paper Venue The University of St Andrews is Scotland's first university and the third oldest in the English-speaking world, founded in 1413. Over six centuries it has established a reputation as one of Europe's leading and most distinctive centers for teaching and research. St Andrews is situated on the east coast of Fife, Scotland, UK. The town is approximately 50 miles north-east of Edinburgh, 14 miles south-east of Dundee, 78 miles south of Aberdeen, and 82 miles east of Glasgow making it easily accessible by any means of transportation. Help on traveling to St Andrews can be found at: http://www.st-andrews.ac.uk/visiting/GettingtoStAndrews/ . Questions? If you have any questions, do not hesitate to contact us at: tfpie2012(a)cs.ru.nl . -- Cheers, Marco

1 0

Haskell Weekly News: Issue 219
by Daniel Santa Cruz 22 Mar '12

22 Mar '12

Welcome to issue 218 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of March 11 to 17, 2012. Quotes of the Week * cmccann: * cmccann needs to hurry up and get his stream processing library finished before all the possible synonyms for "thing that other things flow through" are taken * shergill: silver bullets don't respect eta equivalency. it needs to be made of silver, and not simply *act* like one :P Top Reddit Stories * Shelly: Write your shell scripts in Haskell Domain: yesodweb.com, Score: 65, Comments: 34 On Reddit: [1] http://goo.gl/lZdyV Original: [2] http://goo.gl/HHIU0 * The Glasgow Haskell Compiler (draft chapter for "The Architecture of Open Source Applications, Volume 2") Domain: community.haskell.org, Score: 53, Comments: 28 On Reddit: [3] http://goo.gl/qVoFj Original: [4] http://goo.gl/Rc42A * Announcing the Yesod Platform Domain: yesodweb.com, Score: 52, Comments: 13 On Reddit: [5] http://goo.gl/TzW0w Original: [6] http://goo.gl/z3fwC * The Cabal of my dreams Domain: blog.johantibell.com, Score: 42, Comments: 19 On Reddit: [7] http://goo.gl/VTpJu Original: [8] http://goo.gl/wrrNP * Announcing: Snap Framework v0.8 Domain: snapframework.com, Score: 39, Comments: 6 On Reddit: [9] http://goo.gl/19EyG Original: [10] http://goo.gl/USfny * Leksah 0.12 Domain: haskell.org, Score: 32, Comments: 9 On Reddit: [11] http://goo.gl/5Ft8w Original: [12] http://goo.gl/K6OEx * uncurryWith and concatenative programming Domain: self.haskell, Score: 30, Comments: 4 On Reddit: [13] http://goo.gl/dzzXH Original: [14] http://goo.gl/dzzXH * New course on parallel functional programming at Chalmers Domain: cse.chalmers.se, Score: 29, Comments: 2 On Reddit: [15] http://goo.gl/vwH6F Original: [16] http://goo.gl/zKQjh * Announcing Haskell project support on travis-ci.org Domain: about.travis-ci.org, Score: 28, Comments: 8 On Reddit: [17] http://goo.gl/uH7g3 Original: [18] http://goo.gl/KbE7I * Anyone in the Toronto area looking for a job? Domain: self.haskell, Score: 28, Comments: 22 On Reddit: [19] http://goo.gl/NHdwz Original: [20] http://goo.gl/NHdwz * Building a Concurrent Web Scraper With Haskell Domain: adit.io, Score: 26, Comments: 1 On Reddit: [21] http://goo.gl/G7QXM Original: [22] http://goo.gl/FV2LO * Using Text.Parsec.Indent to parse an indentation-sensitive language with Haskell’s Parsec library. Domain: spin.atomicobject.com, Score: 26, Comments: 7 On Reddit: [23] http://goo.gl/dXkzO Original: [24] http://goo.gl/9BFa3 * Coapplicative Functor? Domain: self.haskell, Score: 21, Comments: 37 On Reddit: [25] http://goo.gl/4eluT Original: [26] http://goo.gl/4eluT * HalVM: Easy install on Fedora 16 + 64bit support Domain: community.galois.com, Score: 21, Comments: 2 On Reddit: [27] http://goo.gl/goN4p Original: [28] http://goo.gl/6EQAu Top StackOverflow Questions * How do you represent a graph in Haskell? votes: 18, answers: 4 Read on SO: [29] http://goo.gl/t5vij * Impredicative types vs. plain old subtyping votes: 16, answers: 0 Read on SO: [30] http://goo.gl/3cmCj * Can GHC really never inline map, scanl, foldr, etc.? votes: 14, answers: 3 Read on SO: [31] http://goo.gl/se91V * Redefine IO to simplify debugging? votes: 11, answers: 1 Read on SO: [32] http://goo.gl/s62s9 * Quadratic programming in Haskell votes: 11, answers: 1 Read on SO: [33] http://goo.gl/jYWEP * How can I test a higher-order function using QuickCheck? votes: 11, answers: 2 Read on SO: [34] http://goo.gl/1YHql * Haskell: how to map a tuple? votes: 10, answers: 7 Read on SO: [35] http://goo.gl/fk7LE * Repacking monads — any generic way? votes: 9, answers: 4 Read on SO: [36] http://goo.gl/QklWI * Is there any reason not to use the INLINABLE pragma for a function? votes: 9, answers: 1 Read on SO: [37] http://goo.gl/t75CV * Repa 3 performance and correct usage of 'now' votes: 9, answers: 1 Read on SO: [38] http://goo.gl/PbyzK Until next time, Daniel Santa Cruz References 1. http://www.yesodweb.com/blog/2012/03/shelly-for-shell-scripts 2. http://www.reddit.com/r/haskell/comments/qt17p/shelly_write_your_shell_scri… 3. http://community.haskell.org/~simonmar/papers/aos.pdf 4. http://www.reddit.com/r/haskell/comments/qvyup/the_glasgow_haskell_compiler… 5. http://www.yesodweb.com/blog/2012/03/announcing-yesod-platform 6. http://www.reddit.com/r/haskell/comments/qxopq/announcing_the_yesod_platfor… 7. http://blog.johantibell.com/2012/03/cabal-of-my-dreams.html 8. http://www.reddit.com/r/haskell/comments/qwj5j/the_cabal_of_my_dreams/ 9. http://snapframework.com/blog/2012/03/16/snap-0.8-released 10. http://www.reddit.com/r/haskell/comments/qzzfe/announcing_snap_framework_v0… 11. http://www.haskell.org/pipermail/haskell-cafe/2012-March/100023.html 12. http://www.reddit.com/r/haskell/comments/qro91/leksah_012/ 13. http://www.reddit.com/r/haskell/comments/qy8h2/uncurrywith_and_concatenativ… 14. http://www.reddit.com/r/haskell/comments/qy8h2/uncurrywith_and_concatenativ… 15. http://www.cse.chalmers.se/edu/course/pfp/ 16. http://www.reddit.com/r/haskell/comments/quc64/new_course_on_parallel_funct… 17. http://about.travis-ci.org/blog/announcing_support_for_haskell_on_travis_ci/ 18. http://www.reddit.com/r/haskell/comments/qsyr5/announcing_haskell_project_s… 19. http://www.reddit.com/r/haskell/comments/qw99e/anyone_in_the_toronto_area_l… 20. http://www.reddit.com/r/haskell/comments/qw99e/anyone_in_the_toronto_area_l… 21. http://adit.io/posts/2012-03-10-building_a_concurrent_web_scraper_with_hask… 22. http://www.reddit.com/r/haskell/comments/qvp1u/building_a_concurrent_web_sc… 23. http://spin.atomicobject.com/2012/03/16/using-text-parsec-indent-to-parse-a… 24. http://www.reddit.com/r/haskell/comments/qzeyk/using_textparsecindent_to_pa… 25. http://www.reddit.com/r/haskell/comments/qsrmq/coapplicative_functor/ 26. http://www.reddit.com/r/haskell/comments/qsrmq/coapplicative_functor/ 27. http://community.galois.com/pipermail/halvm-devel/2012-March/000022.html 28. http://www.reddit.com/r/haskell/comments/qynuq/halvm_easy_install_on_fedora… 29. http://stackoverflow.com/questions/9732084/how-do-you-represent-a-graph-in-… 30. http://stackoverflow.com/questions/9732766/impredicative-types-vs-plain-old… 31. http://stackoverflow.com/questions/9658438/can-ghc-really-never-inline-map-… 32. http://stackoverflow.com/questions/9656734/redefine-io-to-simplify-debugging 33. http://stackoverflow.com/questions/9672686/quadratic-programming-in-haskell 34. http://stackoverflow.com/questions/9686665/how-can-i-test-a-higher-order-fu… 35. http://stackoverflow.com/questions/9722689/haskell-how-to-map-a-tuple 36. http://stackoverflow.com/questions/9684252/repacking-monads-any-generic-way 37. http://stackoverflow.com/questions/9709823/is-there-any-reason-not-to-use-t… 38. http://stackoverflow.com/questions/9713378/repa-3-performance-and-correct-u…

1 0

Final CFP: TFP12, Trends in Functional Programming 2012, St Andrews, U.K., June 12-14, 2012
by Hans-Wolfgang Loidl 20 Mar '12

20 Mar '12

[In short: submissions of papers & ext'd abstracts by March 26th; registration by April 11th; TFP12 symposium June 12-14th; Apologies for multiple copies of this call -- HWL ] FINAL CALL FOR PAPERS 13th International Symposium Trends in Functional Programming 2012 St Andrews, U.K. June 12-14, 2012 http://www.tifp.org/TFP12.html The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS: http://www.springer.com/lncs) volume. TFP 2012 will be the main event of a week of functional programming extravaganza at the University of St Andrews. The week will start with the International Workshop on Trends in Functional Programming in Education, followed by TFP, followed by a workshop on 75 years of Lambda Calculus, an Erlang day, and a technical workshop on Patterns for MultiCores (ParaPhrase/Release projects). The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, and in Madrid (Spain) in 2011. For further general information about TFP please see the TFP homepage at http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The symposium recognises that new trends may arise through various routes. As part of the symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarising work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcome: . Functional programming and multicore/manycore computing . Functional programming in the cloud . High performance functional computing . Extra-functional (behavioural) properties of functional programs . Dependently typed functional programming . Validation and verification of functional programs . Using functional techniques to verify/reason about imperative/object-oriented programs . Debugging for functional languages . Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. . Interoperability with imperative programming languages . Novel memory management techniques . Program transformation techniques . Empirical performance studies . Abstract/virtual machines and compilers for functional languages . New implementation strategies . Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2012 program chair, Hans-Wolfgang Loidl, at tfp12(a)easychair.org BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of papers for presentation at the symposium is based on a lightweight peer review process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (llncs2e.zip), and are linked below. The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2012 website. Paper submission is done through TFP12's easychair page: https://www.easychair.org/conferences/?conf=tfp12 Important dates (2012): Full papers/extended abstracts submission: March 26th Notification of acceptance for presentation: April 4th Early registration deadline: April 11th Camera ready for draft proceeding: May 28th The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last two instances of TFP have been published as LNCS 6546 (TFP10) and LNCS 7193 (TFP11). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper. Important dates (2012): TFP 2012 Symposium: June 12-14th Student papers feedback: June 22nd Submission for formal review: July 9th Notification of acceptance for LNCS: September 17th Camera ready paper: October 15th REGISTRATION Registration for TFP12, as well as the adjoined workshops, is handled through the on-line registration page below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline of April 11th, 2012. http://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=34&modid=2&comp… TFP 2012 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Symposium Organization Chair: Kevin Hammond, University of St. Andrews, UK Local Arrangements: Edwin Brady, Vladimir Janjic, University of St. Andrews, UK TFP 2012 PROGRAMME COMMITTEE Peter Achten, Radboud University Nijmegen, The Netherlands Jost Berthold, University of Copenhagen, Denmark Edwin Brady, University of St. Andrews, U.K. Matthias Blume, Google, U.S.A. Clemens Grelck, University of Amsterdam, The Netherlands Kevin Hammond, University of St. Andrews, U.K. Graham Hutton, University of Nottingham, U.K Patricia Johann, University of Strathclyde, U.K. Hans-Wolfgang Loidl (PC Chair), Heriot-Watt University, U.K. Jay McCarthy, Brigham Young University, Utah, U.S.A. Rex Page, University of Oklahoma, U.S.A. Ricardo Peña, Complutense University of Madrid, Spain Kostis Sagonas, Uppsala University, Sweden Manuel Serrano, INRIA Sophia Antipolis, France Mary Sheeran, Chalmers, Sweden Nikhil Swamy, Microsoft Research, Redmond, U.S.A. Phil Trinder, Heriot-Watt University, U.K. Wim A Vanderbauwhede, University of Glasgow, U.K. Marko van Eekelen, Radboud University Nijmegen, The Netherlands David Van Horn, Northeastern University, U.S.A. Malcolm Wallace, Standard Chartered, U.K. Viktória Zsók, Eötvös Loránd University, Hungary SPONSORS TFP 2012 is sponsored by Erlang Solutions Ltd. and the Scottish Informatics and Computer Science Alliance (SICSA). INVITED SPEAKER In this instance of TFP, an invited talk will be given by David A Turner, Professor emeritus at Middlesex University and at the University of Kent, inventor of Miranda, KRC and SASL. Prof Turner will be talking on the history of functional programming languages. LINKS Main TFP12 page: http://www.tifp.org/TFP12.html TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp12 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=34&modid=2&comp… Facebook page: http://www.facebook.com/pages/TFP-Symposium-Series-on-Trends-in-Functional-… -- Hans-Wolfgang Loidl School of Mathematical and Computer Sciences, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS Scotland, U.K.

1 0

[ANN] majordomo-0.1.1
by Mark Wotton 17 Mar '12

17 Mar '12

Sean Seefried and I have just released an implementation of the client and worker protocols for Majordomo, as specified at http://rfc.zeromq.org/spec:7 While it's not yet complete (the client won't try reconnecting, for instance, and has a hardcoded timeout), we're already finding it useful for ninjablocks.com The mdp_client executable is also useful for poking majordomo servers from the command line. http://hackage.haskell.org/package/majordomo https://github.com/ninjablocks/majordomo Cheers, Mark Wotton

1 0

WING 2012: Second Call for Papers -- 3 weeks to go
by Gudmund Grov 16 Mar '12

16 Mar '12

[Please post - apologies for multiple copies.] ---------------------------------------------------- WING 2012 - 4th International Workshop on INvariant Generation http://cs.nyu.edu/acsys/wing2012/ June 30, 2012 Manchester, UK (a satellite Workshop of IJCAR 2012) ---------------------------------------------------- --- Second Call for Papers : 3 weeks to go --- General ------- The ability to automatically extract and synthesize auxiliary properties of programs has had a profound effect on program analysis, testing, and verification over the last several decades. A key impediment for program verification is the overhead associated with providing, debugging, and verifying auxiliary invariant annotations. Releasing the software developer from this burden is crucial for ensuring the practical relevance of program verification. In the context of testing, suitable invariants have the potential of enabling high-coverage test-case generation. Thus, invariant generation is a key ingredient in a broad spectrum of tools that help to improve program reliability and understanding. As the design and implementation of reliable software remains an important issue, any progress in this area will have a significant impact. The increasing power of automated theorem proving and computer algebra has opened new perspectives for computer-aided program verification; in particular for the automatic generation of inductive assertions in order to reason about loops and recursion. Especially promising breakthroughs are invariant generation techniques by Groebner bases, quantifier elimination, and algorithmic combinatorics, which can be used in conjunction with model checking, theorem proving, static analysis, and abstract interpretation. The aim of this workshop is to bring together researchers from these diverse fields. Scope ----- We encourage submissions presenting work in progress, tools under development, as well as work by PhD students, such that the workshop can become a forum for active dialogue between the groups involved in this new research area. Relevant topics include (but are not limited to) the following: * Program analysis and verification * Inductive Assertion Generation * Inductive Proofs for Reasoning about Loops * Applications to Assertion Generation using the following tools: - Abstract Interpretation, - Static Analysis, - Model Checking, - Theorem Proving, - Theory Formation, - Algebraic Techniques * Tools for inductive assertion generation and verification * Alternative techniques for reasoning about loops Invited speaker ----------------- * Aditya Nori (Microsoft Research) Committee ----------------- Program Chairs: * Gudmund Grov (University of Edinburgh, UK) * Thomas Wies (New York University, USA) Program Committee: * Clark Barrett (New York University, USA) * Nikolaj Bjorner (Microsoft Research, USA) * Gudmund Grov (University of Edinburgh, UK) * Ashutosh Gupta (IST Austria) * Bart Jacobs (Katholieke Universiteit Leuven, Belgium) * Moa Johansson (Chalmers University of Technology, Sweden) * Laura Kovacs (Vienna University of Technology, Austria) * David Monniaux (VERIMAG, France) * Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) * Helmut Veith (Vienna University of Technology, Austria) * Thomas Wies (New York University, USA) Important Dates --------------- Submission deadline: April 06, 2012 Notification of acceptance: May 04, 2012 Final version due: June 08, 2012 Workshop: June 30, 2012 Submission ---------- WING 2012 encourages submissions in the following two categories: * Original papers: contain original research (simultaneous submissions are not allowed) and sufficient detail to assess the merits and relevance of the submission. Given the informal style of the workshop, papers describing work in progress, with sufficient detail to assess the contribution, are also welcome. Original papers should not exceed 15 pages. * Extended abstracts: contain preliminary reports of work in progress, case studies, or tool descriptions. These will be judged based on the expected level of interest for the WING community. They will be included in the CEUR-WS proceedings. Extended abstracts should not exceed 5 pages. All submissions should conform to Springer's LNCS format. Formatting style files can be found at http://www.springer.de/comp/lncs/authors.html Technical details may be included in an appendix to be read at the reviewers' discretion and to be omitted in the final version. Please prepare your submission in accordance with the rules described above and submit a pdf file via https://www.easychair.org/?conf=wing2012 Publication ----------- All submissions will be peer-reviewed by the program committee. Accepted contributions will be published in archived electronic notes, as a volume of CEUR Workshop Proceedings. A special issue of the Journal of Science of Computer Programming with extended versions of selected papers will be published after the workshop. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0