- Haskell - Haskell.org

Deadline extension: The 20th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2014)
by Yuan-Fang Li 04 May '14

04 May '14

*** Apologies for cross-posting *** *Due to numerous requests, the deadline of PRDC 2014 has been extended to May 16th 2014.* *Call for Papers: The 20th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2014)* *Singapore Nov 18-21, 2014 * PRDC 2014 (http://prdc.dependability.org/PRDC2014/index.html) is the twentieth in this series of symposia started in 1989 that are devoted to dependable and fault-tolerant computing. PRDC is recognized as the main event in the Pacific area that covers the many dimensions of dependability and fault tolerance, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems. As applications of computing systems have permeated into all aspects of daily life, the dependability of computing systems has become increasingly critical. This symposium provides a forum for countries around the Pacific Rim and other areas of the world to exchange ideas for improving the dependability of computing systems. Topics of interest include (but not limited to): - Software and hardware reliability, testing, verification, and validation - Dependability measurement, modeling, evaluation, and tools - Self-healing, self-protecting, and fault-tolerant systems - Software aging and rejuvenation - Safety-critical systems and software - Architecture and system design for dependability - Fault-tolerant algorithms and protocols - Reliability in cloud computing, Internet, and web systems and applications - Cloud and Internet Information security - Dependability issues in computer networks and communications - Dependability issues in distributed and parallel systems - Dependability issues in real-time systems, database, and transaction processing systems - Dependability issues in autonomic computing - Dependability issues in aerospace and embedded systems Paper Submissions Manuscripts should be submitted in the following categories: Regular Papers and Practical Experience Reports. Regular Papers should describe original research (not submitted or published elsewhere) and be not more than 10 pages using IEEE format guidelines <http://www.ieee.org/conferences_events/conferences/publishing/templates.html>or 20 pages double-spaced. Practical Experience Reports (max 6 pages using IEEE format guidelines or 12 pages double-spaced) should describe an experience or a case study, such as the design and deployment of a system or actual failure and recovery field data. The title page should include a 150-word abstract, five keywords, authors' names and affiliations, and a line specifying whether the submission is a Regular Paper or a Practical Experience Report. The full mailing address, phone, fax, and email address of the corresponding author should be specified. All submissions must be made electronically (in PDF format) on the submission web site <https://www.easychair.org/conferences/?conf=prdc2014>. Papers will be reviewed internationally and selected based on their originality, significance, relevance, and clarity of presentation. All accepted papers will be published by IEEE Computer Society Press. One outstanding paper will be selected to receive the Best Paper Award. Important Dates Revised submission deadline: May 16, 2014 Revised notification: June 28, 2014 Best regards Yuan-Fang

1 0

PPDP 2014: 2nd Call for Papers
by Jacob Johannsen 02 May '14

02 May '14

====================================================================== 2nd Call for papers 16th International Symposium on Principles and Practice of Declarative Programming PPDP 2014 Canterbury, Kent, September 8-10, 2014 (co-located with LOPSTR 2014) http://users-cs.au.dk/danvy/ppdp14/ ====================================================================== SUBMISSION DEADLINE: 15 MAY, 2014 PPDP 2014 is a forum that brings together researchers from the declaratrive programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing 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 analyzing 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 modeling in a declarative language and modeling reactivity * Memory management and the implementation of declarative systems * Practical experiences and industrial application This year the conference will be co-located with the 24th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2014). The conference will be held in Canterbury, UK. Previous symposia were held at Madrid (Spain), Leuven (Belgium), 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). You might have a look at the contents of past PPDP symposia. 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). The proceedings will be published in the ACM Digital Library. 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 30% extra material over and above the PPDP version. Then, after another round of reviewing, these revised papers will be published in a journal. Important Dates Abstract Submission: 12 May, 2014 Paper submission: 15 May, 2014 Notification: 30 June, 2014 Camera-ready: To be announced Symposium: 8-10 September, 2014 Invites for journal publication: To be announced Submission of journal version: To be announced Notification: To be announced Camera-ready version: To be announced Authors should submit an electronic copy of the full paper in PDF. Papers should be submitted to the submission website for PPDP 2014. 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 the program committee in selecting appropriate reviewers for the paper. Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. Program Committee Michael Adams University of Illinois at Urbana-Champaign, USA Elvira Albert Complutense University of Madrid, Spain Dariusz Biernacki University of Wroclaw, Poland Bernd Brassel Recordbay, Germany Mike Codish Ben-Gurion University of the Negev, Israel Olivier Danvy (chair) Aarhus University, Denmark Marc Denecker KU Leuven, Belgium Joshua Dunfield Max Planck Institute for Software Systems, Germany Zoe Drey ENSTA Bretagne/Lab-STICC, France Thibaut Feydy NICTA, Australia Danko Ilik Inria, France Yukiyoshi Kameyama University of Tsukuba, Japan Chantal Keller Microsoft Research -- Inria Joint Centre Temur Kutsia RISC, Johannes Kepler University Linz, Austria Dan Licata Wesleyan University, USA Akimasa Morihata University of Tokyo, Japan Matthias Puech McGill University, Canada Tiark Rompf Oracle Labs and EPFL, Switzerland Kristoffer H. Rose Two Sigma Labs, New York, USA Ilya Sergey IMDEA Software Institute, Spain Ralf Treinen University Paris-Diderot, France Frank D. Valencia CNRS and LIX, Ecole Polytechnique, France Program Chair Olivier Danvy Department of Computer Science Aarhus University Aabogade 34 DK-8200 Aarhus N, Denmark Email: danvy(a)cs.au.dk Symposium Chairs: Andy King School of Computing University of Kent Canterbury, Kent, CT2 7NF United Kingdom Email: A.M.King(a)kent.ac.uk Olaf Chitil School of Computing University of Kent Canterbury, Kent, CT2 7NF United Kingdom Email: O.Chitil(a)kent.ac.uk Publicity Chair: Jacob Johannsen Department of Computer Science Aarhus University Aabogade 34 DK-8200 Aarhus N, Denmark Email: cnn(a)cs.au.dk

1 0

Reminder: FARM 2014: deadlines approaching!
by Henrik Nilsson 02 May '14

02 May '14

Dear all, This is just a reminder about FARM 2014: Workshop on Functional Art, Music, Modeling and Design, co-located with ICFP in Gothenburg in September. http://functional-art.org/2014/ The abstract deadline (for full papers) is fast approaching (7 May), and the overall deadline for full papers and demos is not far behind (11 May). Call for papers enclosed. Apologies for cross-postings. All the best, /Henrik -- Henrik Nilsson School of Computer Science The University of Nottingham nhn(a)cs.nott.ac.uk This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

Final CFP: Workshop on Generic Programming (WGP) 2014
by José Pedro Magalhães 02 May '14

02 May '14

Apologies for multiple postings. ====================================================================== CALL FOR PAPERS WGP 2014 10th ACM SIGPLAN Workshop on Generic Programming Gothenburg, Sweden Sunday, August 31, 2014 http://www.wgp-sigplan.org/2014 Co-located with the International Conference on Functional Programming (ICFP 2014) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * type systems for generic programming, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * implementation of generic programming languages, * static and dynamic analyses of generic programs, * and so on. Program Committee ----------------- José Pedro Magalhães (co-chair), University of Oxford Tiark Rompf (co-chair), Oracle Labs & EPFL Peter Achten, Radboud University Nijmegen Nada Amin, Ecole Polytechnique Fédérale de Lausanne (EPFL) Pierre-Évariste Dagand, INRIA Paris-Rocquencourt Fritz Henglein, University of Copenhagen Andrew Lumsdaine, Indiana University Miles Sabin, Underscore Consulting LLP, Chuusai Ltd. Alexander Slesarenko, Huawei Labs & Keldysh Institute of Applied Mathematics (KIAM) Anthony M. Sloane, Macquarie University Wouter Swierstra, Utrecht University Meng Wang, Chalmers University of Technology Proceedings and Copyright ------------------------- We plan to have formal proceedings, published by the ACM. 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. Submission details ------------------ Deadline for submission: Sunday 2014-05-11 Notification of acceptance: Friday 2014-06-06 Final submission due: Wednesday 2014-06-18 Workshop: Sunday 2014-08-31 Submitted papers should fall into one of two categories: * Regular research papers (12 pages) * Short papers: case studies, tool demos, generic pearls (6 pages) Regular research papers are expected to present novel and interesting research results. Short papers need not present novel or fully polished results. Good candidates for short papers are those that report on interesting case studies of generic programming in open source or industry, present demos of generic programming tools or libraries, or discuss elegant and illustrative uses of generic programming ('pearls'). All submissions should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). Regular research papers must not exceed 12 pages. Short papers must not exceed 6 pages. If applicable, papers should be marked with one of the labels 'case study, 'tool demo' or 'generic pearl' in the title at the time of submission. Papers should be submitted via EasyChair at https://www.easychair.org/conferences/?conf=wgp2014 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 program, see its web page (http://www.sigplan.org/PAC.htm) History of the Workshop on Generic Programming ---------------------------------------------- Earlier Workshops on Generic Programming have been held in * Boston, Massachusetts, US 2013 (affiliated with ICFP13), * Copenhagen, Denmark 2012 (affiliated with ICFP12), * Tokyo, Japan 2011 (affiliated with ICFP11), * Baltimore, Maryland, US 2010 (affiliated with ICFP10), * Edinburgh, UK 2009 (affiliated with ICFP09), * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop). There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). WGP Steering Committee ---------------------- Shin-Cheng Mu (chair) Jaako Järvi Andres Löh Ronald Garcia Jacques Carette Jeremiah Willcock Tim Sheard Stephanie Weirich Tarmo Uustalu

1 0

ANN: hledger-0.23, hledger-web-0.23
by Simon Michael 01 May '14

01 May '14

I'm pleased to announce hledger and hledger-web 0.23! This release includes command-line fixes and polish, a new accounts command, and a number of changes to the balance command relating to --depth, --flat, and multicolumn mode, which I find has made it much more useful. Release notes: http://hledger.org/release-notes#hledger-023-201451 . Contributors to this release: Peter Simons and Marko Kocić. hledger (http://hledger.org) is a command-line tool and haskell library for tracking financial transactions, which are stored in a human-readable plain text format. It can also read CSV or timelog files. It provides useful reports, and can also help you record new transactions interactively. Add-on commands include hledger-web (a web interface), hledger-irr (for calculating internal rate of return) and hledger-interest (for generating interest transactions). hledger is inspired by and largely compatible with Ledger. Installation: cabal update; cabal install hledger [hledger-web] (see http://hledger.org/installing for help) or sponsor a binary at http://hledger.org/download Best! -Simon

1 0

Haskell Weekly News: Issue 293
by Daniel Santa Cruz 01 May '14

01 May '14

Welcome to issue 293 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from April 20 to 26, 2014 Quotes of the Week * monochrom: linux's ulimit for main memory will not help because linux kernel's allocator is a lazy yes-man (think irrefutable pattern) * edwardk: lens is the only library I've ever written that generates hate mail and invites to give talks in almost equal measure * shachaf: You don't need lens to produce or consume lenses. You just need it to complain about them. * glguy_: Reddit has shown you don't need to have used the lens package to complain about it, either Top Reddit Stories * What I Wish I Knew When Learning Haskell 2.0 Domain: dev.stephendiehl.com, Score: 191, Comments: 37 On Reddit: [1] http://goo.gl/PkvrnZ Original: [2] http://goo.gl/ljYe4w * Announcing cabal 1.20 Domain: blog.johantibell.com, Score: 141, Comments: 38 On Reddit: [3] http://goo.gl/H16RoZ Original: [4] http://goo.gl/2r3vBH * Lens is unidiomatic Haskell Domain: ro-che.info, Score: 124, Comments: 231 On Reddit: [5] http://goo.gl/Hm7Zbl Original: [6] http://goo.gl/HrI0L6 * wreq: a capable new HTTP client library Domain: serpentine.com, Score: 121, Comments: 128 On Reddit: [7] http://goo.gl/kUZp4s Original: [8] http://goo.gl/y8QFpR * Applicative became a superclass of Monad Domain: ghc.haskell.org, Score: 94, Comments: 46 On Reddit: [9] http://goo.gl/0OIiPz Original: [10] http://goo.gl/DKCUsD * Open Sourced! Cryptol: A Domain Specific Language for Specifying Cryptographic Algorithms Domain: cryptol.net, Score: 91, Comments: 7 On Reddit: [11] http://goo.gl/32oaZd Original: [12] http://goo.gl/30Y9g0 * Model-view-controller, Haskell-style Domain: haskellforall.com, Score: 81, Comments: 55 On Reddit: [13] http://goo.gl/yJH5Ck Original: [14] http://goo.gl/pjqFPN * Lenses don't compose backwards. Domain: self.haskell, Score: 73, Comments: 35 On Reddit: [15] http://goo.gl/p9e9v8 Original: [16] http://goo.gl/p9e9v8 * 14 Haskell Projects accepted for Google Summer of Code Domain: google-melange.com, Score: 59, Comments: 28 On Reddit: [17] http://goo.gl/bw3jrU Original: [18] http://goo.gl/O91dDJ * New issue of The Monad Reader (#23) Domain: themonadreader.wordpress.com, Score: 48, Comments: 11 On Reddit: [19] http://goo.gl/PgFaAg Original: [20] http://goo.gl/M62yM8 * Lens from the ground up Domain: mth.io, Score: 44, Comments: 25 On Reddit: [21] http://goo.gl/7hb2dZ Original: [22] http://goo.gl/W2C4x2 * Lenses You Can Make at Home Domain: duplode.github.io, Score: 40, Comments: 17 On Reddit: [23] http://goo.gl/5Fx3re Original: [24] http://goo.gl/qs2nbt Top StackOverflow Questions * How do experienced Haskell developers approach laziness at *design* time? votes: 26, answers: 1 Read on SO: [25] http://goo.gl/obf2MG * Lax monoidal functors with a different monoidal structure votes: 14, answers: 3 Read on SO: [26] http://goo.gl/gR954y * Maximizing Haskell loop performance with GHC votes: 13, answers: 2 Read on SO: [27] http://goo.gl/TNaeB7 * What does it mean that the semantics (of Haskell) are affected by the inferred types (of return type polymorphism)? votes: 12, answers: 2 Read on SO: [28] http://goo.gl/e702Su * Write a parallel array Haskell expression once, run on CPUs & GPUs with repa and accelerate votes: 10, answers: 2 Read on SO: [29] http://goo.gl/gvSnV8 * Best way to save 10 GB vector to disk in Haskell votes: 9, answers: 3 Read on SO: [30] http://goo.gl/6SjJeG * What is the purpose of the `Typeable (* -> Constraint) Monoid` instance? votes: 9, answers: 1 Read on SO: [31] http://goo.gl/QeLSHm Until next time, [32]+Daniel Santa Cruz References 1. http://dev.stephendiehl.com/hask 2. http://www.reddit.com/r/haskell/comments/23srcm/what_i_wish_i_knew_when_lea… 3. http://blog.johantibell.com/2014/04/announcing-cabal-120.html 4. http://www.reddit.com/r/haskell/comments/23i6ih/announcing_cabal_120/ 5. http://ro-che.info/articles/2014-04-24-lens-unidiomatic.html 6. http://www.reddit.com/r/haskell/comments/23uzpg/lens_is_unidiomatic_haskell/ 7. http://www.serpentine.com/wreq/ 8. http://www.reddit.com/r/haskell/comments/23q8kc/wreq_a_capable_new_http_cli… 9. https://ghc.haskell.org/trac/ghc/browser/ghc/libraries/base/GHC/Base.lhs?re… 10. http://www.reddit.com/r/haskell/comments/23ob5a/applicative_became_a_superc… 11. http://cryptol.net/index.html 12. http://www.reddit.com/r/haskell/comments/23w3su/open_sourced_cryptol_a_doma… 13. http://www.haskellforall.com/2014/04/model-view-controller-haskell-style.ht… 14. http://www.reddit.com/r/haskell/comments/2407hs/modelviewcontroller_haskell… 15. http://www.reddit.com/r/haskell/comments/23x3f3/lenses_dont_compose_backwar… 16. http://www.reddit.com/r/haskell/comments/23x3f3/lenses_dont_compose_backwar… 17. http://www.google-melange.com/gsoc/projects/list/google/gsoc2014 18. http://www.reddit.com/r/haskell/comments/23mfwj/14_haskell_projects_accepte… 19. http://themonadreader.wordpress.com/2014/04/23/issue-23/ 20. http://www.reddit.com/r/haskell/comments/23u25r/new_issue_of_the_monad_read… 21. http://mth.io/talks/lens-from-the-ground-up/ 22. http://www.reddit.com/r/haskell/comments/23z5xb/lens_from_the_ground_up/ 23. http://duplode.github.io/posts/lenses-you-can-make-at-home.html 24. http://www.reddit.com/r/haskell/comments/241aec/lenses_you_can_make_at_home/ 25. http://stackoverflow.com/questions/23280936/how-do-experienced-haskell-deve… 26. http://stackoverflow.com/questions/23316255/lax-monoidal-functors-with-a-di… 27. http://stackoverflow.com/questions/23315001/maximizing-haskell-loop-perform… 28. http://stackoverflow.com/questions/23282921/what-does-it-mean-that-the-sema… 29. http://stackoverflow.com/questions/23202145/write-a-parallel-array-haskell-… 30. http://stackoverflow.com/questions/23247289/best-way-to-save-10-gb-vector-t… 31. http://stackoverflow.com/questions/23277838/what-is-the-purpose-of-the-type… 32. https://plus.google.com/105107667630152149014/about

1 0

Call for talk proposals: HOPE'14 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'14)
by Neelakantan Krishnaswami 30 Apr '14

