August 2011 - Haskell

FLOPS 2012: 1st Call for Papers
by Tom Schrijvers 15 Aug '11

15 Aug '11

First Call For Papers ===================== *Eleventh International Symposium on Functional and Logic Programming (FLOPS 2012)* May 23-25, 2012 Kobe, Japan [http://www.org.kobe-u.ac.jp/flops2012/] _Submission deadline : December 9, 2011_ FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), Ise (2008), and Sendai (2010). Topics ====== FLOPS solicits original papers in all areas of functional and logic programming, including (but not limited to): - Declarative Pearls: new and excellent declarative programs with illustrative applications. - Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing. - Foundations: logic and semantics, rewrite systems and narrowing, type theory, proof systems. - Implementation issues: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism. - Applications: case studies, real-world applications, graphical user interfaces, Internet applications, XML, databases, formal methods and model checking. The proceedings will be published as an LNCS volume. The proceedings of the previous meeting (FLOPS 2010) were published as LNCS 6009. PC co-Chairs ============ - Tom Schrijvers (Ghent University, Belgium) - Peter Thiemann (University of Freiburg, Germany) PC Members ========== - Salvador Abreu (University of Evora, Portugal) - Thorsten Altenkirch (University of Nottingham, UK) - Sebastian Brand (NICTA, Australia) - Giuseppe Castagna (CNRS Univ Paris 7, France) - Sebastian Fischer (Germany) - Marco Gavanelli (University of Ferrara, Italy) - Joxan Jaffar (National University of Singapore, Singapore) - Barry Jay (University of Sydney, Australia) - Andy King (University of Kent, UK) - Claude Kirchner (INRIA, France) - Neelakantan R. Krishnaswami (Microsoft Cambridge, UK) - Yulya Lierler (University of Kentucky, USA) - Keiko Nakata (Tallinn University of Technology, Estonia) - Peter Schneider-Kamp (University of Southern Denmark, Denmark) - Olin Shivers (Northeastern University, USA) - Paul Tarau (University of Northern Texas, USA) - Kazunori Ueda (Waseda University, Japan) - Meng Wang (Chalmers Technical University, Sweden) General Chair and Local co-Chairs ================================= - Naoyuki Tamura (Kobe University, Japan) - Mutsunori Banbara (Kobe University, Japan) - Katsutoshi Hirayama (Kobe University, Japan) Submission ========== Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Submissions should fall into one of the following categories: - Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. - System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. Submissions must be written in English and can be up to 15 pages long, though pearls are typically considerably shorter. Authors are required to use LaTeX2e and the Springer llncs class file, available at [http://www.springer.de/comp/lncs/authors.html] Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a web page, or an appendix). Papers should be submitted electronically at [https://www.easychair.org/conferences/?conf=flops2012] Important Dates =============== - Submission deadline : December 9, 2011 - Author notification : February 3, 2012 - Camera-ready copy : March 2, 2012 Place and Related Events ======================== Takikawa Memorial Hall, Kobe University, 1-1 Rokkodai, Nada, Kobe 657-8501 Japan. The 23rd International Conference on Rewriting Techniques and Applications (RTA 2012) and satellite workshops including WFLP 2012 will be held in the week after FLOPS at Nagoya, Japan. Some Previous FLOPS =================== - FLOPS 2010, Sendai: [http://www.kb.ecei.tohoku.ac.jp/flops2010/] - FLOPS 2008, Ise: [http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/] - FLOPS 2006, Fuji Susono: [http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/] Sponsors ======== - Japan Society for Software Science and Technology (JSSST) SIGPPL In Cooperation with =================== - ACM SIGPLAN (pending approval) - Asian Association for Foundation of Software (AAFS) - Association for Logic Programming (ALP)

1 0

Announce: HTTP-4000.1.2
by Ganesh Sittampalam 11 Aug '11

11 Aug '11

Hi, I've just uploaded HTTP-4000.1.2, which just bumps the base dependency to work with GHC 4.2.1. I'm aware that there are a bunch of pending patches people have sent me, including some from several months ago that I haven't even acknowledged - sorry! I hope to integrate these at CamHac this weekend and upload a slightly bigger update then. Please note that I'm only the HTTP maintainer because noone else seems to want the job, and it's thus not getting much attention. I'd be very happy for someone else to take over or share the load. Cheers, Ganesh

1 0

ANNOUNCE: Chell: A quiet test runner (low-output alternative to test-framework)
by John Millikin 11 Aug '11

11 Aug '11

Homepage: https://john-millikin.com/software/chell/ Hackage: http://hackage.haskell.org/package/chell -------- This is just a quick package I whipped up out of frustration with test-framework scrolling an error message out of sight, for the millionth time. Chell has the same general purpose (aggregate your assertions + properties + whatever into a single executable), but only prints when a test fails or aborts. It also has a small built-in test library, similar to HUnit, so you don't need to depend on 2-3 separate libraries if you're just doing simple tests. Cool features thereof: * it reports the line number of failed assertions * you can use $expect instead of $assert, so even if it fails, the test keeps going (all the failures are printed at the end) * you can add "notes" to a test, which are saved in logs and reports. you can put in any sort of metadata you want (nice for figuring out why a test is failing) * assertions for text diffs, so if you're testing two big chunks of text for equality you don't have to copy+paste to see what's different.

1 0

Haskell Weekly News: Issue 194
by Daniel Santa Cruz 11 Aug '11

11 Aug '11

Welcome to issue 194 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of July 31 to August 6, 2011. [1] http://goo.gl/8hDku You can find a HTML rendition of this newsletter at: http://contemplatecode.blogspot.com/2011/08/haskell-weekly-news-issue-194.h… Announcements Andy Gill has issued a call for papers for the 23rd Symposium on Implementation and Application of Functinal Languages (IFL 2011) to be held at the University of Kansan, in Lawrence, Kansas, USA. The symposium is scheduled for October 3-5, 2011. [2] http://goo.gl/hHD2H Anil Madhavapeddy issued a call for participation to the Commercial Users of Functional Programming Workshop (CUFP 2011), which will be co-located with the ICFP 2011 in Tokyo, Japan, on September 22-24, 2011. [3] http://goo.gl/BvPpj The GHC team annouced the release of GHC 7.2.1 [4] http://goo.gl/0gTL3 New and Updated Projects * Eddie (Mike Meyer): A tool for shell scripting with haskell. [5] http://goo.gl/tzdbv * HROOT (Ian-Woo Kim): Haskell binding to the ROOT analysis package. [6] http://goo.gl/qJ1Bb * vector-algorithms (Dan Doel): Efficient Algorithms for Vector Arrays. [7] http://goo.gl/YZmxR * Alex (Simon Marlow): Update. A lexical analyser generator for Haskell. [8] http://goo.gl/dDYrl Quotes of the Week * kmc: when computer scientists rebuild the world after the apocalypse, we will have hanging gardens with trees that grow downward * kmc: a wise man once said that the entire world can be described as convex combinations of drugs, math, and cardboard * roconnor: as a rule of thumb, avoid any packages shipped with the Haskell Plaform. * kmc: Try the new GHC IO Scheduler! It's got what plants crave! * kmc: I refuse to believe that any loving god would invent the monomorphism restriction * AlanPerlis: It is easier to write an incorrect program than understand a correct one. * [kmc] do you have a theory where the stack overflow is coming from? [copumpkin] joel spolsky * @faq is it possible to find things Haskell can't do? [lambdabot] The answer is: Yes! Haskell can do that. * kmc: Haskell isn't really designed by mathematicians. it's designed by people who programmers would consider to be mathematicians and mathematicians would consider to be programmers Top Reddit Stories * "I'm very tempted to want to move to a functional programming language. Haskell or Ocaml or something" -John Carmack Domain: youtube.com, Score: 120, Comments: 62 On Reddit: [9] http://goo.gl/enBuK Original: [10] http://goo.gl/WXfZy * That seems like a challenge! Whatever happened to the hs->js compiler? Domain: xkcd.com, Score: 48, Comments: 12 On Reddit: [11] http://goo.gl/okkWU Original: [12] http://goo.gl/HykNt * The Conditional Choice Operator Domain: zenzike.com, Score: 47, Comments: 15 On Reddit: [13] http://goo.gl/npdIK Original: [14] http://goo.gl/tdb4J * Haskell For Kids! Introduction to My Upcoming Class Domain: cdsmith.wordpress.com, Score: 47, Comments: 31 On Reddit: [15] http://goo.gl/Gnmg9 Original: [16] http://goo.gl/y1pEF * seL4, a formally verified version of the L4 microkernel, was spec-prototyped in Haskell (PDF) Domain: sigops.org, Score: 23, Comments: 8 On Reddit: [17] http://goo.gl/fq0t9 Original: [18] http://goo.gl/mCrEu * Hi guys, I made a Haskell to Clojure translator. Check it out :D Domain: github.com, Score: 17, Comments: 21 On Reddit: [19] http://goo.gl/Fxdwa Original: [20] http://goo.gl/OL86U * Moderator Guidelines : Them's the rules. Domain: self.haskell, Score: 12, Comments: 0 On Reddit: [21] http://goo.gl/UPz94 Original: [22] http://goo.gl/UPz94 * Library of conditional one-liners and combinators? Domain: self.haskell, Score: 11, Comments: 39 On Reddit: [23] http://goo.gl/dTmX1 Original: [24] http://goo.gl/dTmX1 * Zoom, a thor/rake-like task runner for Haskell (very alpha) Domain: github.com, Score: 10, Comments: 3 On Reddit: [25] http://goo.gl/KkW9v Original: [26] http://goo.gl/LqYUE * Yesod form overhaul Domain: yesodweb.com, Score: 8, Comments: 1 On Reddit: [27] http://goo.gl/biQuv Original: [28] http://goo.gl/lxuYj * ETA on the Haskell Platform 2011.4.0.0 release? Domain: self.haskell, Score: 8, Comments: 3 On Reddit: [29] http://goo.gl/gydgP Original: [30] http://goo.gl/gydgP Top StackOverflow Questions * Speed comparison C vs python vs erlang vs haskell votes: 50, answers: 8 Read on SO: [31] http://goo.gl/XEZ9Z * Recursion schemes for dummies? votes: 37, answers: 2 Read on SO: [32] http://goo.gl/nnhGb * Is it possible to place inequality constraints on haskell type variables? votes: 11, answers: 1 Read on SO: [33] http://goo.gl/VnexA * Haskell: Prefer pattern-matching or member access? votes: 9, answers: 6 Read on SO: [34] http://goo.gl/E225N * Difference between TVar and TMVar votes: 7, answers: 2 Read on SO: [35] http://goo.gl/lmn1R * Java's Interface and Haskell's type class: differences and similarities? votes: 7, answers: 6 Read on SO: [36] http://goo.gl/fMGpH * Haskell code accompanying the Paul Hudak 1994 US Navy experiment paper [migrated] votes: 7, answers: 0 Read on SO: [37] http://goo.gl/fpVO5 About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18868 3. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18873 4. http://www.haskell.org/ghc/download_ghc_7_2_1 5. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18867 6. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91469 7. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18871 8. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18874 9. http://www.youtube.com/watch?v=4zgYG-_ha28&feature=player_detailpage#t=4193s 10. http://www.reddit.com/r/haskell/comments/jap3x/im_very_tempted_to_want_to_m… 11. http://www.xkcd.com/934/ 12. http://www.reddit.com/r/haskell/comments/j9nef/that_seems_like_a_challenge_… 13. http://zenzike.com/posts/2011-08-01-the-conditional-choice-operator 14. http://www.reddit.com/r/haskell/comments/j6rbd/the_conditional_choice_opera… 15. http://cdsmith.wordpress.com/2011/08/03/haskell-for-kids-introduction/ 16. http://www.reddit.com/r/haskell/comments/j8ac0/haskell_for_kids_introductio… 17. http://www.sigops.org/sosp/sosp09/papers/klein-sosp09.pdf 18. http://www.reddit.com/r/haskell/comments/ja27r/sel4_a_formally_verified_ver… 19. https://github.com/dmead/Clojure-translate 20. http://www.reddit.com/r/haskell/comments/jarp0/hi_guys_i_made_a_haskell_to_… 21. http://www.reddit.com/r/haskell/comments/j8df0/moderator_guidelines_thems_t… 22. http://www.reddit.com/r/haskell/comments/j8df0/moderator_guidelines_thems_t… 23. http://www.reddit.com/r/haskell/comments/j51yw/library_of_conditional_oneli… 24. http://www.reddit.com/r/haskell/comments/j51yw/library_of_conditional_oneli… 25. https://github.com/iand675/Zoom 26. http://www.reddit.com/r/haskell/comments/ja6fo/zoom_a_thorrakelike_task_run… 27. http://www.yesodweb.com/blog/2011/08/yesod-form-overhaul 28. http://www.reddit.com/r/haskell/comments/j8gta/yesod_form_overhaul/ 29. http://www.reddit.com/r/haskell/comments/jaa8t/eta_on_the_haskell_platform_… 30. http://www.reddit.com/r/haskell/comments/jaa8t/eta_on_the_haskell_platform_… 31. http://stackoverflow.com/questions/6964392/speed-comparison-c-vs-python-vs-… 32. http://stackoverflow.com/questions/6941904/recursion-schemes-for-dummies 33. http://stackoverflow.com/questions/6939043/is-it-possible-to-place-inequali… 34. http://stackoverflow.com/questions/6913130/haskell-prefer-pattern-matching-… 35. http://stackoverflow.com/questions/6915079/difference-between-tvar-and-tmvar 36. http://stackoverflow.com/questions/6948166/javas-interface-and-haskells-typ… 37. http://stackoverflow.com/questions/6953020/haskell-code-accompanying-the-pa…

1 0

Announce: time-1.3
by Ashley Yakeley 10 Aug '11

10 Aug '11

I've uploaded time-1.3 to Hackage. Version 1.3 adds "instance RealFrac DiffTime". -- Ashley

1 0

Second CFP: PEPM12 - Workshop on Partial Evaluation and Program Manipulation
by oleg＠okmij.org 10 Aug '11

10 Aug '11

ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12) Call For Papers Paper submission deadline: Mon, October 10, 2011, 23:59, GMT http://www.program-transformation.org/PEPM12 The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the broad area of program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. Each technique or tool of program manipulation should have a clear, although perhaps informal, statement of desired properties, along with an argument how these properties could be achieved. Topics of interest for PEPM'12 include, but are not limited to: - Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. - Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. - Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. - Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press and will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'12. Submission Categories and Guidelines Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice. Regular research papers must not exceed 10 pages in ACM Proceedings style. Short papers are up to 4 pages in ACM Proceedings style. Authors of tool demonstration proposals are expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Important Dates - Paper submission: Mon, October 10, 2011, 23:59, GMT - Author notification: Tue, November 8, 2011 - Workshop: Mon-Tue, January 23-24, 2012 Invited Speakers - Markus Pueschel (ETH Zurich, Switzerland) - Martin Berger (University of Sussex, UK) Program Chairs - Oleg Kiselyov (Monterey, CA, USA) - Simon Thompson (University of Kent, UK) Program Committee Members - Emilie Balland (INRIA, France) - Ewen Denney (NASA Ames Research Center, USA) - Martin Erwig (Oregon State University, USA) - Sebastian Fischer (National Institute of Informatics, Japan) - Lidia Fuentes (Universidad de Malaga, Spain) - John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain) - Dave Herman (Mozilla Research, USA) - Stefan Holdermans (Vector Fabrics, the Netherlands) - Christian Kaestner (University of Marburg, Germany) - Emanuel Kitzelmann (International Computer Science Institute, USA) - Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences) - Shin-Cheng Mu (Academia Sinica, Taiwan) - Alberto Pardo (Universidad de la Repu'blica, Uruguay) - Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece) - Anthony M. Sloane (Macquarie University, Australia) - Armando Solar-Lezama (MIT, USA) - Aaron Stump (The University of Iowa, USA) - Kohei Suenaga (University of Kyoto, Japan) - Eric Van Wyk (University of Minnesota, USA) - Kwangkeun Yi (Seoul National University, Korea)

