- Haskell - Haskell.org

ANNOUNCE: GHC version 7.8.2
by Austin Seipp 12 Apr '14

12 Apr '14

============================================================== The (Interactive) Glasgow Haskell Compiler -- version 7.8.2 ============================================================== The GHC Team is pleased to announce a new patchlevel release of GHC, 7.8.2. This is an important bugfix release relative to 7.8.1, so we highly recommend upgrading from 7.8.1. The full release notes are here: https://www.haskell.org/ghc/docs/7.8.2/html/users_guide/release-7-8-2.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: https://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://ghc.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://ghc.haskell.org/trac/ghc/wiki/Platforms http://ghc.haskell.org/trac/ghc/wiki/CodeOwners Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://ghc.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://ghc.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug Hashes & Signatures ~~~~~~~~~~~~~~~~~ Included in this email is a signed copy of the SHA256 hashes for the tarballs, using my GPG key (keyid 0x3B58D86F). -- Regards, Austin Seipp, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

1 0

PPDP 2014: Call for Papers
by Jacob Johannsen 11 Apr '14

11 Apr '14

====================================================================== 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). 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

RV 2014, Deadlines extended: abstract April 18, full paper April 25
by Runtime Verification 10 Apr '14

10 Apr '14

[DEADLINES EXTENDED] [Apologizes for duplicates] 14th International Conference on Runtime Verification September 22 - 25, 2014 *Toronto, Canada* http://rv2014.imag.fr/ <http://rv2014.imag.fr/images/CfP.pdf> Scope: Runtime verification is concerned with monitoring and analysis of software and hardware system executions. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they are significantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include: - specification languages - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - fault detection, localization, containment, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization - monitoring techniques for safety/mission-critical systems - monitoring distributed systems, cloud services, and big data applications - monitoring security and privacy policies Application areas of runtime verification include safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. Technical Research Papers Track: Technical research papers can be submitted in two categories: regular and short papers. Papers in both categories will be reviewed by the conference Program Committee. All accepted technical papers will appear in an LNCS<http://www.springer.com/series/558> volume. Submitted papers must use the LNCS style<http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>. At least one author of each accepted paper must attend RV'14 to present the paper. Papers must be submitted electronically using the EasyChair<https://www.easychair.org/conferences/?conf=rv2014> system. - *Regular papers* (up to 15 pages) should present original unpublished results. Theoretical and experimental papers as well as papers on applications of runtime verification and case studies are all welcome. A non-monetary Best Paper Award will be given. A selection of accepted regular papers will be invited to appear in a special issue of the Springer Journal on Formal Methods in System Design. - *Short papers* (up to 5 pages) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. Accepted short papers will be presented in special short talk (10 minutes) and poster sessions. Program committee Borzoo Bonakdarpour <https://cs.uwaterloo.ca/~bbonakda/> (University of Waterloo, Canada), *co-chair* Scott Smolka <http://www.cs.sunysb.edu/~sas/> (Stony Brook Universtiy, USA), *co-chair* Gul Agha <http://cs.illinois.edu/directory/profile/agha> (University of Illinois at Urbana-Champaign, USA) Thomas Ball <http://research.microsoft.com/en-us/people/tball/> (Microsoft Research, Redmond, USA) Howard Barringer <http://www.manchester.ac.uk/research/howard.barringer> (The University of Manchester, UK) Ezio Bartocci <http://www.eziobartocci.com/> (TU Wien, Austria) David Basin <http://www.inf.ethz.ch/personal/basin/> (ETH Zurich, Switzerland) Saddek Bensalem <http://www-verimag.imag.fr/~bensalem/> (Verimag, France) Ivona Brandic <http://www.infosys.tuwien.ac.at/staff/ivona/> (TU Wien, Austria) Marsha Chechik <http://www.cs.toronto.edu/~chechik/> (University of Toronto, Canada) Michael Clarkson <http://faculty.cs.gwu.edu/~clarkson/> (George Washington University, USA) Laura Dillon <http://www.cse.msu.edu/~ldillon/> (Michigan State University, USA) Shlomi Dolev <http://www.cs.bgu.ac.il/~dolev/> (Ben Gurion University, Israel) Alastair Donaldson <http://www.doc.ic.ac.uk/~afd/> (Imperial College London, UK) Dawson Engler <http://www.stanford.edu/~engler/> (Stanford University, USA) Ylies Falcone <http://www.ylies.fr/> (Université Joseph Fourier, France) Vijay Garg <http://users.ece.utexas.edu/~garg/> (University of Texas at Austin, USA) Steve Goddard <http://cse.unl.edu/~goddard/papers.html> (University of Nebraska-Lincoln, USA) Ganesh Gopalakrishnan <http://www.cs.utah.edu/~ganesh/> (University of Utah, USA) Wolfgang Grieskamp (Google, USA) Radu Grosu <http://www.cs.sunysb.edu/~grosu/> (TU- Wien, Austria) Klaus Havelund <http://www.havelund.com/> (NASA/JPL, USA) Mats Heimdahl <http://www.umsec.umn.edu/about/director> (University of Minnesota, USA) Laurie Hendren <http://www.sable.mcgill.ca/~hendren/> (McGill University, Canada) Gerard Holzmann <http://lars-lab.jpl.nasa.gov/people/gh.html> (NASA/JPL, USA) Daniel Keren <http://www.cs.haifa.ac.il/~dkeren/> (Haifa University, Israel) Sandeep Kulkarni <http://www.cse.msu.edu/~sandeep/>(Michigan State University, USA) Marta Kwiatkowska <http://www.cs.ox.ac.uk/marta.kwiatkowska/> (University of Oxford, UK) Insup Lee <http://www.cis.upenn.edu/~lee/home/home/index.shtml> (University of Pennsylvania, USA) Axel Legay <http://people.irisa.fr/Axel.Legay/> (IRISA/INRIA, France) Martin Leucker <http://www.isp.uni-luebeck.de/leucker/> (University of Lübeck, Germany) Leonardo Mariani<http://www.lta.disco.unimib.it/lta/personalPages/leonardoMariani/leonardoMa…> (University of Milano Bicocca, Italy) Patrick Meredith <http://fsl.cs.illinois.edu/index.php/Patrick_Meredith> (University of Illinois at Urbana-Champaign, USA) David Naumann <http://www.cs.stevens.edu/~naumann/> (Stevens Institute of Technology, USA) Doron Peled <http://u.cs.biu.ac.il/~doronp/> (Bar Ilan University, Israel) Mauro Pezze <http://www.inf.usi.ch/personal-info?id=1187> (University of Lugano, Switzerland) Lee Pike <http://www.cs.indiana.edu/~lepike/> (Galois Inc., USA) Zvonimir Rakamaric <http://www.zvonimir.info/> (University of Utah, USA) Grigore Rosu <http://fsl.cs.illinois.edu/index.php/Grigore_Rosu> (University of Illinois at Urbana-Champaign, USA) Andrey Rybalchenko <http://www7.in.tum.de/~rybal/> (TU-Munich, Germany) Andre Schiper <http://people.epfl.ch/andre.schiper?lang=fr> (EPFL, Switzerland) Oleg Sokolsky <http://www.cis.upenn.edu/~sokolsky/> (University of Pennsylvania, USA) Scott Stoller <http://www.cs.sunysb.edu/~stoller/> (Stony Brook University, USA) Serdar Tasiran <http://home.ku.edu.tr/~stasiran/> (Koc University, Turkey) Michael Whalen <http://www.umsec.umn.edu/directory/Michael-Whalen> (University of Minnesota, USA) Lenore Zuck <http://www.cs.uic.edu/~lenore/> (University of Illinois at Chicago, USA) Tool Demonstrations Track: The aim of the RV 2014 tool demonstration track is to provide an opportunity for researchers and practitioners to show and to discuss the latest advances, experiences and challenges in devising and developing reliable software tools for runtime verification. Tool demonstration papers will be reviewed by the Tools Track Program Committee. All accepted tool demonstration papers will appear in the conference proceedings LNCS volume. Submitted papers must use the LNCS style. At least one author of each accepted paper must attend RV'14 to present the paper. Papers must be submitted electronically using the EasyChair<https://www.easychair.org/conferences/?conf=rv2014> system. Tool papers should meet the following criteria: - A tool paper should present a new tool, a new tool component or novel extensions to existing tools supporting runtime verification. Each submission should be original and not published previously in a tool paper form. - Each submission must not exceed 8 pages in the LNCS/Springer proceeding format, including all text, references and figures. The paper must be written in English and provided in PDF format. - Each submission must be accompanied at the time of the submission by a short screencast (between 5-10 minutes), with voice and overlay text commentary illustrating the demonstration of the tool (a link to it should be provided in the paper). - The paper must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. - Each tool paper must include a script in an appendix (not included in the page count) describing how the demo will be conducted during the conference presentation with screenshots presenting step-by-step the tool's capabilities, highlighting the main characteristics and the usage. Evaluation Each submission will be reviewed by at least four members of the tool demonstration track program committee. The evaluation criteria will include: - the presentation quality - the availability (possibly in a open-source format) of the software. - the relevance for the Runtime Verification audience - the technical soundness of the presented tool - the originality of the underlying ideas Tool Demonstration Committee Ezio Bartocci, (TU-Vienna, Austria), *chair* Alastair Donaldson (Imperial College London, UK) Dawson Engler (Stanford University, USA) Yliès Falcone (Université Joseph Fourier, France) Klaus Havelund (NASA/JPL, USA) Michael Whalen (University of Minnesota, USA) Important Dates: Both research papers and tool demonstration tracks will follow the following timeline: - *Abstract deadline:* April 18, 2014 (extended) - *Full paper deadline:* April 25, 2014 (extended) - *Rebuttal phase:* May 18-20, 2014 - *Acceptance notification:* June 10, 2014 - *Camera ready submission:* June 25, 2014 - *Conference dates:* 22-25 September, 2014