30 Apr '14

---------------------------------------------------------------------- CALL FOR TALK PROPOSALS HOPE 2014 The 3rd ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 31, 2014 Gothenburg, Sweden (the day before ICFP 2014) https://www.mpi-sws.org/~neelk/hope2014/ ---------------------------------------------------------------------- HOPE 2014 aims at bringing 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. --------------------- 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 hope2014 AT mpi-sws.org. Deadline for talk proposals: June 13, 2014 (Friday) Notification of acceptance: July 4, 2014 (Friday) Workshop: August 31, 2014 (Sunday) The submission website is now open: https://www.easychair.org/conferences/?conf=hope2014 --------------------- Workshop Organization --------------------- Program Co-Chairs: Neel Krishnaswami (University of Birmingham) Hongseok Yang (University of Oxford) Program Committee: Zena Ariola (University of Oregon) Ohad Kammar (University of Cambridge) Ioannis Kassios (ETH Zurich) Naoki Kobayashi (University of Tokyo) Paul Blain Levy (University of Birmingham) Aleks Nanevski (IMDEA) Scott Owens (University of Kent) Sam Staton (Radboud University Nijmegen) Steve Zdancewic (University of Pennsylvania)

1 0

ANNOUNCE (2nd call): Applied Functional Programming (AFP) Summerschool 7-18 July 2014, Utrecht, Netherlands
by Atze Dijkstra 28 Apr '14

