November 2017 - Haskell

[ANNOUNCE] GHC 8.2.2 released
by Ben Gamari 29 Nov '17

29 Nov '17

Editorial note: This was released last week but the announcement never made it to haskell(a)haskell.org =============================================== The Glasgow Haskell Compiler -- version 8.2.2 =============================================== The GHC Team is pleased to announce a new minor release of GHC. This release builds on the performance and stability improvements of 8.2.1, fixing a variety of correctness bugs, improving error messages, and making the compiler more portable. Notable bug-fixes include * A correctness issue resulting in segmentation faults in some FFI-users (#13707, #14346) * A correctness issue resulting in undefined behavior in some programs using STM (#14171) * A bug which may have manifested in segmentation faults in out-of-memory condition (#14329) * clearBit of Natural no longer bottoms (#13203) * A specialisation bug resulting in exponential blowup of compilation time in some specialisation-intensive programs (#14379) * ghc-pkg now works even in environments with misconfigured NFS mounts (#13945) * GHC again supports production of position-independent executables (#13702) * Better error messages around kind mismatches (#11198, #12373, #13530, #13610) A thorough list of the changes in the release can be found in the release notes, https://haskell.org/ghc/docs/8.2.2/html/users_guide/release-8-2-2.html How to get it ~~~~~~~~~~~~~ This release can be downloaded from https://www.haskell.org/ghc/download_ghc_8_2_2.html For older versions see 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. Background ~~~~~~~~~~ Haskell is a standardized lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating efficient 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. 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 https://www.haskell.org/ghc/ GHC developers' home page https://ghc.haskell.org/trac/ghc/ Haskell home page https://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: https://ghc.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: https://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: https://ghc.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at https://mail.haskell.org/cgi-bin/mailman/listinfo/glasgow-haskell-users https://mail.haskell.org/cgi-bin/mailman/listinfo/ghc-tickets There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see https://mail.haskell.org/cgi-bin/mailman/listinfo Many GHC developers hang out on #haskell on IRC: https://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: https://www.haskell.org/ghc/reportabug

1 0

PEPM 2018 Call for Poster/Demo Abstracts and Participation
by PEPM Workshop 23 Nov '17

23 Nov '17

-- Call for Poster/Demo Abstracts and Participation -- ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) 2018 =============================================================================== * Website : http://popl18.sigplan.org/track/PEPM-2018 * Time : 8th – 9th January 2018 * Place : Los Angeles, CA, US (co-located with POPL 2018) POSTER/DEMO SESSIONS: PEPM 2018 is accepting proposals for poster/demo presentations on a rolling basis, until 8th December (AoE). See below for the submission guidelines. Registration ------------ * Web page : https://popl18.sigplan.org/attending/Registration * Early registration deadline : 10th December 2017 Invited speakers ---------------- Alex Aiken (Stanford University) Conal Elliott (Target) Jan Midtgaard (University of Southern Denmark) Accepted papers --------------- * https://popl18.sigplan.org/track/PEPM-2018#event-overview A Guess-and-Assume Approach to Loop Fusion for Program Verification Akifumi Imanishi, Kohei Suenaga, and Atsushi Igarashi Checking Cryptographic API Usage with Composable Annotations (Short Paper) Duncan Mitchell, L. Thomas van Binsbergen, Blake Loring, and Johannes Kinder Gradually Typed Symbolic Expressions David Broman and Jeremy G. Siek On the Cost of Type-Tag Soundness Ben Greenman and Zeina migeed Partially Static Data as Free Extension of Algebras (Short Paper) Jeremy Yallop, Tamara von Glehn, and Ohad Kammar Program Generation for ML Modules (Short Paper) Takahisa Watanabe and Yukiyoshi Kameyama Recursive Programs in Normal Form (Short Paper) Barry Jay Selective CPS Transformation for Shift and Reset Kenichi Asai and Chihiro Uehara Poster/demo abstract submission guideline ----------------------------------------- * https://popl18.sigplan.org/track/PEPM-2018#Call-for-Poster-Demo-Abstracts To maintain PEPM’s dynamic and interactive nature, PEPM 2018 will continue to have special sessions for poster/demo presentations. In addition to the main interactive poster/demo session, there will also be a scheduled short-talk session where each poster/demo can be advertised to the audience in, say, 5–10 minutes. Poster/demo abstracts should describe work relevant to PEPM (whose scope is detailed below), typeset as a one-page PDF using the two-column ‘sigplan’ sub-format of the new ‘acmart’ format available at: http://sigplan.org/Resources/Author/ and sent by email to the programme co-chairs, Fritz Henglein and Josh Ko, at: henglein(a)diku.dk, hsiang-shang(a)nii.ac.jp Please also include in the email: * a short summary of the abstract (in plain text), * the type(s) of proposed presentation (poster and/or demo), and * whether you would like to give a scheduled short talk (in addition to the poster/demo presentation). Abstracts should be sent no later than: Friday, 8th December 2017, anywhere on earth and will be considered for acceptance on a rolling basis. Accepted abstracts, along with their short summary, will be posted on PEPM 2018’s website. At least one author of each accepted abstract must attend the workshop and present the work during the poster/demo session. Student participants with accepted posters/demos can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2018 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2018 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. * 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. * 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. * 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, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Fritz Henglein and Josh Ko (henglein(a)diku.dk, hsiang-shang(a)nii.ac.jp)