1 0

Haskell Weekly News: Issue 290
by Daniel Santa Cruz 10 Apr '14

10 Apr '14

Welcome to issue 289 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from April 1 to 5, 2014 Quotes of the Week * edwardk: Zombies are expensive. Top Reddit Stories * foldl is broken! Domain: well-typed.com, Score: 148, Comments: 63 On Reddit: [1] http://goo.gl/LXmJTV Original: [2] http://goo.gl/viOG5O * A small Haskell extension Domain: augustss.blogspot.nl, Score: 76, Comments: 23 On Reddit: [3] http://goo.gl/buI46t Original: [4] http://goo.gl/LnAV9y * New GHC Features for 7.10.1 and Beyond Domain: haskell.org, Score: 74, Comments: 26 On Reddit: [5] http://goo.gl/DdXTfO Original: [6] http://goo.gl/g0FPBS * Libc considered harmful Domain: sylvain-henry.info, Score: 58, Comments: 28 On Reddit: [7] http://goo.gl/aq39Mf Original: [8] http://goo.gl/qdQDXm * Category Theory by Tom LaGatta Domain: youtube.com, Score: 58, Comments: 53 On Reddit: [9] http://goo.gl/oIzG1e Original: [10] http://goo.gl/DeLu5G * Idris 0.9.12 released with major laziness, codata, and documentation updates plus metavars in types Domain: idris-lang.org, Score: 55, Comments: 25 On Reddit: [11] http://goo.gl/4MtXJS Original: [12] http://goo.gl/3tXbqC * A cool paper I found on "Functional Programming and 3D Games". It discusses everything from collision detection to physics and texturing. [PDF] Domain: cse.unsw.edu.au, Score: 52, Comments: 3 On Reddit: [13] http://goo.gl/6PYB2e Original: [14] http://goo.gl/Tf6fa2 * Error reporting with locations Domain: augustss.blogspot.fr, Score: 47, Comments: 28 On Reddit: [15] http://goo.gl/ikaENm Original: [16] http://goo.gl/hntlJT * [ANN] Haste now has a website and a mailing list Domain: haste-lang.org, Score: 42, Comments: 7 On Reddit: [17] http://goo.gl/Ife2FA Original: [18] http://goo.gl/lRWmhv * Haskell in the Newsroom Domain: infoq.com, Score: 41, Comments: 5 On Reddit: [19] http://goo.gl/M4tehD Original: [20] http://goo.gl/bpvgLA * Haskell application architecture best practices Domain: self.haskell, Score: 32, Comments: 23 On Reddit: [21] http://goo.gl/XjHfNJ Original: [22] http://goo.gl/XjHfNJ Top StackOverflow Questions * Haskell - Is it possible to make pointfree functions more readable using different combinators than (.)? votes: 11, answers: 1 Read on SO: [23] http://goo.gl/5b036l * How to detect if a program has been compiled using -threaded? votes: 10, answers: 2 Read on SO: [24] http://goo.gl/Cr7pMA * What does the star mean in this haskell code? votes: 9, answers: 2 Read on SO: [25] http://goo.gl/qnolS7 * What about arrows? votes: 9, answers: 2 Read on SO: [26] http://goo.gl/b1wwp4 * Triggering a documentation update for a Hackage package votes: 8, answers: 1 Read on SO: [27] http://goo.gl/ErTVzf * Combining Data.Dynamic and type classes votes: 7, answers: 0 Read on SO: [28] http://goo.gl/n8qMo9 * Systematically applying a function to all fields of a haskell record votes: 6, answers: 3 Read on SO: [29] http://goo.gl/tNkLGu * Transforming a List of 2-Tuples in Haskell votes: 6, answers: 3 Read on SO: [30] http://goo.gl/dDe8QP * Error in ghci which I cannot reproduce in written haskell file votes: 6, answers: 1 Read on SO: [31] http://goo.gl/bg8DCw * Why can I call a monadic function without supplying a monad? votes: 6, answers: 1 Read on SO: [32] http://goo.gl/xZZ5iO * Deriving default instances using GHC.Generics votes: 6, answers: 1 Read on SO: [33] http://goo.gl/Autu6r Until next time, [34]+Daniel Santa Cruz References 1. http://www.well-typed.com/blog/90/ 2. http://www.reddit.com/r/haskell/comments/21wvk7/foldl_is_broken/ 3. http://augustss.blogspot.nl/2014/04/a-small-haskell-extension.html 4. http://www.reddit.com/r/haskell/comments/2239wh/a_small_haskell_extension/ 5. http://www.haskell.org/pipermail/haskell-cafe/2014-April/113373.html 6. http://www.reddit.com/r/haskell/comments/21wbme/new_ghc_features_for_7101_a… 7. http://sylvain-henry.info/blog/posts/2014-04-01-libc-considered-harmful.html 8. http://www.reddit.com/r/haskell/comments/220ae4/libc_considered_harmful/ 9. https://www.youtube.com/watch?v=o6L6XeNdd_k 10. http://www.reddit.com/r/haskell/comments/229scs/category_theory_by_tom_laga… 11. http://www.idris-lang.org/idris-0-9-12-released/ 12. http://www.reddit.com/r/haskell/comments/2284s5/idris_0912_released_with_ma… 13. http://www.cse.unsw.edu.au/~pls/thesis/munc-thesis.pdf 14. http://www.reddit.com/r/haskell/comments/21zush/a_cool_paper_i_found_on_fun… 15. http://augustss.blogspot.fr/2014/04/haskell-error-reporting-with-locations.… 16. http://www.reddit.com/r/haskell/comments/226otd/error_reporting_with_locati… 17. http://haste-lang.org/ 18. http://www.reddit.com/r/haskell/comments/21x4wm/ann_haste_now_has_a_website… 19. http://www.infoq.com/presentations/haskell-newsroom-nyt 20. http://www.reddit.com/r/haskell/comments/222i82/haskell_in_the_newsroom/ 21. http://www.reddit.com/r/haskell/comments/223i80/haskell_application_archite… 22. http://www.reddit.com/r/haskell/comments/223i80/haskell_application_archite… 23. http://stackoverflow.com/questions/22872098/haskell-is-it-possible-to-make-… 24. http://stackoverflow.com/questions/22839824/how-to-detect-if-a-program-has-… 25. http://stackoverflow.com/questions/22807728/what-does-the-star-mean-in-this… 26. http://stackoverflow.com/questions/22871648/what-about-arrows 27. http://stackoverflow.com/questions/22783637/triggering-a-documentation-upda… 28. http://stackoverflow.com/questions/22876370/combining-data-dynamic-and-type… 29. http://stackoverflow.com/questions/22807619/systematically-applying-a-funct… 30. http://stackoverflow.com/questions/22828259/transforming-a-list-of-2-tuples… 31. http://stackoverflow.com/questions/22839784/error-in-ghci-which-i-cannot-re… 32. http://stackoverflow.com/questions/22841899/why-can-i-call-a-monadic-functi… 33. http://stackoverflow.com/questions/22850983/deriving-default-instances-usin… 34. https://plus.google.com/105107667630152149014/about