28 Apr '14

Dear all, we bring the following announcement to your attention a 2nd time as the registration deadline (may 5) approaches. thank you, regards, Atze Dijkstra =========== AFP Summerschool 2014 =========== Applied Functional Programming (AFP) Summerschool July 7-18, 2014 Utrecht University, Department of Information and Computing Sciences Utrecht, The Netherlands Summerschool & registration website: http://www.utrechtsummerschool.nl/courses/science/applied-functional-progra… AFP website with edition 2013 info : http://www.cs.uu.nl/wiki/USCS contact : Uscs-afp(a)lists.science.uu.nl *** The 2014 edition of the Applied Functional Programming (AFP) Summerschool in Utrecht, Netherlands will be held from 7-18 July 2014. The summerschool teaches Haskell on both beginners and advanced levels via lectures and lab exercises. More info can be found via the references above, included here is an excerpt from the summerschool website: ``Typed functional programming in Haskell allows for the development of compact programs in minimal time and with maximal guarantees about robustness and correctness. The course introduces Haskell as well as its theoretical underpinnings such as typed lambda calculus, and Damas-Milner type inference. There is ample opportunity to put this all in practice during lab sessions. Typed functional programming languages allow for the development of robust, concise programs in a short amount of time. The key advantages are higher-order functions as an abstraction mechanism, and an advanced type system for safety and reusability. This course introduces Haskell, a state-of-the-art functional programming language, together with some of its theoretical background, such as typed lambda calculi, referential transparency, Damas-Milner type inference, type level programming, and functional design patterns. We will combine this with applications of functional programming, concentrating on topics such as language processing, building graphical user interfaces, networking, databases, and programming for the web. The goal of the course is not just to teach the programming language and underlying theory, but also to learn about the Haskell community and to get hands-on experience by doing lab exercises or a Haskell project of your own.'' *** regards, - Atze - Atze Dijkstra, Department of Information and Computing Sciences. /|\ Utrecht University, PO Box 80089, 3508 TB Utrecht, Netherlands. / | \ Tel.: +31-30-2534118/1454 | WWW : http://www.cs.uu.nl/~atze . /--| \ Fax : +31-30-2513971 .... | Email: atze(a)uu.nl ............... / |___\