1 0

[ANNOUNCE] Openings for Haskell developers at Standard Chartered
by Atze Dijkstra 22 Nov '17

22 Nov '17

Hi all, I am happy to let you know that there are various Haskell developer job openings at the Strats team at Standard Chartered. For further info please see the below - http://www.atzedijkstra.net/haskell/job-openings-with-the-strats-team-at-st… kind regards, Atze Dijkstra Standard Chartered

1 0

Tenure-track Faculty Positions at the IMDEA Software Institute
by Manuel Hermenegildo 21 Nov '17

21 Nov '17

TENURE-TRACK FACULTY POSITIONS AT THE IMDEA SOFTWARE INSTITUTE -------------------------------------------------------------- The IMDEA Software Institute invites applications for multiple tenure-track (Assistant Professor) faculty positions. We are primarily interested in recruiting excellent candidates in the areas of Data Science, including machine learning; Privacy; and Systems, including parallel and distributed systems, embedded systems, hybrid and heterogeneous architectures, etc. However, we are open to other areas within the general research focus of the Institute. Tenured-level (Associate and Full Professor) applications will also be considered. The primary mission of the IMDEA Software Institute is to perform research of excellence at the highest international level in the area of software development technologies. It is one of the highest ranked institutions worldwide in its main topic areas. Selection Process ***************** The main selection criteria will be the candidate's demonstrated ability and commitment to research, the match of interests with the institute's mission, and how the candidate complements areas of established strengths of the institute. All positions require a doctoral degree in Computer Science or a closely related area, earned by the expected start date. Candidates for tenure-track positions will have shown exceptional promise in research and will have displayed an ability to work independently as well as collaboratively. Candidates for tenured positions must possess an outstanding research record, have recognized international stature, and demonstrated leadership abilities. Experience in graduate student supervision is also valued at this level. Applications should be completed using the application form at https://careers.imdea.org/software/ For full consideration, complete applications must be received by January 15, 2018 although applications will continue to be accepted until the positions are filled. Working at the IMDEA Software Institute *************************************** The institute is located in the vibrant area of Madrid, Spain. It offers an ideal working environment, combining the best aspects of a research center and a university department. Its researchers can focus on developing new ideas and projects, in collaboration with world-leading, international faculty, post-docs, and students. Researchers also have the opportunity (but no obligation) to teach university courses. The institute offers institutional funding and also encourages its members to participate in national and international research projects. The working language at the institute is English. Salaries at the Institute are internationally competitive and established on an individual basis. They include social security provisions in accordance with existing national Spanish legislation, and in particular access to an excellent public health care system. Further information about the Institute's current faculty and research can be found at http://www.software.imdea.org The IMDEA Software Institute is an Equal Opportunity Employer and strongly encourages applications from a diverse and international community and underrepresented groups. The institute complies with the European Charter for Researchers. --

1 0

