- Haskell - Haskell.org

CFP: PPDP 2012 in Leuven, Belgium
by Jon Sneyers 27 Jan '12

27 Jan '12

===================================================================== Call for papers 14th International ACM SIGPLAN 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. Program Committee: Slim Abdennadher German University in Cairo, Egypt Puri Arenas Complutense University of Madrid, Spain Marcello Balduccini Kodak Research Labs, USA Amir Ben-Amram Tel-Aviv Academic College, Israel Philip Cox Dalhousie University, Canada Marina De Vos University of Bath, UK Martin Erwig Oregon State University, USA Martin Gebser University of Potsdam, Germany Jacob Howe City University London, UK Joxan Jaffar National University of Singapore, Singapore Gabriele Keller University of New South Wales, Australia Andy King University of Kent, UK Julia Lawall INRIA Paris, France Rita Loogen Philipps-Universitat Marburg, Germany Greg Michaelson Heriot-Watt University, UK Matthew Might University of Utah, USA Henrik Nilsson University of Nottingham, UK Catuscia Palamidessi INRIA Saclay and Ecole Polytechnique, France Kostis Sagonas Uppsala University, Sweden and NTUA, Greece Taisuke Sato Tokyo Institute of Technology, Japan Peter Schneider-Kamp University of Southern Denmark, Denmark Tom Schrijvers University of Ghent, Belgium Terrance Swift Universidade Nova de Lisboa, USA Mirek Truszczynski University 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

1 0

CFP: LOPSTR 212 in Leuven, Belgium
by Jon Sneyers 27 Jan '12

27 Jan '12

============================================================ 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. 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 Miguel Gomez-Zamalloa Complutense University of Madrid, Spain Robert Glück University of Copenhagen, Denmark Rémy Haemmerlé Technical University of Madrid, Spain Reiner Hähnle TU Darmstadt, Germany Geoff Hamilton Dublin City University, Ireland Carsten Fuhs RWTH Aachen, Germany Gerda Janssens K.U.Leuven, Belgium Isabella Mastroeni University of Verona, Italy Paulo Moura Universidade da Beira Interior, Portugal Kazutaka Matsuda Tohoku University, Japan 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 * Confirmation pending

1 0

Call for Papers - Haskell Symposium 2012
by Janis Voigtländer 27 Jan '12

27 Jan '12