1 0

Continuation Workshop 2011: Call for participation
by oleg＠okmij.org 10 Aug '11

10 Aug '11

ACM SIGPLAN Continuation Workshop 2011 http://logic.cs.tsukuba.ac.jp/cw2011/ co-located with ICFP 2011, Tokyo, Japan Saturday, September 24, 2011 Call for Participation Early Registration deadline is August 15! Continuations have been discovered many times, which highlights their many applications in programming language semantics and program analysis, linguistics, logic, parallel processing, compilation and web programming. Recently, there has been a surge of interest specifically in delimited continuations: new implementations (in Scala, Ruby, OCaml, Haskell), new applications (to probabilistic programming, event-driven distributed processing), substructural and constructive logics, natural language semantics. The goal of the Continuation Workshop is to make continuations more accessible and useful -- to practitioners and to researchers in various areas of computer science and outside computer science. We wish to promote communication among the implementors and users in many fields. We would like to publicize the applications of continuations in academic (logic, linguistics) and practical fields and various programming languages (OCaml, Haskell, Scala, Ruby, Scheme, etc.). Invited talks ------------- Mats Rooth, Cornell University http://conf.ling.cornell.edu/mr249/ >From Logic to Effects and Back Noam Zeilberger, Universite' Paris 7 http://www.pps.jussieu.fr/~noam/ Tutorials --------- In the evening before the workshop, there will be a tutorial session ``Introduction to Programming with Shift and Reset'' Tutorial date and time: Friday, September 23, 2011, 19:00-21:00 Tutorial place: IIJ (next to NII, the place of the ICFP conference) Tutorial speakers: Kenichi Asai and Oleg Kiselyov Presentations ------------- Non-Deterministic Search Library Kenichi ASAI, Chihiro KANEKO `Focus movement' by delimited continuations Daisuke BEKKI Swarm: transparent scalability through portable continuations James DOUGLAS Correctness of Functions with Shift and Reset Noriko HIROTA, Kenichi ASAI Yield, the control operator: applications and a conjecture Roshan P. JAMES, Amr SABRY Demonstration of Continuation based C on GCC Shinji KONO Modular rollback through free monads Conor McBRIDE, Olin SHIVERS, Aaron TURON Using delimited continuations for distributed computing with the CIEL engine Derek G. MURRAY, Malte SCHWARZKOPF, Christopher SMOWTON, Steven SMITH, Anil MADHAVAPEDDY, Steven HAND The limit of the CPS hierarchy Josef SVENNINGSSON Visualizing continuations Naoki TAKASHIMA, Yukiyoshi KAMEYAMA

