http://blog.gmane.org/gmane.comp.lang.haskell.general hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://comments.gmane.org/gmane.comp.lang.haskell.general/19322 <pre>We have a vacancy in functional programming at St Andrews, supporting the existing research team and engaging with other groups in the School. The deadline is June 22nd. Please forward to any of your colleagues who may be good candidates and/or point me at anyone who you think may be a good candidate! https://www.vacancies.st-andrews.ac.uk//ViewVacancy.aspx?enc=mEgrBL4XQK0+ld8aNkwYmP7j9uKB0Q3XDyDQqVA9vP1JLwBKRtw4rNHXJis9NOK7tfyZGpjmqWuqi2gq2EDJAA== Best Wishes, Kevin -------- Kevin Hammond, Professor of Computer Science, University of St Andrews T: +44-1334 463241 F: +44-1334-463278 W: http://www.cs.st-andrews.ac.uk/~kh In accordance with University policy on electronic mail, this email reflects the opinions of the individual concerned, may contain confidential or copyright information that should not be copied or distributed without permission, may be of a private or personal nature unless explicitly indicated otherwise, and should not under any circumstances be taken as an official statement of University policy or procedure (see http://www.st-and.ac.uk). The University of St Andrews is a charity registered in Scotland : No SC013532 </pre> Kevin Hammond 2012-05-25T19:45:59 http://comments.gmane.org/gmane.comp.lang.haskell.general/19321 <pre>Welcome to issue 228 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of May 13 to 19, 2012. Announcements Stefan Wehr issued a call for presentations for the Commercial Users of Functional Programmers (CUFP 2012) conference to be held in Copenhagen, Denmark during September 13 to 15, 2012. [1] http://goo.gl/Rl1T9 Quotes of the Week * hpc measures understanding in angstroms per (second * liter) ^ (1/15) Top Reddit Stories * ANNOUNCE: forthcoming O'Reilly book on Parallel and Concurrent Haskell Domain: haskell.org, Score: 101, Comments: 13 On Reddit: [2] http://goo.gl/UY9L6 Original: [3] http://goo.gl/oqLo6 * GHC 7.6 will have support for deferred type errors Domain: hackage.haskell.org, Score: 55, Comments: 4 On Reddit: [4] http://goo.gl/sPknX Original: [5] http://goo.gl/ieM9s * What happens when you mix three research programming languages together Domain: blog.ezyang.com, Score: 41, Comments: 7 On Reddit: [6] http://goo.gl/ujmF1 Original: [7] http://goo.gl/jME65 * Reactive-Banana 0.6: FRP in Haskell, supports both WxHaskell and generation to Javascript! Domain: apfelmus.nfshost.com, Score: 39, Comments: 3 On Reddit: [8] http://goo.gl/XrFxl Original: [9] http://goo.gl/Uanl6 * Keter: It's Alive! (Web app deployment system for Haskell) Domain: yesodweb.com, Score: 35, Comments: 6 On Reddit: [10] http://goo.gl/RyuLI Original: [11] http://goo.gl/EVcDT * Reasoning about Stream Processing with Effects Domain: personal.cis.strath.ac.uk, Score: 26, Comments: 26 On Reddit: [12] http://goo.gl/TI8bj Original: [13] http://goo.gl/n2rS0 * Patches for the new GHC-iPhone (v4) builds but needs a little more debugging Domain: hip-to-be-square.com, Score: 26, Comments: 27 On Reddit: [14] http://goo.gl/7QvqK Original: [15] http://goo.gl/zLCzr * Commutative Edits and Exceptions -- Categorically Dual(ish)? Domain: bosker.wordpress.com, Score: 24, Comments: 2 On Reddit: [16] http://goo.gl/1quI5 Original: [17] http://goo.gl/ET2ym * Parallel Haskell Digest 10: SPJ on Cloud Haskell, concurrent channels, meta-par, Accelerate, and StackOverflow'ing like crazy Domain: well-typed.com, Score: 21, Comments: 3 On Reddit: [18] http://goo.gl/z1UiV Original: [19] http://goo.gl/iPiAx * Interactive Programming with LambdaCalc Domain: dynamicaspects.org, Score: 20, Comments: 6 On Reddit: [20] http://goo.gl/IeEis Original: [21] http://goo.gl/n3Bqo * BitParser - RFC on a new parsing library for parsing data at the bit level. Similar in functionality to Erlang's bit syntax Domain: github.com, Score: 18, Comments: 8 On Reddit: [22] http://goo.gl/a7Qmq Original: [23] http://goo.gl/SL1u4 Top StackOverflow Questions * Haskell: Between a list and a tuple votes: 10, answers: 3 Read on SO: [24] http://goo.gl/6eiPg * Why is it so uncommon to use type signatures in where clauses? votes: 9, answers: 4 Read on SO: [25] http://goo.gl/ih3cK * Is there any good Haskell indentation script for Vim? votes: 9, answers: 2 Read on SO: [26] http://goo.gl/t1D3Y * Haskell “exceptions” votes: 8, answers: 2 Read on SO: [27] http://goo.gl/5WfTT * Is it possible to program and check invariants in haskell? votes: 8, answers: 3 Read on SO: [28] http://goo.gl/5wNE6 * The “handle” function and Real World Haskell votes: 7, answers: 2 Read on SO: [29] http://goo.gl/K8WK0 * Haskell: Flatten binary tree votes: 7, answers: 2 Read on SO: [30] http://goo.gl/eSokk * How can I uninstall a version of a Cabal package? votes: 6, answers: 1 Read on SO: [31] http://goo.gl/Gl1Mi * Fault tolerant JSON parsing votes: 6, answers: 1 Read on SO: [32] http://goo.gl/NBsVH * Can a Haskell or Haskell OS thread waiting on Network.Socket.accept not be killed on Windows? votes: 6, answers: 1 Read on SO: [33] http://goo.gl/8NHKB * efficient functional data structure for finite bijections votes: 6, answers: 2 Read on SO: [34] http://goo.gl/bXA1Ke Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.general/19157 2. http://www.haskell.org/pipermail/haskell/2012-May/023328.html 3. http://www.reddit.com/r/haskell/comments/trf72/announce_forthcoming_oreilly_book_on_parallel_and/ 4. http://hackage.haskell.org/trac/ghc/wiki/Status/May12 5. http://www.reddit.com/r/haskell/comments/tm1mc/ghc_76_will_have_support_for_deferred_type_errors/ 6. http://blog.ezyang.com/2012/05/what-happens-when-you-mix-three-research-programming-languages-together/ 7. http://www.reddit.com/r/haskell/comments/tptuo/what_happens_when_you_mix_three_research/ 8. http://apfelmus.nfshost.com/blog/2012/05/15-frp-banana-0-6.html 9. http://www.reddit.com/r/haskell/comments/toghk/reactivebanana_06_frp_in_haskell_supports_both/ 10. http://www.yesodweb.com/blog/2012/05/keter-its-alive 11. http://www.reddit.com/r/haskell/comments/tsyv5/keter_its_alive_web_app_deployment_system_for/ 12. https://personal.cis.strath.ac.uk/~raa/posts/2012-01-06-streams.html 13. http://www.reddit.com/r/haskell/comments/tm7ur/reasoning_about_stream_processing_with_effects/ 14. http://hip-to-be-square.com/~blackh/ghc-iphone-new/v4/ 15. http://www.reddit.com/r/haskell/comments/tnnqc/patches_for_the_new_ghciphone_v4_builds_but_needs/ 16. http://bosker.wordpress.com/2012/05/10/on-editing-text/ 17. http://www.reddit.com/r/haskell/comments/ts3sz/commutative_edits_and_exceptions_categorically/ 18. http://www.well-typed.com/blog/66 19. http://www.reddit.com/r/haskell/comments/tta8y/parallel_haskell_digest_10_spj_on_cloud_haskell/ 20. http://dynamicaspects.org/blog/2012/05/15/back-to-the-future/ 21. http://www.reddit.com/r/haskell/comments/tokmh/interactive_programming_with_lambdacalc/ 22. https://github.com/axman6/BitParser/tree/bs-state 23. http://www.reddit.com/r/haskell/comments/tmhca/bitparser_rfc_on_a_new_parsing_library_for/ 24. http://stackoverflow.com/questions/10626943/haskell-between-a-list-and-a-tuple 25. http://stackoverflow.com/questions/10609936/why-is-it-so-uncommon-to-use-type-signatures-in-where-clauses 26. http://stackoverflow.com/questions/10663888/is-there-any-good-haskell-indentation-script-for-vim 27. http://stackoverflow.com/questions/10611382/haskell-exceptions 28. http://stackoverflow.com/questions/10656402/is-it-possible-to-program-and-check-invariants-in-haskell 29. http://stackoverflow.com/questions/10578572/the-handle-function-and-real-world-haskell 30. http://stackoverflow.com/questions/10592920/haskell-flatten-binary-tree 31. http://stackoverflow.com/questions/10576868/how-can-i-uninstall-a-version-of-a-cabal-package 32. http://stackoverflow.com/questions/10604808/fault-tolerant-json-parsing 33. http://stackoverflow.com/questions/10608602/can-a-haskell-or-haskell-os-thread-waiting-on-network-socket-accept-not-be-kille 34. http://stackoverflow.com/questions/10669217/efficient-functional-data-structure-for-finite-bijections </pre> Daniel Santa Cruz 2012-05-24T01:29:14 http://comments.gmane.org/gmane.comp.lang.haskell.general/19320 <pre>CALL FOR PARTICIPATION 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 Hotel rooms reserved until: *** 30th May 2012 *** Early registration deadline: *** 6th June 2012 *** BACKGROUND The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. The 2012 MPC conference will be held in Madrid, Spain, from 25th to 27th June 2012. VENUE The conference will take place in Madrid, the capital of Spain, in the Sala de Grados of the Facultad de Informática of Universidad Complutense de Madrid, right in Madrid's Ciudad Universitaria (city campus), not far from the city centre and other major tourist attractions. Accommodation has been reserved in a nearby 4-star hotel, the VP Jardin Metropolitano. REGISTRATION Conference registration is now open; see http://babel.ls.fi.upm.es/mpc2012/registration.html Registration fees have been kept low thanks to a grant from the Spanish Ministerio de Economia y Competitividad. The early registration fee is €240, which includes lunches, coffees, and social events. The early registration deadline is 6th June 2012; after this point, the registration fee rises to €340. Hotel reservation is handled separately; see http://babel.ls.fi.upm.es/mpc2012/accom.html We have a block booking of rooms at the conference hotel at a special reduced rate, but only until 30th May 2012; after this point, the rooms will be released and the special rate unavailable. (There are few well-connected budget hotels in the area, and June marks the start of Spain's tourist season with a sharp rise in hotel rates; so we strongly advise you to meet this hotel registration deadline.) INVITED SPEAKERS * Gilles Barthe, IMDEA Software Institute (http://software.imdea.org/people/gilles.barthe/) "Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs" * Dan Ghica, University of Birmingham (http://www.cs.bham.ac.uk/~drg/) "The Geometry of Synthesis: How to Make Hardware out of Software" * Tony Hoare, Microsoft Research (http://research.microsoft.com/en-us/people/thoare/) "The Laws of Programming Unify Process Calculi" ACCEPTED PAPERS * "Scheduler-Independent Declassification" Alexander Lux, Heiko Mantel and Matthias Perner * "Elementary Probability Theory in the Eindhoven Style" Carroll Morgan * "Scheduling and Buffer Sizing of n-Synchronous Systems: Typing of Ultimately Periodic Clocks in Lucy-n" Louis Mandel and Florence Plateau * "Deriving Real-Time Action Systems Controllers from Multiscale System Specifications" Brijesh Dongol and Ian J. Hayes * "Calculating Graph Algorithms for Dominance and Shortest Path" Ilya Sergey, Jan Midtgaard and Dave Clarke * "First-Past-the-Post Games" Roland Backhouse * "Reverse Exchange for Concurrency and Local Reasoning" Han-Hing Dang and Bernhard Möller * "Unifying Correctness Statements" Walter Guttmann * "Dependently Typed Programming based on Automated Theorem Proving" Alasdair Armstrong, Simon Foster and Georg Struth * "An Algebraic Calculus of Database Preferences" Bernhard Möller, Patrick Roocks and Markus Endres * "Modular Tree Automata" Patrick Bahr * "Constructing Applicative Functors" Ross Paterson * "Kan Extensions for Program Optimisation, Or: Art and Dan Explain an Old Trick" Ralf Hinze SOCIAL EVENTS The conference excursion will be a guided tour of Madrid's Royal Palace. The banquet will be Northern Spanish cuisine at the Sidreria-Asador Gaztemanu. PROGRAMME COMMITTEE Jeremy Gibbons University of Oxford, UK (co-chair) Pablo Nogueira Universidad Politécnica de Madrid, ES (co-chair) Ralph Back Åbo Akademi, FI Roland Backhouse University of Nottingham, UK Eerke Boiten University of Kent, UK William Cook University of Texas at Austin, US Jules Desharnais Université Laval, CA Lindsay Groves Victoria University of Wellington, NZ Ian Hayes University of Queensland, AU Ralf Hinze University of Oxford, UK Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht Universiteit, NL Christian Lengauer Universität Passau, DE Larissa Meinicke University of Queensland, AU Bernhard Möller Universität Augsburg, DE Carroll Morgan University of New South Wales, AU Shin-Cheng Mu Academia Sinica, TW Dave Naumann Stevens Institute of Technology, US Jose Oliveira Universidade do Minho, PT Steve Reeves University of Waikato, NZ Wouter Swierstra Utrecht Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA LOCAL ORGANIZERS Pablo Nogueira Universidad Politécnica de Madrid Ricardo Peña Universidad Complutense de Madrid Alvaro García IMDEA Software Institute and Universidad Politécnica de Madrid Manuel Montenegro Universidad Complutense de Madrid For queries about local matters, please write to pablo&lt; at &gt;babel.ls.fi.upm.es. _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Jeremy.Gibbons< at >cs.ox.ac.uk 2012-05-23T21:35:01 http://comments.gmane.org/gmane.comp.lang.haskell.general/19319 <pre> ============================================================ LOPSTR'12 DEADLINE EXTENSION 22nd International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2012 http://costa.ls.fi.upm.es/lopstr12 Leuven, Belgium, September 18-20, 2012 NEW DEADLINES Abstract submission: June 4, 2012 Paper submission: June 10, 2012 ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 22nd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2012) will be held in Leuven, Belgium; previous symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, Manchester and Odense (you might have a look at the contents of past LOPSTR symposia). LOPSTR 2012 will be co-located with PPDP 2012 (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Both full papers and extended abstracts describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: * specification * verification * analysis * specialization * composition * certification * transformational techniques in SE * synthesis * transformation * optimisation * inversion * program/model manipulation * security * applications and tools Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Proceedings The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series. Important Dates Abstract submission: June 4, 2012 Paper submission: June 10, 2012 Notification (for pre-proceedings): July 13, 2012 Camera-ready (for pre-proceedings): July 20, 2012 Symposium: September 18-20, 2012 Submissions must be formatted in the Lecture Notes in Computer Science style. They cannot exceed 15 pages including references but excluding well-marked appendices not intended for publication. Referees are not required to read the appendices, and thus papers should be intelligible without them. Full papers can be directly accepted for publication in the formal proceedings to be published by Springer in the LNCS series or accepted only for presentation at the symposium. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Authors should submit an electronic copy of the paper (written in English) in PDF or Postscript (Level 2). Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. If electronic submission is impossible, please contact the program chair for information on how to submit hard copies. Papers should be submitted to the submission website for LOPSTR 2012. Invited speakers: - Tom Schrijvers, University of Ghent, Belgium - Jürgen Giesl, RWTH Aachen, Germany (shared with PPDP) Program Committee: Elvira Albert Complutense University of Madrid, Spain Sergio Antoy Portland State University, US Demis Ballis University of Udine, Italy Henning Christiansen Roskilde University, Denmark Michael Codish Ben-Gurion University of the Negev, Israel Danny De Schreye K.U.Leuven, Belgium Esra Erdem Sabanci University, Istanbul Maribel Fernandez King's College London, UK John Gallagher Roskilde University, Denmark Robert Glück University of Copenhagen, Denmark Miguel Gomez-Zamalloa Complutense University of Madrid, Spain Rémy Haemmerlé Technical University of Madrid, Spain Reiner Hähnle TU Darmstadt, Germany Geoff Hamilton Dublin City University, Ireland Carsten Fuhs University College London, UK Gerda Janssens K.U.Leuven, Belgium Isabella Mastroeni University of Verona, Italy Kazutaka MatsudaUniversity of Tokyo, Japan Paulo Moura Universidade da Beira Interior, Portugal Johan Nordlander Luleå University of Technology, Sweden Andrey Rybalchenko Technische Universität München, Germany Kostis Sagonas Uppsala University, Sweden Francesca Scozzari Università "G. D'Annunzio" di Chieti, Italy Valerio Senni Universtà di Roma "Tor Vergata", Italy German Vidal Technical University of Valencia, Spain Program Chair: Elvira Albert Department of Computer Science (DSIC) Complutense University of Madrid Madrid, Spain General Co-Chairs Daniel De Schreye and Gerda Janssens Department of Computer Science K.U.Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Jon Sneyers 2012-05-23T12:44:12 http://comments.gmane.org/gmane.comp.lang.haskell.general/19318 <pre>------------------------------------------------------------------------------- CALL FOR PAPERS 24th Symposium on Implementation and Application of Functional Languages (IFL 2012) University of Oxford, UK, August 30-September 1, 2012 http://www.cs.ox.ac.uk/conferences/IFL2012/ This year IFL will be hosted by the University of Oxford, within the idyllic setting of the dreaming spires and picturesque colleges, which have been the home to academic endeavour and research for over nine centuries. The symposium will be held between 30 August and 1 September, 2012. Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2012 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2012 will use a post-symposium review process to produce formal proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. All participants in IFL 2012 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. Work submitted to IFL must not be submitted simultaneously to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/republicationpolicy.htm. The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools. If you are not sure that your work is appropriate for IFL 2012, please contact the PC chair at ralf.hinze&lt; at &gt;cs.ox.ac.uk. Topics of interest include, but are not limited to: language concepts type checking contracts compilation techniques staged compilation run-time function specialization run-time code generation partial evaluation (abstract) interpretation generic programming automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution functional programming and embedded systems functional programming and web applications functional programming and security novel memory management techniques run-time profiling and performance measurements debugging and tracing virtual/abstract machine architectures validation and verification of functional programs tools and programming techniques (industrial) applications of functional programming Submission details ------------------ Presentation submission deadline: July 30th, 2012 Notification of acceptance: August 1st, 2012 Early registration deadline: August 10th, 2012 IFL 2012 Symposium: August 30-September 1, 2012 Submission for (post) review process: November 30th, 2012 Notification Accept/Reject: February 4th, 2013 Camera ready version: March 18th, 2013 Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Department of Computer Science of the University of Oxford. (We are more liberal with the draft proceedings, where longer papers or SIGPLAN 2 column 12 page papers are acceptable. For other formats please contact the chair at ralf.hinze&lt; at &gt;cs.ox.ac.uk. For consideration for the final proceedings, only the 16 page LNCS format will be accepted.) Papers are to be submitted via the conference's EasyChair submission page: https://www.easychair.org/conferences/?conf=ifl2012 Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Edwin Brady, University of St. Andrews, UK Andrew Butterfield, University of Dublin, Ireland Matthew Flatt, University of Utah, US Andy Gill, University of Kansas, US Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (Chair), University of Oxford, UK Zhenjiang Hu, National Institute of Informatics, Japan Patrik Jansson, Chalmers University of Technology, Sweden Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Gabriele Keller, University of New South Wales, Australia Simon Marlow, Microsoft Research, UK Pablo Nogueira, Technical University of Madrid, Spain Bruno Oliveira, Seoul National University, Korea José Nuno Oliveira, University of Minho, Portugal Rinus Plasmeijer, Radboud University Nijmegen, Netherlands Tom Schrijvers, Ghent University, Belgium Tim Sheard, Portland State University, US Wouter Swierstra, University of Utrecht, Netherlands Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Steve Zdancewic, University of Pennsylvania, US _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Tom Harper 2012-05-23T11:15:35 http://comments.gmane.org/gmane.comp.lang.haskell.general/19311 <pre>Hi everyone, just a quick reminder: the talk submission proposal for this year's CUPF is 29 June 2012. If you have something interesting to say about commercial applications of functional programming languages (especially Haskell, of course!), please submit a proposal. Thanks, Stefan COMMERCIAL USERS OF FUNCTIONAL PROGRAMMING 2012 CUFP 2012 http://cufp.org/conference CALL FOR PRESENTATIONS Copenhagen, Denmark Sep 13-15 Co-located with ICFP 2012 Sponsored by SIGPLAN Talk Proposal Submission Deadline 29 June 2012 The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. Giving a CUFP Talk ================== If you have experience using functional languages in a practical setting, we invite you to submit a proposal to give a talk at the workshop. We're looking for two kinds of talks: Experience reports are typically 25 minutes long, and aim to inform participants about how functional programming plays out in real-world applications, focusing especially on lessons learned and insights gained. Experience reports don't need to be highly technical; reflections on the commercial, management, or software engineering aspects are, if anything, more important. Technical talks are also 25 minutes long, and should focus on teaching the audience something about a particular technique or methodology, from the point of view of someone who has seen it play out in practice. These talks could cover anything from techniques for building functional concurrent applications, to managing dynamic reconfigurations, to design recipes for using types effectively in large-scale applications. While these talks will often be based on a particular language, they should be accessible to a broad range of programmers. If you are interested in offering a talk, or nominating someone to do so, send an e-mail to sperber(at)deinprogramm(dot)de or avsm2(at)cl(dot)cam(dot)ac(dot)uk by 29 June 2012 with a short description of what you'd like to talk about or what you think your nominee should give a talk about. Such descriptions should be about one page long. There will be a short scribes report of the presentations and discussions but not of the details of individual talks, as the meeting is intended to be more a discussion forum than a technical interchange. You do not need to submit a paper, just a proposal for your talk! Program Committee ================= Mike Sperber (Active Group), co-chair Anil Madhavapeddy (University of Cambridge), co-chair Ashish Agarwal (New York University) Thomas Arts (QuviQ AB) Chris Houser (LonoCloud) Tomas Petricek (University of Cambridge) Heiko Seeberger (Typesafe) Stefan Wehr (factis research) Noel Welsh (untyped) More information ================ For more information on CUFP, including videos of presentations from previous years, take a look at the CUFP website at http://cufp.org. Note that presenters, like other attendees, will need to register for the event. Presentations will be video taped and presenters will be expected to sign an ACM copyright release form. Acceptance and rejection letters will be sent out by July 16th. Guidance on giving a great CUFP talk ==================================== Focus on the interesting bits: Think about what will distinguish your talk, and what will engage the audience, and focus there. There are a number of places to look for those interesting bits. Setting: FP is pretty well established in some areas, including formal verification, financial processing and server-side web-services. An unusual setting can be a source of interest. If you're deploying FP-based mobile UIs or building servers on oil rigs, then the challenges of that scenario are worth focusing on. Did FP help or hinder in adapting to the setting? Technology: The CUFP audience is hungry to learn about how FP techniques work in practice. What design patterns have you applied, and to what areas? Did you use functional reactive programming for user interfaces, or DSLs for playing chess, or fault-tolerant actors for large scale geological data processing? Teach us something about the techniques you used, and why we should consider using them ourselves. Getting things done: How did you deal with large software development in the absence of a myriad of pre-existing support that are often expected in larger commercial environments (IDEs, coverage tools, debuggers, profilers) and without larger, proven bodies of libraries? Did you hit any brick walls that required support from the community? Don't just be a cheerleader: It's easy to write a rah-rah talk about how well FP worked for you, but CUFP is more interesting when the talks also spend time on what doesn't work. Even when the results were all great, you should spend more time on the challenges along the way than on the parts that went smoothly. </pre> Stefan Wehr 2012-05-21T18:34:59 http://comments.gmane.org/gmane.comp.lang.haskell.general/19310 <pre>[Apologies for multiple copies...] ----------------------------------------------------------- WLPE 2012 - CALL FOR PAPERS Workshop on Logic-based Methods in Programming Environments (satellite workshop of ICLP 2012) September 8, 2012 Budapest, Hungary http://users.dsic.upv.es/workshops/wlpe2012/ ----------------------------------------------------------- The workshop aims at providing an informal meeting for researchers working on logic-based tools for development and analysis of programs. In addition to papers describing more conceptual work on environmental tools, we solicit papers describing the implementation of and experimentation with such tools. We hope to attain the same friendly atmosphere as in past workshops, which enabled fruitful exchanges leading to joint research and subsequent publications. Areas particularly relevant to the workshop include: * static and dynamic analysis * debugging and testing * program verification and validation * code generation from specifications * termination and non-termination analysis * reasoning on occurs-check freeness and determinacy * frameworks and resources for sharing in the logic programming community * profiling and performance analysis * type- and mode analysis * shape, point-to and escape analysis * module systems * optimization tools * program understanding * refactoring * logical meta-languages Note that this list is not exhaustive and, if you are interested in taking part in the workshop but unsure if your work falls within its scope, do contact the organisers who will be happy to advise. The 22nd Workshop on Logic-based methods in Programming Environments will take place in Budapest, Hungary, as a satellite workshop of ICLP 2012, the 28the International Conference on Logic Programming. This workshop will continue the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington, USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium and Port Jefferson, USA (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004), Sitges, Spain (2005), Seattle, Washington USA (2006), Porto, Portugal (2007), Udine, Italy (2008), Pasadena, USA (2009), Edinburgh, UK (2010), and Odense, Denmark (2011). This year WLPE will be coordinated with CICLOPS. In particular, there will be two special events organised: (a) SWI-25, a celebration and retrospective of the open source SWI-Prolog engine on the occasion of its 25th birthday, and (b) OpenPL, an event on (1) coordinating efforts towards furthering cross-engine compatibility, with a focus on libraries and add-on packages, and (2) the creation of a user-contributing repository of Prolog code. Submission guidelines --------------------- We encourage the submission of original research in the area as well as relevant results that have been submitted, rejected, or accepted elsewhere as long as they are relevant for the WLPE community. All papers must be written in English and should not exceed 15 pages. We welcome also shorter submissions, e.g., extended abstracts and short papers, of at least 3 pages. Papers should be submitted electronically via the submission page: https://www.easychair.org/conferences/?conf=wlpe2012 An informal proceedings will be distributed electronically at the workshop. After the workshop, the proceedings will be publicly available on-line in the Computing Research Repository (CoRR). Important dates --------------- Submission: June 20, 2012 Notification: July 16, 2012 Camera-ready: July 27, 2012 Workshop: September 8, 2012 Workshop organizers ------------------- Win Vanhoof Faculty of Computer Science University of Namur Namur, Belgium Email: wlpe2012&lt; at &gt;dsic.upv.es Alicia Villanueva Department of Computer Science (DSIC) Universitat Politècnica de València Valencia, Spain Email: wlpe2012&lt; at &gt;dsic.upv.es Program committee ----------------- Salvador Abreu Universidade de Évora, Portugal Petra Hofstedt University of Technology Berlin, Germany Jacob Howe City University London, UK Yoshitaka Kameya Tokyo Institute of Technology, Japan Roland Kaminski Universität Postdam, Germany Lunjin Lu Oakland University, USA Alexander Serebrenik Eindhoven University of Technology, The Netherlands Peter Schneider-Kamp University of Southern Denmark, Denmark Zoltan Somogyi University of Melbourne, Australia Win Vanhoof University of Namur, Belgium Alicia Villanueva Universitat Politècnica de València, Spain Damiano Zanardini Universidad Politécnica de Madrid, Spain </pre> Wim Vanhoof 2012-05-21T06:57:36 http://comments.gmane.org/gmane.comp.lang.haskell.general/19309 <pre>====== CALL FOR PARTICIPATION ================================================== 24th International Conference on Computer Aided Verification (CAV 2012) July 7-13, 2012 Berkeley, California, USA Program Chairs: Madhusudan Parathasarathy and Sanjit A. Seshia Website: http://cav12.cs.illinois.edu/ Aims and Scope -------------------------------------------------------------------------------- The conference on Computer Aided Verification (CAV), 2012, is the 24th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM. ** NEW in 2012 ** -------------------------------------------------------------------------------- CAV will have *special tracks* in the following four areas: 1. Hardware Verification (track chair: Andreas Kuehlmann) 2. Computer Security (track chair: Somesh Jha) 3. Embedded Systems (track chair: Stavros Tripakis) 4. SAT and SMT (track chair: Daniel Kroening) Invited Talks -------------------------------------------------------------------------------- - Wolfgang Thomas, RWTH Aachen University "Synthesis and Some of Its Challenges" - David Dill, Stanford University "Model Checking Cell Biology" - Alex Haldermann, University of Michigan On security of voting machines Invited Tutorials -------------------------------------------------------------------------------- - Rastislav Bodik and Emina Torlak, University of California, Berkeley "Synthesizing Programs with Constraint Solvers" - Aaron Bradley, University of Colorado at Boulder "IC3 and Beyond: Incremental, Inductive Verification" - Chris Myers, University of Utah "Formal Verification of Genetic Circuits" - Michał Moskal, Microsoft Research, Seattle "From C to infinity and back: Unbounded auto-active verification with VCC" ====== CONFERENCE PROGRAM ====================================================== Saturday July 7 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - LfSA 2012 Logics for System Analysis Co-chairs: André Platzer, Philipp Rümmer Sunday July 8 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - BOOGIE 2012 2nd International Workshop on Intermediate Verification Languages Chair: Zvonimir Rakamaric - REORDER 2012 First International Workshop on Memory Consistency Models Co-chairs: Sela Mador-Haim, Jade Alglave Monday July 9 - INVITED TUTORIALS ---------------------------------------- 8:30 - 10:00: "Synthesizing Programs with Constraint Solvers" (Ras Bodik and Emina Torlak) 10:00 - 10:30: Break 10:30 - 12:00: "IC3 and Beyond: Incremental, Inductive Verification" (Aaron Bradley) 12:00 - 1:30: Break 1:30 - 3:00: "Formal Verification of Genetic Circuits" (Chris Myers) 3:00 - 3:30: Break 3:30 - 5:00: "From C to infinity and back: Unbounded auto-active verification with VCC" (Michal Moskal) Tuesday July 10 ---------------------------------------- 8:30 - 9:00: Welcome 9:00 - 10:00: "Synthesis and Some of Its Challenges" (Wolfgang Thomas - Keynote) 10:00 - 10:30: Break 10:30 - 12:00: AUTOMATA AND SYNTHESIS R1 Jan Kretinsky and Javier Esparza "Deterministic Automata for the (F,G)-fragment of LTL" R2 Tomas Brazdil, Krishnendu Chatterjee, Antonin Kucera and Petr Novotny "Efficient Controller Synthesis for Consumption Games with Multiple Resource Types" R3 Rüdiger Ehlers "ACTL ∩ LTL Synthesis" T1 François Raskin "Acacia+, a tool for LTL synthesis" T2 Chih-Hong Cheng, Michael Geisinger, Harald Ruess, Christian Buckl and Alois Knoll "MGSyn: Automatic Synthesis for Industrial Automation" 12:00 - 1:30: Break 1:30 - 3:35: INDUCTIVE INFERENCE AND TERMINATION R4 Yu-Fang Chen and Bow-Yaw Wang "Learning Boolean Functions Incrementally" R5 Rahul Sharma, Aditya Nori and Alex Aiken "Interpolants as Classifiers" R6 Wonchan Lee, Bow-Yaw Wang and Kwangkeun Yi "Termination Analysis with Algorithmic Learning" R7 Marc Brockschmidt, Richard Musiol, Carsten Otto and Jürgen Giesl "Automated Termination Proofs for Java Programs with Cyclic Data" R8 Javier Esparza, Andreas Gaiser and Stefan Kiefer "Proving Termination of Probabilistic Programs Using Patterns" 3:35 - 4:00: Break 4:00 - 6:05: ABSTRACTION R9 Arnaud Venet "The Gauge Domain: Scalable Analysis of Linear Inequality Invariants" R10 Josh Berdine, Arlen Cox, Samin Ishtiaq and Christoph Wintersteiger "Diagnosing Abstraction Failure for Separation Logic-based Analyses" R11 Aditya Thakur and Thomas Reps "A Method for Symbolic Computation of Abstract Operations" R12 Simone Fulvio Rollini, Ondrej Sery and Natasha Sharygina "Leveraging Interpolant Strength in Model Checking" T3 Evan Driscoll, Aditya Thakur and Thomas Reps "OpenNWA: A Nested Word Automaton Library" T4 Aws Albarghouthi, Yi Li, Arie Gurfinkel and Marsha Chechik "UFO: A Framework for Abstraction- and Interpolation-Based Verification" T5 Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise and Natasha Sharygina "SAFARI: SMT-based Abstraction For Arrays with Interpolants" 6:30 - 8:30: PC dinner Wednesday July 11 ---------------------------------------- 8:35 - 10:35: CONCURRENCY &amp; SOFTWARE VERIFICATION R13 Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi and Akash Lal "Detecting Fair Non-Termination in Multithreaded Programs" R14 Vineet Kahlon and Chao Wang "Lock Removal for Concurrent Trace Programs" R15 Gerhard Schellhorn, John Derrick and Heike Wehrheim "How to prove algorithms linearisable" R16 Anthony Widjaja Lin and Matthew Hague "Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters" R17 Alessandro Cimatti and Alberto Griggio "Software Model Checking via IC3" 10:35 - 11:00: Break 11:00 - 12:00: "Model Checking Cell Biology" (David Dill - Keynote) 12:00 - 1:30: Lunch 1:30 - 3:00: BIOLOGY &amp; PROBABILISTIC SYSTEMS R18 Calin Guet, Ashutosh Gupta, Thomas A. Henzinger, Maria Mateescu and Ali Sezgin "Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits" R19 Anvesh Komuravelli, Corina S. Pasareanu and Edmund M. Clarke "Assume-Guarantee Abstraction Refinement for Probabilistic Systems" R20 Cyrille Jegourel, Axel Legay and Sean Sedwards "Cross entropy optimisation of importance sampling parameters for statistical model checking" T6 David Benque, Sam Bourton, Caitlin Cockerton, Byron Cook, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Alex Taylor and Moshe Vardi "Ripple: Visual Tool for Modeling and Analysis of Biological Networks" T7 Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, Björn Wachter and James Worrell "APEX: An analyzer for open probabilistic programs" 3:30 - 4:00: Break 4:00 - 5:30: *EMBEDDED AND CONTROL SYSTEMS* - special track session R21 Adiya Zutshi, Sriram Sankaranarayanan and Ashish Tiwari "Timed Relational Abstractions For Sampled Data Control Systems" R22 Rupak Majumdar and Majid Zamani "Approximately Bisimilar Symbolic Models for Digital Control Systems" R23 Alessandro Cimatti, Raffaele Corvino, Armando Lazzaro, Iman Narasamdya, Tiziana Rizzo, Marco Roveri, Angela Sanseviero and Andrei Tchaltsev "Formal Verification and Validation of ERTMS Industrial Railway Train Spacing System" T8 Philip Armstrong, Joel Ouaknine, Hristina Palikareva and Bill Roscoe "Recent Developments in FDR" T9 Songzheng Song, Jun Sun, Yang Liu and Jin Song Dong "A Model Checker for Hierarchical Probabilistic Real-time Systems" 6:00 - 9:30: Banquet Thursday July 12 ---------------------------------------- 8:30 - 10:00: *SAT/SMT SOLVING AND SMT-BASED VERIFICATION* - special track session R24 Isil Dillig, Thomas Dillig, Kenneth McMillan and Alex Aiken "Minimum Satisfying Assignments for SMT" R25 Cheng-Shen Han and Jie-Hong Roland Jiang "When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way" R26 Akash Lal, Shaz Qadeer and Shuvendu Lahiri "Corral: A Solver for Reachability Modulo Theories" T10 Shuvendu Lahiri, Chris Hawblitzel, Ming Kawaguchi and Henrique Rebêlo "SymDiff: A language-agnostic semantic diff tool" T11 Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout and Fatiha Zaidi "Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems" 10:00 - 10:30: Break 10:30 - 12:00: *TIMED &amp; HYBRID SYSTEMS* - special track session R27 Shibashis Guha, Chinmay Narayan and S. Arun-Kumar "On Decidability of Prebisimulation for Timed Automata" R28 Ichiro Hasuo and Kohei Suenaga "Exercises in Nonstandard Static Analysis of Hybrid Systems" R29 Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski and Martin Wehrle "A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx" T12 Ashish Tiwari "HybridSal Relational Abstracter" T13 Swarat Chaudhuri and Armando Solar-Lezama "Euler: A System for Numerical Optimization of Programs" 12:00 - 1:30: Lunch 1:30 - 2:45: *HARDWARE VERIFICATION* - special track session R30 Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Scott Owens, Jade Alglave, Kayvan Memarian, Rajeev Alur, Milo Martin, Peter Sewell and Derek Williams "An Axiomatic Memory Model for Power Multiprocessors" R31 Flavio M de Paula, Alan Hu and Amir Nahir "nuTAB-BackSpace: Rewriting to Normalize Non-Determinism in Post-Silicon Debug Traces" R32 Zyad Hassan, Aaron Bradley and Fabio Somenzi "Incremental Inductive CTL Model Checking" 2:45 - 3:35: Miscellaneous Tools T14 Rishabh Singh and Armando Solar-Lezama "SPT : Storyboard Programming Tool" T15 Patrick Rondon, Ming Kawaguchi, Alexander Bakst and Ranjit Jhala "CSolve: Verifying C With Liquid Types" T16 Daniel Schwartz-Narbonne, Feng Liu, David August and Sharad Malik "PASSERT: A tool for debugging parallel programs" T17 Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas and Andrew E. Santosa "TRACER: A Symbolic Execution Tool for Verification" T18 Stephan Arlt and Martin Schäf "Joogie: Infeasible Code Detection for Java" T19 David Hopkins, Andrzej Murawski and Luke Ong "Hector: An Equivalence Checker for a Higher-Order Fragment of ML" T20 Jan Hoffmann, Klaus Aehlig and Martin Hofmann "Resource Aware ML" 3:35 - 4:00: Break 4:00 - 5:30: Tool demo/poster session 5:30 - 6:30: CAV business meeting 6:30 - 9:00: SC dinner Friday July 13 ---------------------------------------- 9:00 - 10:00: On security of voting machines (Alex Haldermann - Invited talk) 10:00 - 10:30: Break 10:30 - 11:45: *SECURITY* - special track session R33 Matt Fredrikson, Richard Joiner, Somesh Jha, Thomas Reps, Phillip Porras, Hassen Saidi and Vinod Yegneswaran "Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement" R34 Boris Köpf, Laurent Mauborgne and Martín Ochoa "Automatic Quantification of Cache Side-Channels" R35 William Harris, Somesh Jha and Thomas Reps "Secure Programming via Visibly Pushdown Safety Games" 11:45 - 11:50: Mini-break 11:50 - 1:05: VERIFICATION AND SYNTHESIS R36 Nishant Sinha, Nimit Singhania, Satish Chandra and Manu Sridharan "Alternate and Learn: Finding witnesses without looking all over" R37 Duc Hiep Chu and Joxan Jaffar "A Complete Method for Symmetry Reduction in Safety Verification" R38 Rishabh Singh and Sumit Gulwani "Synthesizing Number Transformations from Input-Output Examples" 1:00 - 1:15: Conference Wrap-up _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> CAV 2012 CFP 2012-05-17T19:43:45 http://comments.gmane.org/gmane.comp.lang.haskell.general/19305 <pre>I'm delighted to announce that O'Reilly have agreed to publish a book on Parallel and Concurrent Haskell authored by me. The plan is to make a significantly revised and extended version of the Parallel and Concurrent Haskell tutorial from CEFP'11: http://community.haskell.org/~simonmar/bib/par-tutorial-cefp-2012_abstract.html The book will be published in both hardcopy and electronic formats, and will also be available online under a Creative Commons license (Attribution-NonCommercial-NoDerivs 3.0). There will be some mechanism for people to see and comment on early drafts, but I don't know the details yet. When will it be done? I can't say for sure, but the tentative date for completion is March 2013. I'm really keen for this to be a book that will be useful to people both learning about parallelism and concurrency in Haskell, and coding stuff for real-world use. If there are topics or application areas that you'd like to see covered, or any other suggestions, please let me know. All contributions will be acknowledged, of course! Cheers, Simon </pre> Simon Marlow 2012-05-17T09:21:58 http://comments.gmane.org/gmane.comp.lang.haskell.general/19304 <pre>Welcome to issue 227 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of May 6 to 12, 2012. Announcements Doaitse Swierstra reminded us about the Summer School on Applied Functional Programming, at Utrech University. Hurry to check it out, as the deadline for registration is May 20th! [1] http://goo.gl/TZYdd Janis Voigtlander announced the release of the 22nd edition of the Haskell Communities and Activities Report. [2] http://goo.gl/pXIZn Quotes of the Week * dcoutts: (on #darcs): "[on github:] it's like the facebook of source repos" * dmwit: "Functional programming" is a technical term that means more than just what the two words mean separately. * Axman6: "GHC Warning: Did you see that in an OOP textbook? You probably don't want to be doing that" * StevenKaas: Haskell's Wager: what if infinite lists can suffer infinitely even when lazily evaluated? * quicksilver: "Patent covering a device for emitting greetings to the world community as a whole in computer-readable format" (US Patent no 1787528391) Top Reddit Stories * Videos to the functional programming course I attend are freely available. I thought you might enjoy them. Domain: self.haskell, Score: 47, Comments: 10 On Reddit: [3] http://goo.gl/SoV7x Original: [4] http://goo.gl/SoV7x * red-black trees in haskell, using GADTs, existential types, and zippers, oh my Domain: gist.github.com, Score: 40, Comments: 21 On Reddit: [5] http://goo.gl/Ae08L Original: [6] http://goo.gl/iDxjY * Equality proofs and deferred type errors, A compiler pearl [Vytiniotis, Peyton Jones,Magalhaes PDF] Domain: research.microsoft.com, Score: 40, Comments: 17 On Reddit: [7] http://goo.gl/6OUbX Original: [8] http://goo.gl/OP6ep * LLVM now supports NVIDIA GPU's Domain: nvidianews.nvidia.com, Score: 36, Comments: 19 On Reddit: [9] http://goo.gl/DF7sY Original: [10] http://goo.gl/rvYdL * The Architecture of Open Source Applications, Volume II (with chapters on GHC and Yesod, royalties go to Amnesty International) Domain: lulu.com, Score: 35, Comments: 9 On Reddit: [11] http://goo.gl/XfsXB Original: [12] http://goo.gl/1sr6u * Jesper's Blog: My Take on Haskell vs Scala Domain: jnordenberg.blogspot.com, Score: 29, Comments: 8 On Reddit: [13] http://goo.gl/3EM45 Original: [14] http://goo.gl/aWGgn * Haskell Communities and Activities Report --- May 2012 Domain: haskell.org, Score: 27, Comments: 3 On Reddit: [15] http://goo.gl/q8XFZ Original: [16] http://goo.gl/fW3Sf * Keter: Web App Deployment Domain: yesodweb.com, Score: 23, Comments: 19 On Reddit: [17] http://goo.gl/VOSVF Original: [18] http://goo.gl/OJ783 * A small and simple tip for Google Code Jam-mers Domain: self.haskell, Score: 22, Comments: 15 On Reddit: [19] http://goo.gl/9QPDW Original: [20] http://goo.gl/9QPDW * Composable Value Editors for GTK Domain: twdkz.wordpress.com, Score: 21, Comments: On Reddit: [21] http://goo.gl/w4WoR Original: [22] http://goo.gl/LevtB * The Brittleness of Type Hierarchies (codegrunt.co.uk) and a Haskell approach Domain: self.haskell, Score: 16, Comments: 17 On Reddit: [23] http://goo.gl/w4m8o Original: [24] http://goo.gl/w4m8o Top StackOverflow Questions * Static types, polymorphism and specialization votes: 18, answers: 3 Read on SO: [25] http://goo.gl/wxDZt * Redoing the standard classes [closed] votes: 12, answers: 2 Read on SO: [26] http://goo.gl/22MCG * Using Cont to acquire values from the future and the past votes: 11, answers: 1 Read on SO: [27] http://goo.gl/1zSVo * Why is `($ 4) (&gt; 3)` equivalent to `4 &gt; 3`? votes: 9, answers: 3 Read on SO: [28] http://goo.gl/5oTei * Recursively defined instances and constraints votes: 9, answers: 1 Read on SO: [29] http://goo.gl/uliWA * Freeing memory allocated with newCString votes: 8, answers: 1 Read on SO: [30] http://goo.gl/k3Izw * What is the meaning of “quasi” in quasiquotations? votes: 8, answers: 5 Read on SO: [31] http://goo.gl/YjPbl * Ensuring files are closed promptly votes: 7, answers: 3 Read on SO: [32] http://goo.gl/UCKSB * Is there ever a good reason to use unsafePerformIO? votes: 7, answers: 5 Read on SO: [33] http://goo.gl/y2meC * What characters are permitted for haskell operators? votes: 7, answers: 3 Read on SO: [34] http://goo.gl/0n1kX * Defining an algebra module using constructive-algebra package votes: 6, answers: 2 Read on SO: [35] http://goo.gl/vqIcG * Haskell: Type safety with logically different Boolean values votes: 6, answers: 3 Read on SO: [36] http://goo.gl/f1Gtz * Data structure to represent automata votes: 5, answers: 2 Read on SO: [37] http://goo.gl/MhsvC Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/98235 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/19294 3. http://www.reddit.com/r/haskell/comments/tgz57/videos_to_the_functional_programming_course_i/ 4. http://www.reddit.com/r/haskell/comments/tgz57/videos_to_the_functional_programming_course_i/ 5. https://gist.github.com/2659812 6. http://www.reddit.com/r/haskell/comments/ti5il/redblack_trees_in_haskell_using_gadts_existential/ 7. http://research.microsoft.com/en-us/um/people/simonpj/papers/ext-f/icfp12.pdf 8. http://www.reddit.com/r/haskell/comments/tjnzj/equality_proofs_and_deferred_type_errors_a/ 9. http://nvidianews.nvidia.com/Releases/NVIDIA-Contributes-CUDA-Compiler-to-Open-Source-Community-7d0.aspx 10. http://www.reddit.com/r/haskell/comments/tgdia/llvm_now_supports_nvidia_gpus/ 11. http://www.lulu.com/shop/amy-brown-and-greg-wilson/the-architecture-of-open-source-applications-volume-ii/paperback/product-20111008.html#productDetails 12. http://www.reddit.com/r/haskell/comments/teqai/the_architecture_of_open_source_applications/ 13. http://jnordenberg.blogspot.com/2012/05/my-take-on-haskell-vs-scala.html 14. http://www.reddit.com/r/haskell/comments/tedrh/jespers_blog_my_take_on_haskell_vs_scala/ 15. http://www.haskell.org/communities/05-2012/html/report.html 16. http://www.reddit.com/r/haskell/comments/tivjx/haskell_communities_and_activities_report_may_2012/ 17. http://www.yesodweb.com/blog/2012/05/keter-app-deployment 18. http://www.reddit.com/r/haskell/comments/thygx/keter_web_app_deployment/ 19. http://www.reddit.com/r/haskell/comments/ta5lx/a_small_and_simple_tip_for_google_code_jammers/ 20. http://www.reddit.com/r/haskell/comments/ta5lx/a_small_and_simple_tip_for_google_code_jammers/ 21. http://twdkz.wordpress.com/2012/05/10/composable-value-editors/ 22. http://www.reddit.com/r/haskell/comments/tg58a/composable_value_editors_for_gtk/ 23. http://www.reddit.com/r/haskell/comments/tdmt5/the_brittleness_of_type_hierarchies_codegruntcouk/ 24. http://www.reddit.com/r/haskell/comments/tdmt5/the_brittleness_of_type_hierarchies_codegruntcouk/ 25. http://stackoverflow.com/questions/10534744/static-types-polymorphism-and-specialization 26. http://stackoverflow.com/questions/10500320/redoing-the-standard-classes 27. http://stackoverflow.com/questions/10560124/using-cont-to-acquire-values-from-the-future-and-the-past 28. http://stackoverflow.com/questions/10476883/why-is-4-3-equivalent-to-4-3 29. http://stackoverflow.com/questions/10529360/recursively-defined-instances-and-constraints 30. http://stackoverflow.com/questions/10513007/freeing-memory-allocated-with-newcstring 31. http://stackoverflow.com/questions/10556631/what-is-the-meaning-of-quasi-in-quasiquotations 32. http://stackoverflow.com/questions/10518049/ensuring-files-are-closed-promptly 33. http://stackoverflow.com/questions/10529284/is-there-ever-a-good-reason-to-use-unsafeperformio 34. http://stackoverflow.com/questions/10548170/what-characters-are-permitted-for-haskell-operators 35. http://stackoverflow.com/questions/10536990/defining-an-algebra-module-using-constructive-algebra-package 36. http://stackoverflow.com/questions/10544984/haskell-type-safety-with-logically-different-boolean-values 37. http://stackoverflow.com/questions/10516603/data-structure-to-represent-automata </pre> Daniel Santa Cruz 2012-05-17T01:11:07 http://comments.gmane.org/gmane.comp.lang.haskell.general/19302 <pre> CALL FOR TALK PROPOSALS HOPE 2012 The 1st ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 9, 2012 Copenhagen, Denmark (the day before ICFP 2012) http://hope2012.mpi-sws.org HOPE is a *new workshop* that is intended to bring together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. This 1st edition of HOPE is dedicated to John Reynolds, whose work is an inspiration to us all. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2012&lt; at &gt;mpi-sws.org. Deadline for talk proposals: June 8, 2012 (Friday) Notification of acceptance: July 1, 2012 (Sunday) Workshop: September 9, 2012 (Sunday) The submission website is now open: http://www.easychair.org/conferences/?conf=hope2012 --------------------- Workshop Organization --------------------- Program Co-Chairs: Amal Ahmed (Northeastern University) Derek Dreyer (MPI-SWS, Germany) Program Committee: Jim Laird (University of Bath) Rasmus Møgelberg (IT University of Copenhagen) Greg Morrisett (Harvard University) Aleks Nanevski (IMDEA Software Institute) David Naumann (Stevens Institute of Technology) Matthew Parkinson (Microsoft Research Cambridge) François Pottier (INRIA Rocquencourt) Amr Sabry (Indiana University) Eijiro Sumii (Tohoku University) Nikhil Swamy (Microsoft Research Redmond) Nobuko Yoshida (Imperial College London)_______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Amal Ahmed 2012-05-16T19:05:13 http://comments.gmane.org/gmane.comp.lang.haskell.general/19301 <pre>For any Australian Haskellers (or indeed anyone that feels willing to come from wherever you may hail) who have _not_ yet received an email, seen it on Reddit or Google+ but is interested in attending AusHac 2012, we are currently trying to determine which weekend in July best suits everyone. So if you're interested in coming, please fill out the form at http://tinyurl.com/AusHac2012PreferredDates This year we're going to hold AusHac in central Sydney (thanks to Atlassian putting their offices at our disposal!) rather than UNSW, which should make transport and accommodation easier for people. AusHac is open to anyone interested in Haskell, from a complete newbie to one of the Simons. We don't have any specific themes or projects to work on; instead just come along and hack on whatever takes your fancy. </pre> Ivan Lazar Miljenovic 2012-05-16T01:33:44 http://comments.gmane.org/gmane.comp.lang.haskell.general/19300 <pre>===================================================================== Call for papers 14th International Symposium on Principles and Practice of Declarative Programming PPDP 2012 Special Issue of Science of Computer Programming (SCP) Leuven, Belgium, September 18-20, 2012 (co-located with LOPSTR 2012) ====================================================================== PPDP 2012 is a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, and knowledge representation languages. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analysing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, verification and static analysis. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. Topics of interest include, but are not limited to: *Functional programming *Logic programming *Answer-set programming *Functional-logic programming *Declarative visual languages *Constraint Handling Rules *Parallel implementation and concurrency *Monads, type classes and dependent type systems *Declarative domain-specific languages *Termination, resource analysis and the verification of declarative programs *Transformation and partial evaluation of declarative languages *Language extensions for security and tabulation *Probabilistic modelling in a declarative language and modelling reactivity *Memory management and the implementation of declarative systems *Practical experiences and industrial application This year the conference will be co-located with the 22nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2012) and held in cooperation with ACM SIGPLAN. The conference will be held in Leuven, Belgium. Previous symposia were held at Odense (Denmark), Hagenberg (Austria), Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa (Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence (Italy), Montreal (Canada), and Paris (France). Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Proceedings will be published by ACM Press* After the symposium, a selection of the best papers will be invited to extend their submissions in the light of the feedback solicited at the symposium. The papers are expected to include at least 25% extra material over and above the PPDP version. Then, after another round of reviewing, these revised papers will be published in a special issue of SCP with a target publication date by Elsevier of 2013. Important Dates: Abstract Submission: May 28, 2012 Paper submission: May 31, 2012 Notification: July 6, 2012 Camera-ready: July 18, 2012 Symposium: September 19-21, 2012 Invites for SCP: September 26, 2012 Submission of SCP: December 12, 2012 Notification from SCP: February 7, 2013 Camera-ready for SCP: March 7, 2013 Authors should submit an electronic copy of the paper (written in English) in PDF. Each submission must include on its first page the paper title; authors and their affiliations; abstract; and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. Papers should consist of no more than 12 pages, formatted following the ACM SIG proceedings template (option 1). The 12 page limit must include references but excludes well-marked appendices not intended for publication. Referees are not required to read the appendices, and thus papers should be intelligible without them. Invited speakers: Torsten Schaub, University of Potsdam, Germany Juergen Giesl, RWTH Aachen, Germany (shared with LOPSTR) Program Committee: Slim Abdennadher German University in Cairo, Egypt Puri ArenasComplutense University of Madrid, Spain Marcello BalducciniKodak Research Labs, USA Amir Ben-AmramTel-Aviv Academic College, Israel Philip CoxDalhousie University, Canada Marina De VosUniversity of Bath, UK Martin ErwigOregon State University, USA Martin GebserUniversity of Potsdam, Germany Jacob HoweCity University London, UK Joxan Jaffar National University of Singapore, Singapore Gabriele Keller University of New South Wales, Australia Andy KingUniversity of Kent, UK Julia Lawall INRIA Paris, France Rita Loogen Philipps-Universitat Marburg, Germany Greg MichaelsonHeriot-Watt University, UK Matthew MightUniversity of Utah, USA Henrik NilssonUniversity of Nottingham, UK Catuscia PalamidessiINRIA Saclay and Ecole Polytechnique, France Kostis Sagonas Uppsala University, Sweden and NTUA, Greece Taisuke SatoTokyo Institute of Technology, Japan Peter Schneider-KampUniversity of Southern Denmark, Denmark Tom SchrijversUniversity of Ghent, Belgium Terrance SwiftUniversidade Nova de Lisboa, USA Mirek TruszczynskiUniversity of Kentucky, USA Stephanie Weirich University of Pennsylvania, USA Program Chair: Andy King School of Computing, University of Kent Canterbury, CT2 7NF, UK General Co-Chairs: Daniel De Schreye and Gerda Janssens Department of Computer Science K.U.Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium * Confirmation pending </pre> Jon Sneyers 2012-05-14T11:21:47 http://comments.gmane.org/gmane.comp.lang.haskell.general/19299 <pre> ============================================================ Call for papers 22nd International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2012 http://costa.ls.fi.upm.es/lopstr12 Leuven, Belgium, September 18-20, 2012 (co-located with PPDP 2012) ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 22nd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2012) will be held in Leuven, Belgium; previous symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, Manchester and Odense (you might have a look at the contents of past LOPSTR symposia). LOPSTR 2012 will be co-located with PPDP 2012 (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Both full papers and extended abstracts describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: * specification * verification * analysis * specialization * composition * certification * transformational techniques in SE * synthesis * transformation * optimisation * inversion * program/model manipulation * security * applications and tools Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Proceedings The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series. Important Dates Abstract submission: May 21,2012 Paper submission: May 25, 2012 Notification (for pre-proceedings): June 29, 2012 Camera-ready (for pre-proceedings): July 8, 2012 Symposium: September 18-20, 2012 Submissions must be formatted in the Lecture Notes in Computer Science style. They cannot exceed 15 pages including references but excluding well-marked appendices not intended for publication. Referees are not required to read the appendices, and thus papers should be intelligible without them. Full papers can be directly accepted for publication in the formal proceedings to be published by Springer in the LNCS series or accepted only for presentation at the symposium. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Authors should submit an electronic copy of the paper (written in English) in PDF or Postscript (Level 2). Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. If electronic submission is impossible, please contact the program chair for information on how to submit hard copies. Papers should be submitted to the submission website for LOPSTR 2012. Invited speakers: - Tom Schrijvers, University of Ghent, Belgium - Jürgen Giesl, RWTH Aachen, Germany (shared with PPDP) Program Committee: Elvira Albert Complutense University of Madrid, Spain Sergio Antoy Portland State University, US Demis Ballis University of Udine, Italy Henning Christiansen Roskilde University, Denmark Michael Codish Ben-Gurion University of the Negev, Israel Danny De Schreye K.U.Leuven, Belgium Esra Erdem Sabanci University, Istanbul Maribel Fernandez King's College London, UK John Gallagher Roskilde University, Denmark Robert Glück University of Copenhagen, Denmark Miguel Gomez-Zamalloa Complutense University of Madrid, Spain Rémy Haemmerlé Technical University of Madrid, Spain Reiner Hähnle TU Darmstadt, Germany Geoff Hamilton Dublin City University, Ireland Carsten Fuhs University College London, UK Gerda Janssens K.U.Leuven, Belgium Isabella Mastroeni University of Verona, Italy Kazutaka MatsudaUniversity of Tokyo, Japan Paulo Moura Universidade da Beira Interior, Portugal Johan Nordlander Luleå University of Technology, Sweden Andrey Rybalchenko Technische Universität München, Germany Kostis Sagonas Uppsala University, Sweden Francesca Scozzari Università "G. D'Annunzio" di Chieti, Italy Valerio Senni Universtà di Roma "Tor Vergata", Italy German Vidal Technical University of Valencia, Spain Program Chair: Elvira Albert Department of Computer Science (DSIC) Complutense University of Madrid Madrid, Spain General Co-Chairs Daniel De Schreye and Gerda Janssens Department of Computer Science K.U.Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Jon Sneyers 2012-05-14T11:21:27 http://comments.gmane.org/gmane.comp.lang.haskell.general/19297 <pre>Hi, The release timetable http://trac.haskell.org/haskell-platform/wiki/ReleaseTimetable says there will be a new release of the Haskell Platform in May. Can someone give an update on this? Many thanks, Dominic. </pre> Dominic Steinitz 2012-05-13T18:02:11 http://comments.gmane.org/gmane.comp.lang.haskell.general/19296 <pre>[apologies for any cross-posting] ........................................................................ 4th OPEN Answer Set Programming Competition 2013 Call for Benchmark Problems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ ........................................................................ The 4th Open Answer Set Programming Competition is open to ASP systems and *any other system* based on a declarative specification paradigm. The event is currently open and in the Call for Benchmarks stage. == Call for Benchmark Problems == Participants will compete on a selected collection of declarative specifications of benchmark problems, taken from a variety of domains as well as real world applications, and instances thereof. These include, but are not limited to: - Deductive database tasks on large data-sets - Sequential and Temporal Planning - Classic and Applicative graph problems - Puzzles and Combinatorics - Scheduling, Timetabling, and other resource allocation problems - Combinatorial Optimization Problems - Ontology reasoning - Automated Theorem Proving and Model Checking - Reasoning tasks over large propositional instances - Constraint Programming problems - Other AI problems We encourage to provide help by proposing and/or devising new challenging benchmark problems. The submission of problems arising from applications of practical impact are strongly encouraged; problems used in the former ASP Competitions, or variants thereof, can be re-submitted. Benchmark authors are expected to produce a problem specification and an instance set (or a generator thereof). The detailed benchmark problems submission procedure is available at: http://www.mat.unical.it/aspcomp2013/BenchmarkSubmission === About the ASP Competition Series === Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modelling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. Since the first informal editions (Dagstuhl 2002 and 2005), ASP systems compare themselves in the nowadays customary ASP Competition: the 4th ASP Competition will be run jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria), in the first half of 2013. The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. The ASP competition is held as an open tournament. The "Model &amp; Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. == Important Dates == * Problem selection stage Problem submission deadline: Aug 31th, 2012 * Competition stage "Model &amp; Solve" submission deadline: Mar 1st, 2013 "System" submission deadline: Mar 1st, 2013 * Sep 15-19th, 2013 Announcement of results and awards at LPNMR 2013 - Corunna, Spain For further information please visit the competition web site http://aspcomp2013.mat.unical.it/ or contact us by email: aspcomp2013&lt; at &gt;kr.tuwien.ac.at. </pre> Francesco Calimeri 2012-05-12T13:33:10 http://comments.gmane.org/gmane.comp.lang.haskell.general/19294 <pre>On behalf of all the contributors, I am pleased to announce that the Haskell Communities and Activities Report (22nd edition, May 2012) is now available in PDF and HTML formats: http://haskell.org/communities/05-2012/report.pdf http://haskell.org/communities/05-2012/html/report.html Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. I hope you will find it as interesting a read as I did. If you have not encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects, and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summaries of your own area of work. Many of you respond (eagerly, unprompted, and sometimes in time for the actual deadline to the call. The editor collects all the contributions into a single report and feeds that back to the community. When I try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ========================================= End of October 2012: target deadline for contributions to the November 2012 edition of the HC&amp;A Report ========================================= Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to "register" with the editor for a simple e-mail reminder in October (you could point me to them as well, and I can then politely ask if they want to contribute, but it might work better if you do the initial asking). Of course, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Feel free to circulate this announcement further in order to reach people who might otherwise not see it. Enjoy! Janis Voigtlaender &lt;hcar at haskell.org&gt; </pre> Janis Voigtländer 2012-05-11T22:45:35 http://comments.gmane.org/gmane.comp.lang.haskell.general/19293 <pre>Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.13.3! * 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 This release attempts to fix a bunch of long-standing (and a few new) bugs, while still avoiding a new major version bump. Changelog: 1.13.2 --&gt; 1.13.3 =============== * Fundep premises are now allowed to be empty. * Fix the bug where the lexer would crash on a LINE pragma that did not include a line number. * Fix the bug where the lexer would require the # of a MagicHash-style type constructor to be succeeded by at least one character in the file. * Fix really long-standing bug where the parser would crash with an ugly "Internal error" error message if encountering an extra }. * Report errors at the right place for function arity mismatches. Earlier they were reported at end of file, now they are reported where the function is declared. * Lexer now properly fails on line-breaks in string literals. * Lexer now handles character escapes up to 0x10FFFF (unicode). Cheers, /Niklas _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Niklas Broberg 2012-05-10T19:21:18 http://comments.gmane.org/gmane.comp.lang.haskell.general/19292 <pre> Again we will teach an "Applied Functional Programming Summer in Haskell" school this year at Utrecht University. In the previous two occasions students were all very happy with the school and we plan to repeat this success this year. The intended audience are prospective master students who have been in contact with Functional Programming, e.g. by taking a general course on programming languages, and want to learn more about Haskell and its typical programming patterns. In the previous two years we have taught an introductory part (advanced bachelor level), an advanced part (beginning master level) and a shared part for both groups. Topics covered are, besides some examples of domain specific languages, also monads, monad transformers, arrows, parser combinators and self-analysing programs, underlying principles, type inferencing, etc. Half of the course time is spent on a larger programming exercise; you can also come with a problem of your own if you want, and get help from the Utrecht University Software Technology group in finding the proper Haskell idioms, tools and libraries, for solving it. Important links: -- our own page where we supply information based on questions asked http://www.cs.uu.nl/wiki/bin/view/USCS2012/WebHome -- the poster you can print and hang somewhere (why not your office door): http://www.cs.uu.nl/wiki/pub/USCS2012/WebHome/USCSpos12.pdf -- the official summerschool site where you can register: http://www.utrechtsummerschool.nl/index.php?type=courses&amp;code=H9 Furthermore we ask for your cooperation to bring this announcement under the attention of potential participants. Best, Doaitse Swierstra PS: apologies if you get this mail more than once _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> S D Swierstra 2012-05-10T15:31:04 http://comments.gmane.org/gmane.comp.lang.haskell.general/19289 <pre>======================================================================== CALL FOR PAPERS FHPC 2012 ACM SIGPLAN Workshop on Functional High Performance Computing Copenhagen, Denmark September 15th, 2012 http://www.hiperfit.dk/fhpc12/ Co-located with the International Conference on Functional Programming (ICFP 2012) ======================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative or high-level) programming technology in application domains where large-scale computations arise naturally and high performance is essential. Such computations would typically -- but not necessarily -- involve execution on highly parallel systems ranging from multi-core multi-processor systems to graphics accelerators (GPGPUs), reconfigurable hardware (FPGAs), large-scale compute clusters or any combination thereof. It is becoming apparent that radically new and well founded methodologies for programming such systems are required to address their inherent complexity and to reconcile execution performance with programming productivity. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as highly transparent, maintainable, and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. The 2012 FHPC workshop comes with a particular theme motivated by geographic co-location with the newly established HIPERFIT Research Centre for Functional High-Performance Computing for Financial Information Technology (www.hiperfit.dk) at the University of Copenhagen. Hence, we particularly encourage submissions with a background in computational finance. Notwithstanding, the workshop welcomes submissions from other application domains as much as general-purpose work on the theory and practice of declarative approaches to high-performance computing. Proceedings: ============ Accepted papers will be published by the ACM and will appear in the ACM Digital Library. * Submission Deadline: 6th June 2012, anywhere on earth * Author Notification: 27th June 2012 * Final Papers Due : 10th July 2012 Submitted papers must be in portable document format (PDF), formatted according to the ACM SIGPLAN style guidelines (double column, 9pt format). See http://www.sigplan.org/authorInformation.htm for more information and style files. The page limit is 12 pages. Any paper submitted must adhere to ACM SIGPLAN's republication policy. Submission deadlines and page limit are firm. Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page (http://www.sigplan.org/PAC.htm). Workshop Organizers: ==================== Andrzej Filinski Clemens Grelck DIKU Informatics Institute University of Copenhagen University of Amsterdam Universitetsparken 1 Science Park 904 2100 Copenhagen 1098XH Amsterdam Denmark Netherlands andrzej&lt; at &gt;diku.dk c.grelck&lt; at &gt;uva.nl Tentative Programme Committee: ============================== Marco Aldinucci University of Torino, Italy Manuel Chakravarty University of New South Wales, Australia Andrzej Filinski University of Copenhagen, Denmark (chair) Clemens Grelck University of Amsterdam, Netherlands (chair) Gaetan Hains University of Paris Est, France Zhenjiang Hu National Institute of Informatics, Japan Mike Giles Oxford University, UK Neal Glew Intel Inc., USA Ryan Newton University of Indiana, USA Satnam Singh Microsoft Research/University of Birmingham, UK Phil Trinder Heriot-Watt Unversity, UK Viktoria Zsok Eotvos Lorand University Budapest, Hungary Workshop Organizers: ==================== Andrzej Filinski Clemens Grelck DIKU Informatics Institute University of Copenhagen University of Amsterdam Universitetsparken 1 Science Park 904 2100 Copenhagen 1098XH Amsterdam Denmark Netherlands andrzej&lt; at &gt;diku.dk c.grelck&lt; at &gt;uva.nl h </pre> Clemens Grelck 2012-05-10T03:59:51 http://comments.gmane.org/gmane.comp.lang.haskell.general/19288 <pre>Welcome to issue 226 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of April 29 to May 5, 2012. Quotes of the Week * acowley: I write the most complicated bottoms * Cale: OpenGL is the Rubik's Cube of graphics libraries. It's nearly impossible to change some things without affecting other things Top Reddit Stories * HJ — Haskell-to-JavaScript compiler (WIP) Domain: chrisdone.com, Score: 74, Comments: 23 On Reddit: [1] http://goo.gl/gP51N Original: [2] http://goo.gl/g32rz * Life Without Objects Domain: skipoleschris.blogspot.co.uk, Score: 52, Comments: 17 On Reddit: [3] http://goo.gl/LZmLC Original: [4] http://goo.gl/NLhKH * New major release of the containers package Domain: blog.johantibell.com, Score: 52, Comments: 25 On Reddit: [5] http://goo.gl/yjblJ Original: [6] http://goo.gl/DKlmd * Haskell and the World: Encodings and the Common Misuse of ByteString Domain: a-dimit.blogspot.com, Score: 50, Comments: 27 On Reddit: [7] http://goo.gl/WloCn Original: [8] http://goo.gl/oeIIW * How to write hybrid CPU/GPU programs with Haskell Domain: parfunk.blogspot.com.au, Score: 48, Comments: 3 On Reddit: [9] http://goo.gl/u9A9l Original: [10] http://goo.gl/s917R * phantom tainting with kind error messages Domain: article.gmane.org, Score: 35, Comments: 5 On Reddit: [11] http://goo.gl/V9qRd Original: [12] http://goo.gl/cx4cD * Annotated slides: Comparing Dynamic and Static Language Approaches to Web Frameworks (Rails vs Yesod) Domain: cs.kent.ac.uk, Score: 32, Comments: 11 On Reddit: [13] http://goo.gl/jE2iK Original: [14] http://goo.gl/2dIjQ * SPJ talk: Towards Haskell in the Cloud Domain: skillsmatter.com, Score: 30, Comments: 16 On Reddit: [15] http://goo.gl/fVc0e Original: [16] http://goo.gl/NMtPD * hotswap -- a simple, high level interface to plugins for hotswapping code Domain: hackage.haskell.org, Score: 29, Comments: 8 On Reddit: [17] http://goo.gl/kvhOS Original: [18] http://goo.gl/VMAe0 * Online Haskell typechecker Domain: haskellonline.org, Score: 29, Comments: 12 On Reddit: [19] http://goo.gl/uV3HY Original: [20] http://goo.gl/lSwhb Top StackOverflow Questions * Algebraically interpreting polymorphism votes: 21, answers: 5 Read on SO: [21] http://goo.gl/7krnc * Absolute value of negative zero - bug, or a part of the floating point standard? votes: 16, answers: 3 Read on SO: [22] http://goo.gl/HDpRc * how to implement doubly linked lists votes: 10, answers: 1 Read on SO: [23] http://goo.gl/hXyDM * GHC type inference for higher rank types - assigning to monotypes votes: 10, answers: 1 Read on SO: [24] http://goo.gl/TqYtX * Communication between Java and Haskell votes: 9, answers: 3 Read on SO: [25] http://goo.gl/zMYwx * Default constraint kinds are ignored votes: 9, answers: 2 Read on SO: [26] http://goo.gl/AElL4 * Scrap Your Boilerplate equivalent in Scala? votes: 7, answers: 1 Read on SO: [27] http://goo.gl/Cd7k4 * Does the chain function in underscore.js create a monad? votes: 7, answers: 1 Read on SO: [28] http://goo.gl/DUYkB * Why do Haskell list comprehensions with multiple generators treat the rightmost generator as the tightest loop? votes: 6, answers: 3 Read on SO: [29] http://goo.gl/BnndW * Haskell records, cleaner approach? votes: 6, answers: 1 Read on SO: [30] http://goo.gl/MymyL Until next time, Daniel Santa Cruz References 1. http://chrisdone.com/hj/ 2. http://www.reddit.com/r/haskell/comments/t06ej/hj_haskelltojavascript_compiler_wip/ 3. http://skipoleschris.blogspot.co.uk/2012/04/life-without-objects.html 4. http://www.reddit.com/r/haskell/comments/t1oen/life_without_objects/ 5. http://blog.johantibell.com/2012/05/new-major-release-of-containers-package.html 6. http://www.reddit.com/r/haskell/comments/t688l/new_major_release_of_the_containers_package/ 7. http://a-dimit.blogspot.com/2012/04/strings-in-haskell.html 8. http://www.reddit.com/r/haskell/comments/syo8h/haskell_and_the_world_encodings_and_the_common/ 9. http://parfunk.blogspot.com.au/2012/05/how-to-write-hybrid-cpugpu-programs.html 10. http://www.reddit.com/r/haskell/comments/t7znh/how_to_write_hybrid_cpugpu_programs_with_haskell/ 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/98103 12. http://www.reddit.com/r/haskell/comments/t6dn7/phantom_tainting_with_kind_error_messages/ 13. http://www.cs.kent.ac.uk/~nccb/rails-yesod-slides.pdf 14. http://www.reddit.com/r/haskell/comments/t1aw8/annotated_slides_comparing_dynamic_and_static/ 15. http://skillsmatter.com/podcast/home/haskell-cloud/js-4179 16. http://www.reddit.com/r/haskell/comments/t0qg0/spj_talk_towards_haskell_in_the_cloud/ 17. http://hackage.haskell.org/package/hotswap-0.1.9.3 18. http://www.reddit.com/r/haskell/comments/t24lr/hotswap_a_simple_high_level_interface_to_plugins/ 19. http://haskellonline.org/ 20. http://www.reddit.com/r/haskell/comments/t41bk/online_haskell_typechecker/ 21. http://stackoverflow.com/questions/10453558/algebraically-interpreting-polymorphism 22. http://stackoverflow.com/questions/10395761/absolute-value-of-negative-zero-bug-or-a-part-of-the-floating-point-standard 23. http://stackoverflow.com/questions/10386616/how-to-implement-doubly-linked-lists 24. http://stackoverflow.com/questions/10424375/ghc-type-inference-for-higher-rank-types-assigning-to-monotypes 25. http://stackoverflow.com/questions/10370177/communication-between-java-and-haskell 26. http://stackoverflow.com/questions/10381278/default-constraint-kinds-are-ignored 27. http://stackoverflow.com/questions/10423329/scrap-your-boilerplate-equivalent-in-scala 28. http://stackoverflow.com/questions/10431999/does-the-chain-function-in-underscore-js-create-a-monad 29. http://stackoverflow.com/questions/10399577/why-do-haskell-list-comprehensions-with-multiple-generators-treat-the-rightmost 30. http://stackoverflow.com/questions/10427217/haskell-records-cleaner-approach _______________________________________________ Haskell mailing list Haskell&lt; at &gt;haskell.org http://www.haskell.org/mailman/listinfo/haskell </pre> Daniel Santa Cruz 2012-05-09T22:39:44 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.haskell.general