======================================================================== "Haskell 2012" ACM SIGPLAN Haskell Symposium 2012 Copenhagen, Denmark 13th September, 2012 CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2012/ ======================================================================== The ACM SIGPLAN Haskell Symposium 2012 will be co-located with the 2012 International Conference on Functional Programming (ICFP), in Copenhagen, Denmark. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, testing tools, and suchlike; * Applications, using Haskell for scientific and symbolic computing, database, multimedia, telecom and web applications, and so forth; * Functional Pearls, being elegant, instructive examples of using Haskell; * Experience Reports, general practice and experience with Haskell, e.g., in an education or industry context. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (Links with more advice appear on the symposium web page.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Regular papers should explain their research contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and relating it to previous work (also for other languages where appropriate). In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Such short demo proposals should explain why a demonstration would be of interest to the Haskell community. 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) Proceedings: ============ There will be formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (http://www.acm.org/publications/policies/copyright_policy) Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Accepted demo proposals, assessed for relevance by the PC, will be published on the symposium web page, but not formally published in the proceedings. Submission Details: =================== * Abstract Submission: 31st May 2012 * Submission Deadline: 3rd June 2012, 11:00 am, UTC * Author Notification: 27th June 2012 * Final Papers Due : 10th July 2012 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (9pt format, more details appear on the symposium web page). The length is restricted to 12 pages, except for "Experience Report" papers, which are restricted to 6 pages. Each paper submission must adhere to SIGPLAN's republication policy, as explained on the web. Demo proposals are limited to 2-page abstracts, in the same format. "Functional Pearls", "Experience Reports", and "Demo Proposals" should be marked as such with those words in the title at time of submission. The paper submission deadline and length limitations are firm. There will be no extensions, and papers violating the length limitations will be summarily rejected. Programme Committee: ==================== * Amal Ahmed, Northeastern University * Jost Berthold, University of Copenhagen * Nils Anders Danielsson, University of Gothenburg * Iavor Diatchki, Galois Inc. * Jeremy Gibbons, University of Oxford * Jurriaan Hage, Utrecht University * Zhenjiang Hu, National Institute of Informatics Tokyo * Daan Leijen, Microsoft Research * Ben Lippmeier, University of New South Wales * Simon Peyton Jones, Microsoft Research * Colin Runciman, University of York * Eijiro Sumii, Tohoku University * Janis Voigtländer (chair), University of Bonn * Brent Yorgey, University of Pennsylvania Links: ====== * http://www.haskell.org/haskell-symposium (the permanent web page of the Haskell Symposium) * http://www.haskell.org/haskell-symposium/2012 (the 2012 Haskell Symposium web page) * http://www.icfpconference.org/icfp2012 (the ICFP 2012 web page) -- Jun.-Prof. Dr. Janis Voigtländer http://www.iai.uni-bonn.de/~jv/ mailto:jv@iai.uni-bonn.de

1 0

Haskell Weekly News: Issue 212
by Daniel Santa Cruz 27 Jan '12

27 Jan '12

Welcome to issue 212 of the HWN, a newsletter covering developments in the Haskell community. This issue covers top Haskell stories from around the web found between January 11 to 21, 2012. You can find the HTML version at: http://contemplatecode.blogspot.com/2012/01/haskell-weekly-news-issue-212.h… Quotes of the Week * shachaf: Haskell's type system is the perfect mix of useless and stupid. * roconnor: gez, you write one paper explaining how a lens is really a higher order monoidal natural transformation, and suddenly everyone thinks you are an expert on lenses. * roconnor: a lens is a monoidal natural transformation between higher-order coalgebra functors, what's the problem? * Enigmagic: we use the 'rsync' deploy model * cmccann: someone should implement a dependently-typed unsafeCoerce in Agda, you'd have to provide a proof that the coercion is invalid * ghc: Couldn't match type `No' with `Yes' Top Reddit Stories * Idris - A language with dependent types Domain: idris-lang.org, Score: 43, Comments: 30 On Reddit: [1] http://goo.gl/pZdKX Original: [2] http://goo.gl/MxXKx * Purely Functional, Declarative Game Logic Using Reactive Programming Domain: github.com, Score: 38, Comments: 17 On Reddit: [3] http://goo.gl/ByPJj Original: [4] http://goo.gl/1PYa4 * A guided tour through the bytestring library Domain: meiersi.github.com, Score: 32, Comments: 10 On Reddit: [5] http://goo.gl/0YUQ2 Original: [6] http://goo.gl/A2u2S * Comprehensions Domain: patternsinfp.wordpress.com, Score: 26, Comments: 7 On Reddit: [7] http://goo.gl/9Zv3F Original: [8] http://goo.gl/SNA14 * Thinking of writing a tutorial series on FP and Haskell. Here's a demo. Domain: codingtales.com, Score: 24, Comments: 9 On Reddit: [9] http://goo.gl/eU99Y Original: [10] http://goo.gl/1efUI * UHC compiles Haskell to JavaScript. Web game using Haskell for Ludum Dare? Domain: chrisdone.com, Score: 23, Comments: 4 On Reddit: [11] http://goo.gl/og088 Original: [12] http://goo.gl/8Op3M * Warp Conduits Released! Domain: yesodweb.com, Score: 22, Comments: 3 On Reddit: [13] http://goo.gl/zpHnZ Original: [14] http://goo.gl/5Vl3w * Why are guards in the list comprehension faster than in the do-notation? Domain: self.haskell, Score: 19, Comments: 22 On Reddit: [15] http://goo.gl/1T8Kk Original: [16] http://goo.gl/1T8Kk * Hac Boston Domain: self.haskell, Score: 19, Comments: 7 On Reddit: [17] http://goo.gl/xWWZF Original: [18] http://goo.gl/xWWZF * Easy steps to install gtk and use all its features on OS X lion Domain: gist.github.com, Score: 16, Comments: 10 On Reddit: [19] http://goo.gl/Teh6P Original: [20] http://goo.gl/Su6Y1 Top StackOverflow Questions * What is this haskell syntax? votes: 19, answers: 1 Read on SO: [21] http://goo.gl/JCYg0 * Why is the type of this function (a -> a) -> a? votes: 18, answers: 4 Read on SO: [22] http://goo.gl/BTr8e * `Integer` vs `Int64` vs `Word64` votes: 13, answers: 1 Read on SO: [23] http://goo.gl/Pc2CX * Did I just write a continuation? votes: 12, answers: 1 Read on SO: [24] http://goo.gl/aXnTw * How lazy is Haskell's `++`? votes: 12, answers: 3 Read on SO: [25] http://goo.gl/GxPxC * Can Haskell be used to write shell scripts? votes: 12, answers: 4 Read on SO: [26] http://goo.gl/u3Qke * Why does this Haskell code compile? votes: 12, answers: 2 Read on SO: [27] http://goo.gl/yz6VB * Any nice tools for untying knots in Haskell? votes: 11, answers: 4 Read on SO: [28] http://goo.gl/YGNeq * Two-dimensional zipper votes: 10, answers: 2 Read on SO: [29] http://goo.gl/37E9J * the way merge-sort faster than insertion-sort puzzles me votes: 10, answers: 2 Read on SO: [30] http://goo.gl/mkmdc * Haskell function that takes a type and a value and checks if value has that type votes: 10, answers: 1 Read on SO: [31] http://goo.gl/tJO81 Until next time, Daniel Santa Cruz References 1. http://idris-lang.org/ 2. http://www.reddit.com/r/haskell/comments/ol90m/idris_a_language_with_depend… 3. https://github.com/leonidas/codeblog/blob/master/2012/2012-01-17-declarativ… 4. http://www.reddit.com/r/haskell/comments/ol7vm/purely_functional_declarativ… 5. http://meiersi.github.com/HaskellerZ/meetups/2012%2001%2019%20-%20The%20byt… 6. http://www.reddit.com/r/haskell/comments/oqjhy/a_guided_tour_through_the_by… 7. http://patternsinfp.wordpress.com/2012/01/19/comprehensions/ 8. http://www.reddit.com/r/haskell/comments/on8a6/comprehensions/ 9. http://codingtales.com/2012/01/16/understanding-foldl-using-foldr-from-real… 10. http://www.reddit.com/r/haskell/comments/oi4l2/thinking_of_writing_a_tutori… 11. http://chrisdone.com/posts/2012-01-06-uhc-javascript.html 12. http://www.reddit.com/r/haskell/comments/olthb/uhc_compiles_haskell_to_java… 13. http://www.yesodweb.com/blog/2012/01/warp-conduits 14. http://www.reddit.com/r/haskell/comments/on285/warp_conduits_released/ 15. http://www.reddit.com/r/haskell/comments/oolyt/why_are_guards_in_the_list_c… 16. http://www.reddit.com/r/haskell/comments/oolyt/why_are_guards_in_the_list_c… 17. http://www.reddit.com/r/haskell/comments/opgi1/hac_boston/ 18. http://www.reddit.com/r/haskell/comments/opgi1/hac_boston/ 19. https://gist.github.com/1655271 20. http://www.reddit.com/r/haskell/comments/or0ro/easy_steps_to_install_gtk_an… 21. http://stackoverflow.com/questions/8905178/what-is-this-haskell-syntax 22. http://stackoverflow.com/questions/8918990/why-is-the-type-of-this-function… 23. http://stackoverflow.com/questions/8873000/integer-vs-int64-vs-word64 24. http://stackoverflow.com/questions/8867837/did-i-just-write-a-continuation 25. http://stackoverflow.com/questions/8872714/how-lazy-is-haskells 26. http://stackoverflow.com/questions/8925780/can-haskell-be-used-to-write-she… 27. http://stackoverflow.com/questions/8935568/why-does-this-haskell-code-compi… 28. http://stackoverflow.com/questions/8945096/any-nice-tools-for-untying-knots… 29. http://stackoverflow.com/questions/8905030/two-dimensional-zipper 30. http://stackoverflow.com/questions/8919785/the-way-merge-sort-faster-than-i… 31. http://stackoverflow.com/questions/8957601/haskell-function-that-takes-a-ty…

1 0

Call for Participation - BX'12 (co-located with ETAPS'12)
by Janis Voigtländer 26 Jan '12

