March 2012 - Haskell - Haskell.org

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

CFP: 2012 ML workshop
by oleg＠okmij.org 16 Mar '12

16 Mar '12

ACM SIGPLAN Workshop on ML Thursday, September 13th, 2012, Copenhagen, Denmark (co-located with ICFP) http://www.lexifi.com/ml2012 ======================================================================= The ML family of programming languages includes dialects known as Standard ML, OCaml, and F#. These languages have inspired a large amount of computer-science research, both practical and theoretical. This workshop aims to provide a forum where users, developers and researchers of ML languages and related technology can interact and discuss ongoing research, open problems and innovative applications. The format of ML 2012 will continue the return in 2010 and 2011 to a more informal model: a workshop with presentations selected from submitted abstracts. The workshop will not publish proceedings, so any contributions may be submitted for publication elsewhere. We hope that this format will encourage the presentation of exciting (if unpolished) research and deliver a lively workshop atmosphere. SCOPE ----- We seek research presentations on topics related to ML, including but not limited to * applications: case studies, experience reports, pearls, etc. * extensions: higher forms of polymorphism, generic programming, objects, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics: operational, denotational, program equivalence, parametricity, mechanization, etc. Three kinds of submissions will be accepted: Research Presentations, Experience Reports and Demos. * Research Presentations: Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. These presentations should be structured in a way which can be, at least in part, of interest to (advanced) users. * Experience Reports: Users are invited to submit Experience Reports about their use of ML languages. These presentations do not need to contain original research but they should tell an interesting story to researchers or other advanced users, such as an innovative or unexpected use of advanced features or a description of the challenges they are facing or attempting to solve. * Demos: Live demonstrations or short tutorials should show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or applications built on or related to ML. (Please note that you will need to provide all the hardware and software required for your demo; the workshop organizers are only able to provide a projector.) Each presentation should take 20-25 minutes, except demos, which should take 10-15 minutes. The exact time will be decided based on the number of accepted submissions. SUBMISSION INSTRUCTIONS ----------------------- Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Submissions longer than a half a page should include a one-paragraph synopsis suitable for inclusion in the workshop program. Submissions must be uploaded to the following website before the submission deadline (2012-06-04): https://www.easychair.org/conferences/?conf=ml2012 For any question concerning the scope of the workshop or the submission process, please contact the program chair (alain(a)frisch.fr) IMPORTANT DATES --------------- * 2012-06-04: Submission * 2012-07-13: Notification * 2012-09-13: Workshop PROGRAM COMMITTEE ----------------- Alain Frisch (chair) (LexiFi) Anders Schack-Nielsen (SimCorp) Cedric Fournet (Microsoft Research) Francois Pottier (INRIA) Gian Ntzik (Imperial College) Jeremy Yallop Keiko Nakata (Institute of Cybernetics, Tallinn) Matthias Blume (Google) Oleg Kiselyov Stephen Weeks (Jane Street Capital) Tomas Petricek (University of Cambridge) STEERING COMMITTEE ------------------ Andreas Rossberg (Google) Chung-chieh Shan (Cornell University) Eijiro Sumii (chair) (Tohoku University) Jacques Garrigue (Nagoya University) Matthew Fluet (Rochester Institute of Technology) Robert Harper (Carnegie Mellon University) Yaron Minsky (Jane Street)

1 0

Haskell Weekly News: Issue 218
by Daniel Santa Cruz 16 Mar '12