1 0

Second CFP: PADL'12 - Practical Aspects of Declarative Languages 2012
by Claudio Russo 09 Aug '11

09 Aug '11

[Apologies if you receive multiple copies.] Call for Papers =============== 14th International Symposium on Practical Aspects of Declarative Languages (PADL 2012) http://research.microsoft.com/~crusso/padl12 Philadelphia, Pennsylvania, USA, January 23-24, 2012 Co-located with ACM POPL'12 Abstract/Paper submission deadline: September 10th/17th, 2011 Conference Description ====================== Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to many different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raise numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include, but are not limited to: * Innovative applications of declarative languages * Declarative domain-specific languages and applications * Practical applications of theoretical results * New language developments and their impact on applications * Declarative languages and Software Engineering * Evaluation of implementation techniques on practical applications * Practical experiences and industrial applications * Novel uses of declarative languages in the classroom * Practical extensions such as constraint-based, probabilistic, and reactive languages. PADL'12 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages. In this occasion PADL is co-located, as traditionally, with ACM POPL, which will be held immediately following PADL, January 25-27. The symposium will be held in Philadelphia, Pennsylvania, USA. Important Dates and Submission Guidelines ========================================= Abstract Submission: September 10, 2011 Paper Submission: September 17, 2011 Notification: October 22, 2011 Camera-ready: November 5, 2011 Symposium: January 23-24, 2012 Authors should submit an electronic copy of the full paper in PDF using the Springer LNCS format. The submission will be done through EasyChair conference system. If electronic submission is impossible, please contact the program chairs for information on how to submit hard copies. All submissions must be original work written in English. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. PADL'12 will accept both technical and application papers: * Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 15 pages in Springer LNCS format. * Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers will be published in the Springer-Verlag conference proceedings, and will be presented in a separate session. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited. The limit for application papers is 6 pages in Springer LNCS format. Program Committee ================= Marcello Balduccini, Intelligent Systems Department, Kodak Research Labs Edwin Brady, University of St Andrews, Scotland Henning Christiansen, Roskilde University, Denmark Agostino Dovier, University of Udine, Italy Matthew Flatt, University of Utah, USA Gopal Gupta, University of Texas at Dallas, USA John Hughes, Chalmers University of Technology, Sweden; Quviq AB Gabriele Keller, University of New South Wales, Australia Lunjin Lu, Oakland University, USA Marc Pouzet, École normale supérieure, France Ricardo Rocha, University of Porto, Portugal Andreas Rossberg, Google Germany GmbH, Germany Claudio Russo, Microsoft Research Cambridge, UK (co-chair) Kostis Sagonas, Uppsala Univeristy, Sweden Satnam Singh, Microsoft Research Cambridge, UK Zoltan Somogyi, University of Melbourne, Australia Eijiro Sumii, Tohoku University, Japan Terrance Swift, Universidade Nova de Lisboa, Portugal; Johns Hopkins University, USA Andrew Tolmach, Portland State University, USA Jan Wielemaker, University of Amsterdam, The Netherlands Roland Yap, National University of Singapore, Republic of Singapore Kwangkeun Yi, Seoul National University, Korea Neng-Fa Zhou, Brooklyn College, City University of New York, USA (co-chair) Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: Claudio Russo Microsoft Research Cambridge,UK Email: crusso <AT> microsoft <DOT> com Neng-Fa Zhou Brooklyn College, The City University of New York, USA Email: zhou <AT> sci <DOT> brooklyn <DOT> cuny <DOT> edu With the Cooperation of ======================= The Association for Logic Programming (ALP) ACM SIGPLAN Microsoft Research, Cambridge ===================================