26 Jan '12

Please note the deadline for early registration, including discounted hotel bookings: *Sunday 29 January* ======================================================================== CALL FOR PARTICIPATION First International Workshop on Bidirectional Transformations (BX 2012) Tallinn, Estonia Sun, March 25, 2012 (co-located with ETAPS 2012, adjacent to FASE, ESOP, GT-VMT) http://www.program-transformation.org/BX12 http://www.program-transformation.org/BX12/InvitedTalks http://www.program-transformation.org/BX12/AcceptedPapers ======================================================================== Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be databases, software models, documents, graphs, and trees. BX are an emerging topic in a wide range of research areas with prominent presence at top conferences in different fields. This workshop now establishes a dedicated venue for bx in all relevant areas. We have a great programme, join us at ETAPS! REGISTRATION: To register for BX'12, please follow the instructions at: http://www.etaps.org/2012/registration The early registration deadline is January 29, 2012! HOTEL INFORMATION: BX will be co-located with ETAPS. Please visit ETAPS's web site to get more information about accommodation: http://www.etaps.org/2012/accommodation Special rates and/or block bookings for ETAPS 2012 participants at a number of central hotels also expire Sunday, 29 January 2012. INVITED TALKS: * Juan de Lara (Autonomous University of Madrid, Spain): Bidirectional Transformation with Graphical Constraints * Jean-Luc Hainaut (University of Namur, Belgium) CONTRIBUTED TALKS: * Anthony Anjorin, Gergely Varro and Andy Schürr: Complex Attribute Manipulation in TGGs with Constraint-Based Programming Techniques * Jeremy Gibbons and Michael Johnson: Relating Algebraic and Coalgebraic Descriptions of Lenses * Hugo Pacheco, Alcino Cunha and Zhenjiang Hu: Delta Lenses over Inductive Types * Vadim Zaytsev: Language Evolution, Metasyntactically * Michael Johnson and Robert Rosebrugh: Lens put-put laws: Monotonic and mixed * Leen Lambers, Stephan Hildebrandt, Holger Giese and Fernando Orejas: Attribute Handling for Bidirectional Model Transformations: The Triple Graph Grammar Case * Erwann Wernli: Bidirectional transformations meets dynamic updates: promise & perils * Perdita Stevens: Observations relating to the equivalences induced on model sets by bidirectional transformations -- Jun.-Prof. Dr. Janis Voigtländer http://www.iai.uni-bonn.de/~jv/ mailto:jv@iai.uni-bonn.de