2 1

ANNOUNCE: fgl-5.5.0.0
by Ivan Lazar Miljenovic 27 Apr '14

27 Apr '14

I'm pleased to announce a new version of the functional graph library: http://hackage.haskell.org/package/fgl-5.5.0.0 The main change in this version: proper Show, Read and Eq instances for both graph implementations. Previously, Data.Graph.Inductive.Tree had a pretty-printed Show output; now both it and PatriciaTree have Show and Read instances via the mkGraph function, and Eq via deriving (I'm not sure how well this will work because as I write this I realise it may not deal with multiple edges that well... I guess I'll be doing an updated version tomorrow after getting some sleep ;p). The previous Show behaviour of Tree is now available as a pretty-printing function for all DynGraph instances. The PatriciaTree implementation is now exported and used by default, because as far as I'm aware it will always perform better. Finally, the Data.Graph.Inductive.Graphviz module has been removed; if you want to visualise your fgl graph, please see my graphviz package on Hackage (cheap plug? moi?). -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com http://IvanMiljenovic.wordpress.com

1 0

Postdoctoral position in probabilistic programming languages
by nr＠cs.tufts.edu 26 Apr '14

26 Apr '14

There is a postdoc opening in my group for work on probabilistic programming languages. Connections with Haskell are strong, and several members of our team are building prototypes in Haskell. I'd welcome applications from scientists with skills or interests in Haskell. Norman Ramsey Postdoctoral position in probabilistic programming languages ============================================================ There is a postdoc open at Tufts University, supported by the project > Probabilistic Programming for Advanced Machine Learning (PPAML) The PPAML project will empower practitioners and researchers in machine learning by creating vastly improved language technology for probabilistic programming. This postdoc provides an opportunity to think deeply about probabilistic modeling and inference and to realize those thoughts in new language designs and (prototype) implementations. Our team is focused on these aspects: - The design of novel languages, especially intermediate languages, for expressing and analyzing probabilistic computations - The development of type systems and other program analyses that will support *efficient* inference over probabilistic models - Languages and language extensions that can formalize and express *intensional* properties that may enable a probabilistic programming system to affect the performance or accuracy of inference and learning The goal is to develop new designs, type systems, and analyses that will not only inform and contribute to the team's research software, but that will of sufficient scope, power, and quality to be publishable in such venues as POPL, PLDI, OOPSLA, and ICFP. Who we are ---------- The research will be supervised at Tufts by Professor Norman Ramsey. The larger team includes senior faculty Mitch Wand and Olin Shivers from Northeastern University, as well as senior colleagues in both programming languages and machine learning at nearby BAE Systems in Burlington. The research will be carried out on the Tufts campus, located near Davis Square in Somerville, Massachusetts, USA, a short distance from Boston. What we're looking for ---------------------- We're looking for a recent PhD (or someone about to graduate) who is committed to the idea of programming languages as a way to express knowledge and solve problems. In addition, - We're looking for someone with a track record of creating interesting and effective software. - We're looking for someone with strong background in at least *one* domain area relating to the project: probability, probabilistic programming, language design, language implementation, type systems, static analysis, measure theory, domain theory, topology, real analysis, or probabilistic inference. - We believe that ideas and software are best developed in tandem. We're therefore looking for someone who will contribute both to the development of the team's software and to the development and publication of new ideas. When and for how long the position can be held ---------------------------------------------- The initial appointment will be for one year, but given mutual agreement, it is expected to be renewed annually for a total of three years. (Support is available through July 2017.) Other mutually agreed arrangements are possible. Salary is competitive. The starting date is negotiable, but if other things are equal, we may extend an offer to the candidate who is available sooner rather than later. What support and benefits are available --------------------------------------- Tufts University is committed to helping postdoctoral scholars gain the skills necessary to become independent researchers. This commitment includes access to resources for personal and professional development. Tufts postdocs are full-time employees of Tufts University and are eligible for benefits, including health and retirement benefits. How and when to apply --------------------- Interested candidates should apply at https://academicjobsonline.org/ajo/jobs/3983 An application should include - A cover letter explaining your interest in the position - Your curriculum vitae - A paper representative of your published work - The names of three people who can, if asked, write letters of reference There is no deadline for applications; we will look at applications as soon as they come in, and we will keep looking until we fill the position. Whom to ask questions --------------------- If you have questions about the project or whether it is a good fit for your interests, please write to Norman Ramsey <nr(a)cs.tufts.edu>.

1 0