Call for Participation for Secure Compilation Workshop (PriSC @ POPL'18)
by Dominique Devriese 17 Nov '17

17 Nov '17

Quick updates (more details in the Call for Participation below): - Do not miss the chance to submit short talks on your cutting-edge research until 14 December 2017, AoE https://popl18.sigplan.org/track/prisc-2018#Call-for-Short-Talks - POPL/PriSC registration is open; early rate ends on 10 December 2017 - List of accepted PriSC presentations: https://popl18.sigplan.org/track/prisc-2018#event-overview - The PriSC invited talk will be given by Mathias Payer (Purdue University) on Challenges For Compiler-backed Security: From Sanitizer to Mitigation ============================================= Call for Participation for Secure Compilation Workshop (PriSC @ POPL'18) ============================================= Secure compilation is an emerging field that puts together advances in programming languages, security, verification, systems, compilers, and hardware architectures in order to devise secure compiler chains that eliminate many of today's low-level vulnerabilities. Secure compilation aims to protect high-level language abstractions in compiled code, even against adversarial low-level contexts, and to allow sound reasoning about security in the source language. The emerging secure compilation community aims to achieve this by: identifying and formalizing properties that secure compilers must possess; devising efficient enforcement mechanisms; and developing effective verification and proof techniques. ======================================= 2nd Workshop on Principles of Secure Compilation (PriSC 2018) ======================================= The Workshop on Principles of Secure Compilation (PriSC) is a new informal 1-day workshop without any proceedings. The goal is to identify interesting research directions and open challenges and to bring together researchers interested in secure compilation. The 2nd PriSC edition will be held on Saturday, 13 January 2018, in Los Angeles, together with the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). More information at http://popl18.sigplan.org/track/prisc-2018 ========== Important Dates ========== POPL early registration deadline: 10 December 2017 Short talk submission deadline: 14 December 2017, AoE Short talk notification: 18 December 2017 PriSC Workshop takes place: 13 January 2018 Do not miss the chance to submit short talks on your cutting-edge research. More information below. ======== Invited Talk ======== Challenges For Compiler-backed Security: From Sanitizer to Mitigation. Mathias Payer (Purdue University, https://nebelwelt.net/) =============== Accepted Presentations =============== Building Secure SGX Enclaves using F*, C/C++ and X64. Anitha Gollamudi, Cédric Fournet. Constant-time WebAssembly. John Renner, Sunjay Cauligi, Deian Stefan. Enforcing Well-bracketed Control Flow and Stack Encapsulation using Linear Capabilities. Lau Skorstengaard, Dominique Devriese, Lars Birkedal Formally Secure Compilation of Unsafe Low-Level Components. Guglielmo Fachini, Catalin Hritcu, Marco Stronati, Ana Nora Evans, Théo Laurent, Arthur Azevedo de Amorim, Benjamin C. Pierce, Andrew Tolmach Linear capabilities for modular fully-abstract compilation of verified code. Thomas Van Strydonck, Dominique Devriese, Frank Piessens. On Compositional Compiler Correctness and Fully Abstract Compilation. Daniel Patterson, Amal Ahmed. Per-Thread Compositional Compilation for Confidentiality-Preserving Concurrent Programs. Robert Sison. Robust Hyperproperty Preservation for Secure Compilation. Deepak Garg, Catalin Hritcu, Marco Patrignani, Marco Stronati, David Swasey. Secure Compilation in a Production Environment. Vijay D'Silva. Type-Theoretic Galois Connections. Pierre-Evariste Dagand, Nicolas Tabareau, Éric Tanter =================== Participation and Registration =================== PriSC will be held on Saturday, 13 Jan 2018 at the POPL'18 venue (Omni Hotel LA). To participate, please register through the POPL registration system: https://popl18.sigplan.org/attending/Registration POPL early registration rate ends on 10 December 2017. ============ Call for Short Talks ============ We also have a short talks session, where participants get 5 minutes to present intriguing ideas, advertise ongoing work, etc. Anyone interested in giving a short 5-minute talk should submit an abstract. Any topic that could be of interest to the emerging secure compilation community is in scope. Presentations that provide a useful outside view or challenge the community are also welcome. Topics of interest include but are **not** limited to: - attacker models for secure compiler chains - secure compilation properties: full abstraction, memory safety, control-flow integrity, preserving non-interference or (hyper-)properties against adversarial contexts, secure multi-language interoperability - enforcement mechanisms: static checking, program verification, reference monitoring, program rewriting, software fault isolation, system-level protection, secure hardware, crypto, randomization - experimental evaluation and applications of secure compilation - proof methods: (bi)simulation, logical relations, game semantics, multi-language semantics, embedded interpreters - formal verification of secure compilation chain (protection mechanisms, compilers, linkers, loaders), machine-checked proofs, translation validation, property-based testing ============================ Guidelines for Submitting Short Talk Abstracts ============================ Abstracts should be submitted in text format and are not anonymous Giving a talk at the workshop does not preclude publication elsewhere. Please submit your abstracts at https://prisc18short.hotcrp.com ============= Program Committee ============= Program Chair Catalin Hritcu Inria Paris Members Amal Ahmed Inria Paris and Northeastern University Lars Birkedal Aarhus University Dominique Devriese KU Leuven Cédric Fournet Microsoft Research Deepak Garg MPI-SWS Xavier Leroy Inria Paris David Naumann Stevens Institute of Technology Marco Patrignani MPI-SWS Frank Piessens KU Leuven Tamara Rezk Inria Sophia Antipolis Nikhil Swamy Microsoft Research =============== Organizing Committee =============== Amal Ahmed Inria Paris and Northeastern University Dominique Devriese KU Leuven Deepak Garg MPI-SWS Catalin Hritcu Inria Paris Marco Patrignani MPI-SWS Tamara Rezk Inria Sophia Antipolis =================== Contact and More Information =================== More information about PriSC 2018 can be found on the website: http://popl18.sigplan.org/track/prisc-2018 For questions please contact the Program Chair. To make sure you receive such announcements in the future please subscribe to the following low-traffic mailing list: https://lists.gforge.inria.fr/mailman/listinfo/prisc-announce

1 0

ANNOUNCE: Haskell Communities and Activities Report (33rd ed., November 2017)
by Mihai Maruseac 15 Nov '17

15 Nov '17

On behalf of all the contributors, we are pleased to announce that the Haskell Communities and Activities Report (33rd edition, November 2017) is now available, in PDF and HTML formats: http://haskell.org/communities/11-2017/report.pdf http://haskell.org/communities/11-2017/html/report.html All previous editions of HCAR can be accessed on the wiki at https://wiki.haskell.org/Haskell_Communities_and_Activities_Report Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. We hope you will find it as interesting a read as we did. If you have not encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects, and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summaries of your own area of work. Many of you respond (eagerly, unprompted, and sometimes in time for the actual deadline) to the call. The editors collect all the contributions into a single report and feed that back to the community. When we try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ======================================== End of February 2018: target deadline for contributions to the May 2018 edition of the HCAR Report ======================================== Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to "register" with the editors for a simple e-mail reminder in November (you could point us to them as well, and we can then politely ask if they want to contribute, but it might work better if you do the initial asking). Of course, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Feel free to circulate this announcement further in order to reach people who might otherwise not see it. Enjoy! -- Mihai Maruseac (MM) "If you can't solve a problem, then there's an easier problem you can solve: find it." -- George Polya

1 0

FLOPS2018: Final CFP + deadline extension
by Martin Sulzmann 10 Nov '17

10 Nov '17

FINAL Call For Papers ========================= NOTE: DEADLINE EXTENSION ========================= FLOPS 2018: 14th International Symposium on Functional and Logic Programming In-Cooperation with ACM SIGPLAN =============================== 9-11 May, 2018, Nagoya, Japan http://www.sqlab.jp/FLOPS2018/ Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. Scope FLOPS solicits original papers in all areas of the declarative programming: * functional, logic, functional-logic programming, re-writing systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, submissions must be written to be understandable by the wide audience of declarative programmers and researchers. Submission of system descriptions and declarative pearls are especially encouraged. 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. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy. Proceedings The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series (www.springer.com/lncs) as a printed volume as well as online in the digital library SpringerLink. Post-proceedings: The authors of 4-7 best papers will be invited to submit the extended version of their FLOPS paper to a special issue of the journal Science of Computer Programming (SCP). Important dates 29 November 2017 (any time zone): Abstract Submission (extended) 4 December 2017 (any time zone): Submission deadline (extended) 29 January 2018: Author notification 9-11 May 2018: FLOPS Symposium Invited Speakers William E. Byrd, University of Utah, USA Zhenjiang Hu, National Institute of Informatics, SOKENDAI, Japan + 3rd speaker to be announced Submission Submissions must be written in English and can be up to 15 pages long including references, though pearls are typically shorter. The formatting has to conform to Springer's guidelines. 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://easychair.org/conferences/?conf=flops2018 Springer Guidelines https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… Program Committee Andreas Rossberg Google, Germany Atsushi Ohori Tohoku University, Japan Bruno C. D. S. Oliveira The University of Hong Kong, China Carsten Fuhs Birkbeck, University of London, UK Chung-chieh Shan Indiana University, USA Didier Remy INRIA, France Harald Søndergaard The University of Melbourne, Australia Jacques Garrigue Nagoya University, Japan Jan Midtgaard University of Southern Denmark, Denmark Joachim Breitner University of Pennsylvania, USA John Gallagher Roskilde University, Denmark and IMDEA Software Institute, Spain (PC co-chair) Jorge A Navas SRI International, USA Kazunori Ueda Waseda University, Japan Kenny Zhuo Ming Lu School of Information Technology, Nanyang Polytechnic, Singapore María Alpuente Universitat Politécnica de Valéncia, Spain María Garcia De La Banda Monash University, Australia Martin Sulzmann Karlsruhe University of Applied Sciences, Germany (PC co-chair) Meng Wang University of Kent, UK Michael Codish Ben-Gurion University of the Negev, Israel Michael Leuschel University of Düsseldorf, Germany Naoki Kobayashi University of Tokyo, Japan Nikolaj Bjørner Microsoft Research, USA Robert Glück University of Copenhagen, Denmark Samir Genaim Universidad Complutense de Madrid, Spain Siau Cheng Khoo National University of Singapore, Singapore Organizers Martin Sulzmann Karlsruhe University of Applied Sciences (PC co-chair) John Gallagher Roskilde University and IMDEA Software Institute (PC co-chair) Makoto Tatsuta National Institute of Informatics, Japan (General Chair) Koji Nakazawa Nagoya University, Japan (Local Chair)

1 0