1 0

MSFP 2012 call for participation
by James Chapman 26 Jan '12

26 Jan '12

Please note the deadline for early registration, including discounted hotel bookings: *Sunday 29 January* =========================== Fourth Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 25 March, Tallinn, Estonia A satellite workshop of ETAPS 2012 http://cs.ioc.ee/msfp/msfp2012/ The fourth workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Where would Haskell be without monads? Functional reactive programming without arrows? Call-by-push-value without adjunctions? Type theory without universes? The list goes on. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006, affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP workshop was held in Baltimore, USA, as part of ICFP 2010. Invited Talks: ================= Dependently typed continuation monads as models in Logic Danko Ilik, Goce Delčev University of Štip, Republic of Macedonia Fibred Data Types Neil Ghani, University of Strathclyde, UK Accepted Papers ================== • A Formal Comparison of Approaches to Datatype-Generic Programming José Pedro Magalhães and Andres Löh • An Investigation of the Laws of Traversals Mauro Jaskelioff and Ondrej Rypacek • Evaluation strategies for monadic computations Tomas Petricek • From Mathematics to Abstract Machine: A formal derivation of an executable Krivine machine Wouter Swierstra • Irrelevance, Heterogenous Equality, and Call-by-value Dependent Type Systems Vilhelm Sjöberg, Chris Casinghino, Ki Yung Ahn, Nathan Collins, Harley D. Eades III, Peng Fu, Garrin Kimmell, Tim Sheard, Aaron Stump and Stephanie Weirich • Parametric Compositional Data Types Tom Hvitved and Patrick Bahr • Step-Indexed Normalization for a Language with General Recursion Chris Casinghino, Vilhelm Sjöberg and Stephanie Weirich • Tracing monadic computations and representing effects Maciej Piróg and Jeremy Gibbons ETAPS: ====== European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of six main annual conferences (one of them, POST, being new in 2012), accompanied by satellite workshops. ETAPS 2012 is the fifteenth event in the series. http://www.etaps.org/2012 Host City: ========== Tallinn, a city of 412,000 people, is the capital and largest city of Estonia, a small EU member country in Northern Europe, bordering Russia to the East and Latvia to the south. Located in the north of the country, on the southern shores of the Gulf of Finland, opposite Helsinki in Finland, Tallinn is most well known for its picturesque medieval Old Town, a UNESCO World Heritage site. But it also has a vivid cultural scene, outperforming most European centres of similar size. In 2011, Tallinn, along with Turku in Finland, is the Cultural Capital of Europe. Tallinn is easy to travel to. Estonia is part of Schengen and the Eurozone. The Lennart Meri International Airport of Tallinn /TLL) is only 4km from the city centre. Programme Committee: ==================== * James Chapman (co-chair), Institute of Cybernetics, Tallinn, Estonia * Paul Blain Levy (co-chair), University of Birmingham, UK * Thorsten Altenkirch, University of Nottingham, UK * Robert Atkey, University of Strathclyde, Glasgow, UK * Nils Anders Danielsson, Chalmers University and University of Gothenburg, Sweden * Martin Escardo, University of Birmingham, UK * Ichiro Hasuo, University of Tokyo, Japan * Ralf Hinze, University of Oxford, UK * Neelakantan Krishnaswami, Microsoft Research, Cambridge, UK * Daniel R. Licata, Carnegie Mellon University, Pittsburgh, PA * Ulrich Schoepp, LMU Munich, Germany * Alex Simpson, University of Edinburgh, UK * Matthieu Sozeau, INRIA, Paris, France * Sam Staton, University of Cambridge, UK Further Information: ==================== For more information about the workshop, go to: http://cs.ioc.ee/msfp/msfp2012/ With any other questions please do not hesitate to contact the co-chairs at msfp2012(a)easychair.org.