1 0

ANNOUNCE: GHC version 7.8.1
by Austin Seipp 09 Apr '14

09 Apr '14

============================================================== The (Interactive) Glasgow Haskell Compiler -- version 7.8.1 ============================================================== The GHC Team is pleased to announce a new major release of GHC. There have been a number of significant changes since the last major release, including: * New type-system features * Closed type families * Role checking * An improved solver for type naturals * Better support for cross compilation * Full iOS support * Massive scalability improvements to the I/O manager * Dynamic linking for GHCi * Several language improvements * Pattern synonyms * Overloaded list syntax * Kind-polymorphic 'Typeable' class * A new parallel --make mode * Preliminary SIMD intrinsic support * A brand-new low level code generator * Many bugfixes and other performance improvements. The full release notes are here: http://haskell.org/ghc/docs/7.8.1/html/users_guide/release-7-8-1.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://ghc.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://ghc.haskell.org/trac/ghc/wiki/TeamGHC Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://ghc.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://ghc.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug Hashes & Signatures ~~~~~~~~~~~~~~~~~ Included in this email is a signed copy of the SHA256 hashes for the tarballs, using my GPG key (keyid 0x3B58D86F). -- Regards, Austin Seipp, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

1 1

Call for papers: The 20th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2014)
by Yuan-Fang Li 09 Apr '14