16 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 cover the weeks of February 26 to March 10, 2012. You can find the HTML version at: http://contemplatecode.blogspot.com/2012/03/haskell-weekly-news-issue-218.h… Quotes of the Week * monochrom: shapr is not "normal". he got a decent job, then went to school. * quicksilver: typeclasses are absolutely not sugar for a record of functions quicksilver: they're unsugar. quicksilver: they're a benighted bitter poison. * edwardk: i'm not willing to give up orders of magnitude worth of performance to get a bad hack edwardk: if you want that, go code in scheme * (on pointless black magic) mgsloan: welcome to excessively pointless plumbing operators :) byorgey: mgsloan: that's... terrifying DanBurton: you should put it on hackage * cheater_: maybe you should try /part since we're talking about perfect-world situations * edwardk: i used to be a huge proponent of unicode syntax everywhere, then i used agda ;) * cmccann: free advice is, of course, any advice which satisfies the properties expected given the definition of "advice", but nothing further ;] * shachaf: "magic" is just another word for "primitive" * dylukes: I'm getting way more acquainted with the GHC build system than I'd like to be. * JoeyA: Inform7 is a programming language. A programming language tells a computer what to do. The computer is in a room. You are facing West. * mauke: sorry, the current time is not a constant lukish: It's a pity * dfletcher: > ((++" Batman!") . take 48 . cycle . show) (0/0) Top Reddit Stories * New unordered-containers release improves performance by as much as 2x, using HAMTs Domain: blog.johantibell.com, Score: 64, Comments: 46 On Reddit: [1] http://goo.gl/D6yTb Original: [2] http://goo.gl/5YUph * A humble suggestion for visual pure functional programming Domain: i.imgur.com, Score: 59, Comments: 59 On Reddit: [3] http://goo.gl/eUMrk Original: [4] http://goo.gl/DSFnj * Spike: experimental web browser in Haskell Domain: self.haskell, Score: 53, Comments: 22 On Reddit: [5] http://goo.gl/ZTR1j Original: [6] http://goo.gl/ZTR1j * GHC 7.4.1 speeds up arbtt by a factor of 22 Domain: joachim-breitner.de, Score: 51, Comments: 18 On Reddit: [7] http://goo.gl/XVBDt Original: [8] http://goo.gl/IL6EL * Eff 3.0 is out, a functional language with first-class computational effects and handlers (an alternative to monads) Domain: math.andrej.com, Score: 49, Comments: 12 On Reddit: [9] http://goo.gl/1Idw0 Original: [10] http://goo.gl/iwHlG * What's the most clever piece of Haskell code you know? Domain: self.haskell, Score: 47, Comments: 64 On Reddit: [11] http://goo.gl/T1u9t Original: [12] http://goo.gl/T1u9t * Diagrams 0.5 released: powerful, flexible embedded domain-specific language for creating vector graphics Domain: byorgey.wordpress.com, Score: 40, Comments: 7 On Reddit: [13] http://goo.gl/e75Yx Original: [14] http://goo.gl/565c1 * Faster Javascript Through Category Theory Domain: johnbender.us, Score: 39, Comments: 5 On Reddit: [15] http://goo.gl/UgvTr Original: [16] http://goo.gl/TLK4k * I'm writing a Haskell book. Almost finished the 3rd chapter. Would like feedback. Domain: bit.ly, Score: 36, Comments: 48 On Reddit: [17] http://goo.gl/AzwhR Original: [18] http://goo.gl/AzwhR * Level 0 -- a Snake clone using SDL, with a nice interactive map editor Domain: quasimal.com, Score: 28, Comments: 5 On Reddit: [19] http://goo.gl/x9gZk Original: [20] http://goo.gl/meSPo * Parallel Haskell Digest 8: MVar, summer school, Simon PJ @ YOW, and more Domain: well-typed.com, Score: 27, Comments: 1 On Reddit: [21] http://goo.gl/MDzrI Original: [22] http://goo.gl/OC6O6 * Avoid cabal hell: find nirvana Domain: yesodweb.com, Score: 27, Comments: 30 On Reddit: [23] http://goo.gl/ryd5e Original: [24] http://goo.gl/Yyzqd * Improvements to HashMap and HashSet creation Domain: blog.johantibell.com, Score: 26, Comments: 1 On Reddit: [25] http://goo.gl/yh2zs Original: [26] http://goo.gl/u9uhg * The Day Python Embarassed Imperative Programming » What, then, Shall We Say? Domain: the-27th-comrade.appspot.com, Score: 25, Comments: 20 On Reddit: [27] http://goo.gl/5KIOx Original: [28] http://goo.gl/Wi47v * Improbable uses of unsafeCoerce Domain: gist.github.com, Score: 25, Comments: 25 On Reddit: [29] http://goo.gl/cN0LE Original: [30] http://goo.gl/cxfSc Top StackOverflow Questions * Haskell: Lists, Arrays, Vectors, Sequences votes: 32, answers: 1 Read on SO: [31] http://goo.gl/YHVpC * Why type classes in Haskell were difficult to implement? votes: 20, answers: 1 Read on SO: [32] http://goo.gl/LoLHe * runST and function composition votes: 18, answers: 3 Read on SO: [33] http://goo.gl/6NSvR * How do you compute the difference between successive elements of a list of unknown size, functionally? votes: 16, answers: 7 Read on SO: [34] http://goo.gl/rnc8l * Do we care about the 'past' in FRP? votes: 16, answers: 1 Read on SO: [35] http://goo.gl/oR2rd * “evaluate” function votes: 16, answers: 1 Read on SO: [36] http://goo.gl/ShLMT * What's preferred among liftM, lilftA, etc votes: 15, answers: 1 Read on SO: [37] http://goo.gl/y8apA * Name of type pattern: R a b = Q (a -> (R a b,b)) votes: 14, answers: 3 Read on SO: [38] http://goo.gl/kRMgn * Haskell offline documentation? votes: 12, answers: 2 Read on SO: [39] http://goo.gl/Hih3z * Program design in Haskell: how to do simulation without mutability votes: 12, answers: 3 Read on SO: [40] http://goo.gl/ODJjT Until next time, Daniel Santa Cruz References 1. http://blog.johantibell.com/2012/03/announcing-unordered-containers-02.html 2. http://www.reddit.com/r/haskell/comments/ql9m5/new_unorderedcontainers_rele… 3. http://i.imgur.com/TOZZZ.png 4. http://www.reddit.com/r/haskell/comments/q7m8i/a_humble_suggestion_for_visu… 5. http://www.reddit.com/r/haskell/comments/qhce6/spike_experimental_web_brows… 6. http://www.reddit.com/r/haskell/comments/qhce6/spike_experimental_web_brows… 7. http://www.joachim-breitner.de/blog/archives/546-GHC-7.4.1-speeds-up-arbtt-… 8. http://www.reddit.com/r/haskell/comments/q86iw/ghc_741_speeds_up_arbtt_by_a… 9. http://math.andrej.com/eff/ 10. http://www.reddit.com/r/haskell/comments/qosr7/eff_30_is_out_a_functional_l… 11. http://www.reddit.com/r/haskell/comments/qn7nk/whats_the_most_clever_piece_… 12. http://www.reddit.com/r/haskell/comments/qn7nk/whats_the_most_clever_piece_… 13. http://byorgey.wordpress.com/2012/03/09/announcing-diagrams-0-5/ 14. http://www.reddit.com/r/haskell/comments/qpkxb/diagrams_05_released_powerfu… 15. http://johnbender.us/2012/02/29/faster-javascript-through-category-theory/ 16. http://www.reddit.com/r/haskell/comments/qbuk8/faster_javascript_through_ca… 17. http://bit.ly/xDsDSj 18. http://www.reddit.com/r/haskell/comments/qquc5/im_writing_a_haskell_book_al… 19. http://quasimal.com/projects/level_0.html 20. http://www.reddit.com/r/haskell/comments/qcrhj/level_0_a_snake_clone_using_… 21. http://www.well-typed.com/blog/64 22. http://www.reddit.com/r/haskell/comments/qefzt/parallel_haskell_digest_8_mv… 23. http://www.yesodweb.com/blog/2012/03/cabal-nirvana 24. http://www.reddit.com/r/haskell/comments/qkqdj/avoid_cabal_hell_find_nirvan… 25. http://blog.johantibell.com/2012/03/improvements-to-hashmap-and-hashset.html 26. http://www.reddit.com/r/haskell/comments/qp7w1/improvements_to_hashmap_and_… 27. http://the-27th-comrade.appspot.com/blog/ahJzfnRoZS0yN3RoLWNvbXJhZGVyDAsSBU… 28. http://www.reddit.com/r/haskell/comments/q7ykt/the_day_python_embarassed_im… 29. https://gist.github.com/1934179 30. http://www.reddit.com/r/haskell/comments/qadwm/improbable_uses_of_unsafecoe… 31. http://stackoverflow.com/questions/9611904/haskell-lists-arrays-vectors-seq… 32. http://stackoverflow.com/questions/9602176/why-type-classes-in-haskell-were… 33. http://stackoverflow.com/questions/9468963/runst-and-function-composition 34. http://stackoverflow.com/questions/9512513/how-do-you-compute-the-differenc… 35. http://stackoverflow.com/questions/9526836/do-we-care-about-the-past-in-frp 36. http://stackoverflow.com/questions/9553943/evaluate-function 37. http://stackoverflow.com/questions/9509350/whats-preferred-among-liftm-lilf… 38. http://stackoverflow.com/questions/9487760/name-of-type-pattern-r-a-b-q-a-r… 39. http://stackoverflow.com/questions/9454793/haskell-offline-documentation 40. http://stackoverflow.com/questions/9548913/program-design-in-haskell-how-to…

1 0

[ANNOUNCE] JuicyPixels 1.1 - image loading library (maintenance release)
by Vincent Berthoux 14 Mar '12

14 Mar '12

Hello list, This is a maintenance release without new functionality, the central change is the switch from Haskell Array to Data.Vector (to ease it's use for OpenGL texture loading). Juicy.Pixels 1.1 change log : - Fixing automatic bitmap decoding, the decodeImage function wasn't trying to decode bitmap - Converting Haskell array types to Data.Vector (thanks to Jason Dagit) - Some tiny documentation enhancement Hackage : http://hackage.haskell.org/package/JuicyPixels GitHub : https://github.com/Twinside/Juicy.Pixels Thanks Vincent Berthoux

1 1