1 0

VSTTE 2012: Final Call for Participation
by Gudmund Grov 19 Jan '12

19 Jan '12

***************************************************************** *** Final Call for Participation *** VSTTE 2012 Verified Software: Theories, Tools and Experiments January 28-29, 2012 Philadelphia, USA (co-located with POPL and VMCAI) https://sites.google.com/site/vstte2012/ ****************************************************************** The Fourth International Conference on Verified Software: Theories, Tools, and Experiments will take place on January 28-29, 2012. The focus of the conference is the development of systematic methods for specifying, building, and verifying software. The goal of this conference is to advance the state of the art through the interaction of theory development, tool evolution, and experimental validation. Historically, the conference came out of the Verified Software Initiative (VSI), a cooperative, international initiative directed at the scientific challenges of large-scale software verification. An informal verification competition has been held and the winner will be announced during the conference. KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research PROGRAM The full program is available at the conference web site: https://sites.google.com/site/vstte2012/program VENUE The conference is co-located with POPL and will be held at the Sheraton Society Hill Hotel in Philadelphia's historic district. For hotel rate details and booking please see the POPL webpage: http://www.cse.psu.edu/popl/12/ REGISTRATION Registration is handled by the POPL registration. For rates, please see http://www.cse.psu.edu/popl/12/ and for registration please follow this link: https://regmaster3.com/2012conf/POPL12/register.php Please note the very low registration fee for students! SPONSORS NSF Microsoft Research -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

Haskell Weekly News: Issue 211
by Daniel Santa Cruz 19 Jan '12

19 Jan '12