09 Apr '14

*** Apologies for cross-posting *** *Call for Papers: The 20th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2014)* *Singapore Nov 18-21, 2014 * PRDC 2014 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 Submission deadline: May 2, 2014 Notification: June 25, 2014 Best regards Yuan-Fang

1 0

Oregon PL Summer School: call for participation
by Amal Ahmed 07 Apr '14

07 Apr '14

This year's Oregon Programming Languages Summer School will take place from June 16th to 28th, 2014. The registration deadline is April 14th. Full information on registration and scholarships an be found here: http://www.cs.uoregon.edu/Activities/summerschool The school has a long and successful tradition (sponsored by the NSF, ACM SIGPLAN, and industry). It covers current research in the theory and practice of programming languages. Material is presented at a tutorial level that will help graduate students and researchers from academia or industry understand the critical issues and open problems confronting the field. Prerequisites are an elementary knowledge of logic and mathematics, as covered in undergraduate classes on discrete mathematics, and some knowledge of programming languages at the level of an undergraduate survey course. This year we will again offer a Coq boot camp session, to be held on June 15th -- one day before the summer school officially begins. The boot camp will provide a one-day, intensive, hands-on introduction to the practical mechanics of the Coq proof assistant. The Coq boot camp will be run by Michael Clarkson (George Washington University). More information is available at the above website. This year's program is titled Types, Logic, Semantics, and Verification. The speakers and topics include: Andrew Appel -- Software Verification Princeton University Lars Birkedal -- Category Theory Aarhus University Derek Dreyer -- Modular Reasoning about Stateful Programs Max Planck Institute for Software Systems Robert Harper -- Type Theory Foundations Carnegie Mellon University Greg Morrisett -- Certified Programming and State Harvard University Ulf Norell -- Programming in Agda Chalmers University of Technology Brigitte Pientka -- Proof Theory Foundations McGill University Stephanie Weirich -- Designing Dependently-Typed Programming Languages University of Pennsylvania Steve Zdancewic -- Software Foundations in Coq University of Pennsylvania We hope you can join us for this excellent program! Amal Ahmed Zena Ariola Greg Morrisett OPLSS 2014 organizers