1 0

PhD Position available at Strathclyde
by Conor McBride 09 Aug '11

09 Aug '11

[My colleague, Patricia Johann, advertises the following...] PhD Position in Category Theory and Functional Programming Department of Computer and Information Sciences University of Strathclyde, Scotland Applications are invited for one PhD position within the Mathematically Structured Programming group at the University of Strathclyde. The group comprises Prof. Neil Ghani, Dr. Patricia Johann, Dr. Conor McBride, Dr. Peter Hancock, Dr. Robert Atkey, and six PhD students. The PhD project centres around applications of categorical methods to functional programming languages. The project is under the direction of Patricia Johann. The successful applicant will have either a first-class degree or an MSc in Mathematics or Computing Science or a related subject with a strong Mathematics or Computing Science component. Ideally, they will also have a strong, documented interest in doing research. Strong mathematical background and problem-solving skills are essential; good programming skills are a plus. Prior knowledge of category theory and/ or functional programming is an advantage, but is not required. The PhD position is for 3 years; it starts in January 2012. The position is a fully-funded post for a UK or EU student, and includes both coverage of fees and an EPSRC-level stipend for each of the three years. More information about the department is available at http://www.strath.ac.uk/cis The University of Strathclyde (http://www.strath.ac.uk) is located in the heart of Glasgow, which Lonely Planet Travel Guides hail as "one of Britain's largest, liveliest and most interesting cities" (seehttp://www.lonelyplanet.com/worldguide/scotland/glasgow/) . Southern Scotland provides a particularly stimulating environment for researchers in theoretical computer science, with active groups in this area at Heriot-Watt University, the University of Edinburgh, the University of Glasgow, the University of St. Andrews, and the University of Strathclyde. Requests for further information and other informal enquiries can be sent to: Patricia Johann patricia at cis.strath.ac.uk Those interested in the position are asked to send e-mail to the address given above in the next short while.

1 0

ANNOUNCE: Alex version 3.0
by Simon Marlow 05 Aug '11

05 Aug '11

I am pleased to announce version 3.0 of Alex, the lexical analyser generator for Haskell. Highlights in this release: * Unicode support (contributed mostly by Jean-Philippe Bernardy, with help from Alan Zimmerman, and using code from the ranged-sets package written by Paul Johnson). * Alex now does DFA minimization, which helps to reduce the size of the generated tables, especially for lexers that use Unicode. More details in the release notes: http://www.haskell.org/alex/doc/html/about.html#relnotes-30 Alex can be obtained from Hackage http://hackage.haskell.org/package/alex The master repository is now on github: https://github.com/simonmar/alex Alex is distributed under a BSD-style license. Cheers, Simon

1 0