Welcome to issue 211 of the HWN, a newsletter covering developments in the Haskell community. This release covers top stories found around the net between January 01 to 14, 2012. This is going to be a shorted version, as I have been out of time. I did not want to let more time go by without a heartbeat from your friendly HWN. Happy coding! You can find an HTML version at: http://contemplatecode.blogspot.com/2012/01/haskell-weekly-news-issue-211.h… Quotes of the Week * <ddarius> xtalmath: #math or #not-math would probably be a more appropriate place to ask. <shachaf> ddarius: Those two channels pretty much cover it all. <ddarius> shachaf: You're clearly not an intuitionist. * monochrom: in fact, freedom is the freedom to write 2.2 = 4 * Jafet: caleskell is the standard golf course. * byorgey: Escaped skolem! Authorities mount massive search. News at 11. * BMeph: loves swapping function arguments, he said flippantly * kmc: "Haskell is great, because Curry-Howard! Proving things in the type system. We can prove that, uh, Ints exist, unless they're [bottom]." * Jafet: In Soviet Russia, State executes you * byorgey: that would be known as "low-dimensional linear algebra", where "low-dimensional" is said in as condescending a tone as possible * monochrom: at a crossroad you meet an angel (always tells the truth) or demon (always lies). the crossroad gives you two choices of roads, one to heaven, one to hell, and only the angel or demon knows which is which. if you ask "how would you answer if I asked 'what is a monad?'", what will happen? Top Reddit Stories * Dropbox tech blog » Using the Dropbox API from Haskell Domain: tech.dropbox.com, Score: 68, Comments: 4 On Reddit: [1] http://goo.gl/rsndV Original: [2] http://goo.gl/g3RyF * A new approach to iteratees Domain: self.haskell, Score: 48, Comments: 99 On Reddit: [3] http://goo.gl/ZRbGW Original: [4] http://goo.gl/ZRbGW * Haskell / Repa Real-Time Ray Tracing Demo Domain: youtube.com, Score: 45, Comments: 7 On Reddit: [5] http://goo.gl/rzyZs Original: [6] http://goo.gl/15P2V * Order theory for computer scientists Domain: matt.might.net, Score: 39, Comments: 1 On Reddit: [7] http://goo.gl/nTOfr Original: [8] http://goo.gl/HAVjQ * Generalizing Streams into Coroutines (with an introduction to functors, applicative functors and arrows) Domain: github.com, Score: 38, Comments: 15 On Reddit: [9] http://goo.gl/hUopY Original: [10] http://goo.gl/avTUf * Well-Typed are hiring: Haskell consultant Domain: well-typed.com, Score: 38, Comments: 71 On Reddit: [11] http://goo.gl/Chu7f Original: [12] http://goo.gl/VHPfJ * Why iteratees are hard to understand Domain: blog.ezyang.com, Score: 34, Comments: 11 On Reddit: [13] http://goo.gl/LrEoV Original: [14] http://goo.gl/d1scG * Modern reall-world Haskell? Domain: self.haskell, Score: 33, Comments: 21 On Reddit: [15] http://goo.gl/l0Aud Original: [16] http://goo.gl/l0Aud * FRP: reactive-banana is getting dynamic event switching Domain: apfelmus.nfshost.com, Score: 30, Comments: 3 On Reddit: [17] http://goo.gl/dGblT Original: [18] http://goo.gl/ovRE5 * wxHaskell and wxWidgets 2.9 Domain: wewantarock.wordpress.com, Score: 29, Comments: On Reddit: [19] http://goo.gl/sxiBx Original: [20] http://goo.gl/878Aj * Updated Yesod blog example: i18n, authentication, authorization, and database Domain: yesodweb.com, Score: 28, Comments: 22 On Reddit: [21] http://goo.gl/4eDAT Original: [22] http://goo.gl/duzSG * Experiments in Haskell Packaging Domain: justhaskell.org, Score: 27, Comments: 5 On Reddit: [23] http://goo.gl/y2vHk Original: [24] http://goo.gl/0nADv * http-conduit Domain: yesodweb.com, Score: 26, Comments: 26 On Reddit: [25] http://goo.gl/gisUJ Original: [26] http://goo.gl/mMhaf * Reasoning about Stream Processing with Effects Domain: personal.cis.strath.ac.uk, Score: 26, Comments: 6 On Reddit: [27] http://goo.gl/3Ckzr Original: [28] http://goo.gl/Uw8ZO * Simon Marlow's Parallel and Concurrent Programming Haskell (slides) Domain: self.haskell, Score: 26, Comments: 3 On Reddit: [29] http://goo.gl/Rg0Lz Original: [30] http://goo.gl/Rg0Lz * Who is my Community? -- wxHaskell maintainer's thoughts on C bindings Domain: wewantarock.wordpress.com, Score: 26, Comments: On Reddit: [31] http://goo.gl/tcqZN Original: [32] http://goo.gl/mRwQa Top StackOverflow Questions * Fun with repeated fmap votes: 26, answers: 1 Read on SO: [33] http://goo.gl/T2FPm * Can a compiler automatically detect pure functions without the type information about purity? votes: 23, answers: 2 Read on SO: [34] http://goo.gl/wgYim * What does “floated out” mean? votes: 21, answers: 2 Read on SO: [35] http://goo.gl/8J3no * Haskell projects to study and learn from? votes: 19, answers: 2 Read on SO: [36] http://goo.gl/SHwsZ * How do you identify monadic design patterns? votes: 19, answers: 4 Read on SO: [37] http://goo.gl/dE3EJ * how do I get good (small) shrinks out of QuickCheck? votes: 16, answers: 0 Read on SO: [38] http://goo.gl/X3ZOs * Which applicative functor is used for passing shared parameters? votes: 14, answers: 1 Read on SO: [39] http://goo.gl/UxmZK * Double map in haskell? votes: 12, answers: 2 Read on SO: [40] http://goo.gl/uWpuz * Higher ranked and impredicative types votes: 12, answers: 1 Read on SO: [41] http://goo.gl/zpkXn * Handling events in Haskell votes: 12, answers: 1 Read on SO: [42] http://goo.gl/e7sV9 * Does the term “monadic” in J have anything to do with its Haskell use? votes: 12, answers: 4 Read on SO: [43] http://goo.gl/hTa2j * Any good articles on optimizing Haskell code? votes: 12, answers: 2 Read on SO: [44] http://goo.gl/FzRrf * What is a “free variable”? votes: 11, answers: 2 Read on SO: [45] http://goo.gl/Og5SC * Haskell Thread Communication Pattern Scenario votes: 10, answers: 1 Read on SO: [46] http://goo.gl/3Rzq0 * Defining a function by equations with different number of arguments votes: 10, answers: 1 Read on SO: [47] http://goo.gl/hejqO * What functionality do you get for free with Functors or other type-classes? votes: 10, answers: 5 Read on SO: [48] http://goo.gl/9hSlv * Why are types with no data constructors valid? votes: 10, answers: 1 Read on SO: [49] http://goo.gl/Pp6Ze * Folding flatMap/bind over a list of functions (a.k.a. Name That Combinator!) votes: 9, answers: 2 Read on SO: [50] http://goo.gl/bBtBI Until next time, Daniel Santa Cruz References 1. http://tech.dropbox.com/?p=129 2. http://www.reddit.com/r/haskell/comments/o0j2a/dropbox_tech_blog_using_the_… 3. http://www.reddit.com/r/haskell/comments/ohjg7/a_new_approach_to_iteratees/ 4. http://www.reddit.com/r/haskell/comments/ohjg7/a_new_approach_to_iteratees/ 5. https://www.youtube.com/watch?v=jBd9c1gAqWs 6. http://www.reddit.com/r/haskell/comments/o0im2/haskell_repa_realtime_ray_tr… 7. http://matt.might.net/articles/partial-orders/ 8. http://www.reddit.com/r/haskell/comments/o6nnp/order_theory_for_computer_sc… 9. https://github.com/leonidas/codeblog/blob/master/2012/2012-01-08-streams-co… 10. http://www.reddit.com/r/haskell/comments/o87z5/generalizing_streams_into_co… 11. http://www.well-typed.com/blog/63 12. http://www.reddit.com/r/haskell/comments/odv3t/welltyped_are_hiring_haskell… 13. http://blog.ezyang.com/2012/01/why-iteratees-are-hard-to-understand/ 14. http://www.reddit.com/r/haskell/comments/o2p3p/why_iteratees_are_hard_to_un… 15. http://www.reddit.com/r/haskell/comments/o5iov/modern_reallworld_haskell/ 16. http://www.reddit.com/r/haskell/comments/o5iov/modern_reallworld_haskell/ 17. http://apfelmus.nfshost.com/blog/2012/01/01-frp-api-0-5.html 18. http://www.reddit.com/r/haskell/comments/nz0af/frp_reactivebanana_is_gettin… 19. http://wewantarock.wordpress.com/2012/01/11/wxhaskell-and-wxwidgets-2-9/ 20. http://www.reddit.com/r/haskell/comments/oc8qi/wxhaskell_and_wxwidgets_29/ 21. http://www.yesodweb.com/blog/2012/01/blog-example 22. http://www.reddit.com/r/haskell/comments/of4g9/updated_yesod_blog_example_i… 23. http://justhaskell.org/2012/01/02/experiments-in-haskell-packaging/ 24. http://www.reddit.com/r/haskell/comments/nzv56/experiments_in_haskell_packa… 25. http://www.yesodweb.com/blog/2012/01/http-conduit 26. http://www.reddit.com/r/haskell/comments/o5b4w/httpconduit/ 27. http://personal.cis.strath.ac.uk/~raa/posts/2012-01-06-streams.html 28. http://www.reddit.com/r/haskell/comments/o5ioy/reasoning_about_stream_proce… 29. http://www.reddit.com/r/haskell/comments/oaqsa/simon_marlows_parallel_and_c… 30. http://www.reddit.com/r/haskell/comments/oaqsa/simon_marlows_parallel_and_c… 31. http://wewantarock.wordpress.com/2012/01/12/who-is-my-community/ 32. http://www.reddit.com/r/haskell/comments/ogtos/who_is_my_community_wxhaskel… 33. http://stackoverflow.com/questions/8736995/fun-with-repeated-fmap 34. http://stackoverflow.com/questions/8760956/can-a-compiler-automatically-det… 35. http://stackoverflow.com/questions/8779390/what-does-floated-out-mean 36. http://stackoverflow.com/questions/8703319/haskell-projects-to-study-and-le… 37. http://stackoverflow.com/questions/8777216/how-do-you-identify-monadic-desi… 38. http://stackoverflow.com/questions/8788542/how-do-i-get-good-small-shrinks-… 39. http://stackoverflow.com/questions/8762943/which-applicative-functor-is-use… 40. http://stackoverflow.com/questions/8735072/double-map-in-haskell 41. http://stackoverflow.com/questions/8739741/higher-ranked-and-impredicative-… 42. http://stackoverflow.com/questions/8780183/handling-events-in-haskell 43. http://stackoverflow.com/questions/8807539/does-the-term-monadic-in-j-have-… 44. http://stackoverflow.com/questions/8832624/any-good-articles-on-optimizing-… 45. http://stackoverflow.com/questions/8857038/what-is-a-free-variable 46. http://stackoverflow.com/questions/8705332/haskell-thread-communication-pat… 47. http://stackoverflow.com/questions/8745597/defining-a-function-by-equations… 48. http://stackoverflow.com/questions/8785311/what-functionality-do-you-get-fo… 49. http://stackoverflow.com/questions/8829194/why-are-types-with-no-data-const… 50. http://stackoverflow.com/questions/8716668/folding-flatmap-bind-over-a-list…