1 0

ANN: Budapest Hackathon 2014
by Csaba Hruska 07 Apr '14

07 Apr '14

Dear Haskellers, We're organizing the first ever Haskell Hackathon in Budapest, Hungary. When: Saturday 31 May 2014 - Sunday 1 June 2014 This will be a great opportunity to meet up with fellow Haskellers, and show off your cool hobby projects in one of the most vibrant cities in Europe. There's also room for working on existing tools, for example you can team up with Luite Stegeman at the event to hack on GHC-JS. Details about the when, where and how: http://www.haskell.org/haskellwiki/BudapestHackathon2014 See you all there!

1 0

Second CFP: Higher-order, Typed, Inferred, Strict: ML Family Workshop
by oleg＠okmij.org 07 Apr '14

07 Apr '14

Higher-order, Typed, Inferred, Strict: ACM SIGPLAN ML Family Workshop Thursday September 4, 2014, Gothenburg, Sweden (immediately following ICFP and preceding OCaml Users and Developers Workshop) Call For Papers http://okmij.org/ftp/ML/ML14.html News: Post-proceedings will be published in EPTCS ML is a very large family of programming languages that includes Standard ML, OCaml, F#, SML#, Manticore, MetaOCaml, JoCaml, Alice ML, Dependent ML, Flow Caml, and many others. All ML languages, beside the great deal of syntax, share several fundamental traits. They are all higher-order, strict, mostly pure, and typed, with algebraic and other data types. Their type systems inherit from Hindley-Milner. The development of these languages has inspired a significant amount of computer science research and influenced a number of programming languages, including Haskell, Scala and Clojure, as well as Rust, ATS and many others. ML workshops have been held in affiliation with ICFP continuously since 2005. This workshop specifically aims to recognize the entire extended ML family and to provide the forum to present and discuss common issues, both practical (compilation techniques, implementations of concurrency and parallelism, programming for the Web) and theoretical (fancy types, module systems, metaprogramming). The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of the members of the ML family. We also encourage presentations from related languages (such as Scala, Rust, Nemerle, ATS, etc.), to exchange experience of further developing ML ideas. The ML family workshop will be held in close coordination with the OCaml Users and Developers Workshop. Format Since 2010, the ML workshop has adopted an informal model. Presentations are selected from submitted abstracts. There are no published proceedings, so any contributions may be submitted for publication elsewhere. We hope that this format encourages the presentation of exciting (if unpolished) research and deliver a lively workshop atmosphere. Each presentation should take 20-25 minutes, except demos, which should take 10-15 minutes. The exact time will be decided based on the number of accepted submissions. The presentations will likely be recorded. Post-conference proceedings The post-proceedings of selected papers from the ML Family and the OCaml Users and Developers workshops will be published in the Electronic Proceedings in Theoretical Computer Science (EPTCS). The Program Committee shall invite interested authors of selected presentations to expand their abstract for inclusion in the proceedings. The submissions are to be reviewed according to the EPTCS standards. Coordination with the OCaml Users and Developers Workshop The OCaml workshop is seen as more practical and is dedicated in significant part to the OCaml community building and the evolution of the OCaml system. In contrast, the ML family workshop is not focused on any language in particular, is more research oriented, and deals with general issues of the ML-style programming and type systems. Yet there is an overlap, which we are keen to explore in various ways. The authors who feel their submission fits both workshops are encouraged to mention it at submission time or contact the Program Chairs. Scope We acknowledge the whole breadth of the ML family and aim to include languages that are closely related (although not by blood), such as Rust, ATS, Scala, Typed Clojure. Those languages have implemented and investigated run-time and type system choices that may be worth considering for OCaml, F# and other ML languages. We also hope that the exposure to the state of the art ML might favorably influence those related languages. Specifically, we seek research presentations on topics including but not limited to * Design: concurrency, distribution and mobility, programming for the web and embedded systems, handling semi-structured data, facilitating interactive programming, higher forms of polymorphism, generic programming, objects * Implementation: compilation techniques, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * Type systems: fancy types, inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * Applications: case studies, experience reports, pearls, etc. * Environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * Education: ML and ML-like languages in college or high-school, in general or computer science curriculum. Four kinds of submissions will be accepted: Informed Positions, Research Presentations, Experience Reports and Demos. * Informed Positions: A justified argument for or against a language feature. The argument must be substantiated, either theoretically (e.g., by a demonstration of (un)soundness, an inference algorithm, a complexity analysis), empirically or by a substantial experience. Personal experience is accepted as justification so long as it is extensive and illustrated with concrete examples. * Research Presentations: Research presentations should describe new ideas, experimental results, or significant advances in ML-related projects. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. These presentations should be structured in a way which can be, at least in part, of interest to (advanced) users. * Experience Reports: Users are invited to submit Experience Reports about their use of ML and related languages. These presentations do not need to contain original research but they should tell an interesting story to researchers or other advanced users, such as an innovative or unexpected use of advanced features or a description of the challenges they are facing or attempting to solve. * Demos: Live demonstrations or short tutorials should show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or applications built on or related to ML. (You will need to provide all the hardware and software required for your demo; the workshop organizers are only able to provide a projector.) Important dates Monday May 19 (any time zone): Abstract submission Monday June 30: Author notification Thursday September 4, 2014: ML Family Workshop Submission Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. A submission should have a synopsis (2-3 lines) and a body between 1 and 2 pages, in one- or two-column layout. The synopsis should be suitable for inclusion in the workshop program. Submissions must be uploaded to the workshop submission website before the submission deadline (Monday May 19, 2014). For any question concerning the scope of the workshop or the submission process, please contact the program chair. Program Committee Kenichi Asai Ochanomizu University, Japan Matthew Fluet Rochester Institute of Technology, USA Jacques Garrigue Nagoya University, Japan Dave Herman Mozilla, USA Stefan Holdermans Vector Fabrics, Netherlands Oleg Kiselyov (Chair) Monterey, CA, USA Keiko Nakata Tallinn University of Technology, Estonia Didier Remy INRIA Paris-Rocquencourt, France Zhong Shao Yale University, USA Hongwei Xi Boston University, USA

1 0

Call for Contributions - Haskell Communities and Activities Report, May 2014 edition
by Mihai Maruseac 05 Apr '14

05 Apr '14

Dear all, I would like to collect contributions for the 24th edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 May 2014 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough --- please reconsider and submit an entry anyway! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the previous edition --- you will find interesting projects described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Mihai Maruseac and Alejandro Serrano Mena (current co-editors) FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/05-2013/template.tex There is also a LaTeX style file at http://haskell.org/communities/05-2013/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should already have received your old entry as a template (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include Haskell code? A: Yes. Please use lhs2tex syntax (http://people.cs.uu.nl/andres/lhs2tex/) The report is compiled in mode polycode.fmt. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: Should I send files in .zip archives or similar? A: No, plain file attachements are the way. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or "historic" overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep up entries. There is no minimum length of an entry! The report aims for being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will typically be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them. Q: Will I get confirmation if I send an entry? How do I know whether my email has even reached the editor, and not ended up in a spam folder? A: Prior to publication of the final report, the editor will send a draft to all contributors, for possible corrections. So if you do not hear from the editor within two weeks after the deadline, it is safer to send another mail and check whether your first one was received. -- Mihai Maruseac (MM) "If you don't know, the thing to do is not to get scared, but to learn." -- Atlas Shrugged.

1 0