1 0

PhD program at Portland State accepting applications for Fall 2012
by Nathan Collins 18 Jan '12

18 Jan '12

Hi, Portland State University has a lot going on in functional programming. The Fall 2012 PhD program application deadline is March 1 for US students and February 1 for international students: http://cs.pdx.edu/programs/admissions FP related work at Portland: - Tim Sheard is working on the Trellys project: design and implementation (in Haskell) of a "practical" dependently typed programming language. Joint project with Aaron Stump at UIowa and Stephanie Weirich at UPenn. Here "practical" means intended for programming more than for theorem proving. Supports theorem proving, but also logically dubious features like general recursion and Type in Type. The key design issue is the interplay between safe and unsafe features. Project repo: https://code.google.com/p/trellys/ - Andrew Tolmach, Mark Jones, and James Hook are working on HASP: design and implementation (in Haskell) of a functional programming language for high-assurance systems programming. Project page: http://hasp.cs.pdx.edu/ - Sergio Antoy is working on narrowing in functional logic programming and the Curry FLP language. Intro to functional logic programming: http://web.cecs.pdx.edu/~antoy/homepage/publications/cacm/paper.pdf PAKCS Curry implementation: http://www.informatik.uni-kiel.de/~pakcs/ - Arthur Peters, a student of Sergio’s, is working on a new implementation of Curry based on a simplified graph rewriting model of functional logic computation. A paper about it and the prototype implementation are available at: http://web.cecs.pdx.edu/~amp4/vialois - Andrew Black is a co-author on a recent paper on Haskell for the Cloud: https://research.microsoft.com/en-us/um/people/simonpj/papers/parallel/ Other FP resources in Portland: - Galois, located a half mile from the computer science department, hosts many "Tech Talks", open to the public: http://corp.galois.com/blog/ - Functional programming study group: http://pdxfunc.org/ Living in Portland: - Portland is a very popular US city, known for beer, bikes, music, and street food: http://en.wikipedia.org/wiki/Portland_Oregon (wikipedia is blacked out today) Cheers, -nathan (PhD student in programming languages)

1 0

ANNOUNCE: jhc-0.7.8
by John Meacham 18 Jan '12

18 Jan '12

Announcing jhc 0.7.8! This is mainly a bug fix release. http://repetae.net/computer/jhc/ Changes include: * Now compiles under ghc 7.0.x as well as 6.12 * new standard libraries * filepath * deepseq * new platforms supported Nintendo DSi, GBA, and GP32 (thanks to Brian McKenna) * many bug fixes for various reported issues. see darcs logs for details. * LIB_OPTIONS respected when building external libraries * better float outward optimization * better diagnostics/dumping of core/grin on internal type errors * rewrite UnionSolve to be much faster, node analysis sped up accordingly. John

1 0