Hendrik Tews | 28 Oct 16:19 2014

Job announcement: formal methods engineer and scientific developer at FireEye

Dear all,

[My excuses if see this email more than once]

the FireEye R&D center in Dresden, Germany, seeks outstanding
formal-methods experts and scientific programmers to join
FireEye's formal methods team in Dresden, Germany. Applicants
should have a background in logical reasoning, (formal) software
verification and functional programming. Please visit
http://FireEye.com/careers for the concrete job descriptions.

If you are interested or have questions, please contact me or
Roland Carter <roland.carter <at> FireEye.com> or visit
http://FireEye.com for more information about FireEye.

FireEye is a next generation security company that provides the
industry's leading threat protection technology. The formal
methods team at FireEye works on the (formal) verification of a
non-trivial piece of the software stack of one of FireEye's
future products. Dresden is one the most beautiful cities in
Germany with unique cultural attractions. The FireEye office is
in the heart of the city, next to the famous historical center.


Hendrik Tews

Formal Methods Engineering Manager at FireEye Germany
Head of FireEye Research & Development Dresden

(Continue reading)

Klaus Havelund | 26 Oct 15:40 2014

NFM 2015 - final call for papers


The 7th NASA Formal Methods Symposium


27 – 29 April 2015
Pasadena, California, USA

Paper Submission: *** 10 Nov 2014 ***


The widespread use and increasing complexity of mission- and safety-critical systems require advanced techniques that address their specification, verification, validation, and certification.

The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, industry, and government, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. Within NASA such systems include for example autonomous robots, separation assurance algorithms for aircraft, Next Generation Air Transportation (NextGen), and autonomous rendezvous and docking for spacecraft. Moreover, emerging paradigms such as property-based design, code generation, and safety cases are bringing with them new challenges and opportunities. The focus of the symposium will be on formal techniques, their theory, current capabilities, and limitations, as well as their application to aerospace, robotics, and other mission- and safety-critical systems in all design life-cycle stages. We encourage submissions on cross-cutting approaches marrying formal verification techniques with advances in critical system development, such as requirements generation, analysis of aerospace operational concepts, and formal methods integrated in early design stages and carrying throughout system development.


Topics of interest include, but are not limited to:

Model checking
Theorem proving
SAT and SMT solving
Symbolic execution
Static analysis
Runtime verification
Program refinement
Compositional verification
Modeling and specification formalisms
Model-based development
Model-based testing
Requirement engineering
Formal approaches to fault tolerance
Security and intrusion detection
Applications of formal methods to aerospace systems
Applications of formal methods to cyber-physical systems
Applications of formal methods to human-machine interaction analysis


Dino Distefano
Software Engineer at Facebook, California, USA and Professor at Queen Mary University of London, UK.

Viktor Kuncak
Leads Lab for Automated Reasoning and Analysis at EPFL, Lausanne, Switzerland.

Rob Manning
Chief Engineer at NASA/JPL.


Paper Submission: 10 Nov 2014
Paper Notifications: 12 Jan 2015
Camera-ready Papers: 9 Feb 2015
Symposium:   27 – 29 April 2015


The symposium will take place at the Hilton Hotel, Pasadena, California, USA, April 27-29, 2015.

There will be no registration fee for participants. All interested individuals, including non-US citizens, are welcome to submit, to attend, to listen to the talks, and to participate in discussions; however, all attendees must register.


There are two categories of submissions:

- Regular papers describing fully developed work and complete results (15 pages)
- Short papers describing tools, experience reports, or descriptions of work in progress with preliminary results  
 (6 pages)

All papers should be in English and describe original work that has not been published or submitted elsewhere. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in a volume of Springer’s Lecture Notes on Computer Science (LNCS), and must use LNCS style formatting. Papers should be submitted in PDF format.


Klaus Havelund, NASA Jet Propulsion Laboratory
Gerard Holzmann, NASA Jet Propulsion Laboratory
Rajeev Joshi, NASA Jet Propulsion Laboratory


Erika Abraham, RWTH Aachen University, Germany
Julia Badger, NASA Johnson Space Center, USA
Christel Baier, Technische Universität Dresden, Germany
Saddek Bensalem, VERIMAG/UJF, France
Dirk Beyer, University of Passau, Germany
Armin Biere, Johannes Kepler University, Austria
Nikolaj Bjorner, Microsoft Research, USA
Borzoo Bonakdarpour, McMaster University, Canada
Alessandro Cimatti, Fondazione Bruno Kessler, Italy
Leonardo de Moura, Microsoft Research, USA
Ewen Denney, NASA Ames Research Center, USA
Ben Di Vito, NASA Langley Research Center, USA
Dawson Engler, Stanford University, USA
Jean-Christophe Filliatre, Université Paris-Sud, France
Dimitra Giannakopoulou, NASA Ames Research Center, USA
Alwyn Goodloe, NASA Langley Research Center, USA
Susanne Graf, VERIMAG, France
Alex Groce, Oregon State University, USA
Radu Grosu, Vienna University of Technology, Austria
John Harrison, Intel Corporation, USA
Mike Hinchey, University of Limerick/Lero, Ireland
Bart Jacobs, University of Leuven, Belgium
Sarfraz Khurshid, The University of Texas at Austin, USA
Gerwin Klein, NICTA, Australia
Daniel Kroening, Oxford University, UK
Orna Kupferman, Hebrew University Jerusalem, Israel
Kim Larsen, Aalborg University, Denmark
Rustan Leino, Microsoft Research, USA
Martin Leucker, University of Lubeck, Germany
Rupak Majumdar, Max Planck Institute, Germany
Pete Manolios, Northeastern University, USA
Peter Mueller, ETH Zurich, Switzerland
Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA
Corina Pasareanu, NASA Ames Research Center, USA
Doron Peled, Bar Ilan University, Israel
Suzette Person, NASA Langley Research Center, USA
Andreas Podelski, University of Freiburg, Germany
Grigore Rosu, University of Illinois, USA
Kristin Yvonne Rozier, NASA Ames Research Center, USA
Natarajan Shankar, SRI International, USA
Natasha Sharygina, University of Lugano, Switzerland
Scott Smolka, Stony Brook University, USA
Willem Visser, University of Stellenbosch, South Africa
Mahesh Viswanathan, University of Illinois, USA
Mike Whalen, University of Minnesota, USA
Jim Woodcock, University of York, UK


Julia Badger, NASA Johnson Space Center
Ewen Denney, NASA Ames Research Center
Ben Di Vito, NASA Langley Research Center
Klaus Havelund, NASA Jet Propulsion Laboratory
Gerard Holzmann, NASA Jet Propulsion Laboratory
Cesar Munoz, NASA Langley Research Center
Corina Pasareanu, NASA Ames Research Center
Suzette Person, NASA Langley Research Center
Kristin Yvonne Rozier, NASA Ames Research Center

Haskell mailing list
Haskell <at> haskell.org
Liu Yang (Asst Prof | 23 Oct 08:30 2014

Multiple Postdoc Positions on Formal Methods for Cyber Security

Title: Multiple Postdoc Positions on Formal Methods for Cyber Security http://www.ntu.edu.sg/home/yangliu/securify.html

Nanyang Technological University and
Singapore University of Technology and Design

Highly motivated applicants are sought to work on developing and applying verification techniques for
infinite state systems in the project on Building Security Verified System.
The project aims to fully verify the execution stack of a cyber-physical system:
i.e., hardware, operating system, system libraries and applications, using model checking and theorem
proving technologies.
The postdocs will work with the PAT formal methods research group (www.patroot.com) and other
researchers at NTU and SUTD in Singapore.

They will also have the opportunity to travel overseas to collaborate with partners of the project,
including ETH Zurich, Oxford University, Royal Holloway University of London, University of
Luxembourg, Hong Kong University of Science and Technology.

Positions for Research Fellow and Senior Research Fellow are available for the following topics:

1. Hardware Verification.
   The preferred candidates are those with experience in one or more of the following areas:
      - Formal methods, model checking, theorem proving.
      - Temporal logics, Higher order logic.
      - Functional programming.
      - Hardware design, especially SPARK/LEON architecture
    Contact: Liu Yang (yangliu <at> ntu.edu.sg), Alwen Tiu (atiu <at> ntu.edu.sg)

2. Microkernel Verification
   The preferred candidates are those with experience in one or more of the following areas:
      - Formal methods, theorem proving.
      - Temporal logics, Higher order logic.
      - Functional programming.
      - Operating System Design.
   Contact: Liu Yang (yangliu <at> ntu.edu.sg)

3. Software Model Checking for Security
   The preferred candidates are those with experience in one or more of the following areas:
      - Formal methods, model checking.
      - Temporal logics.
      - SMT solvers.
      - Formal languages and automata.
   Contact: Jun Sun (sunjun <at> sutd.edu.sg) and Yang Liu (yangliu <at> ntu.edu.sg)

4. Runtime security verification
   The preferred candidates are those with experience in one or more of the following areas:
            - Temporal and modal logics
            - First-order theorem proving
            - Runtime verification
            - Preferably also backgrounds in operating system and network security
   Contact: Alwen Tiu (atiu <at> ntu.edu.sg)

5. Compositional Verification of Security.
   The preferred candidates are those with experience in one or more of the following areas:
      - Formal methods, model checking.
      - Assume-Guarantee Reasoning.
      - Temporal Logics.
      - Formal languages and automata.

   Contact: Yang Liu (yangliu <at> ntu.edu.sg) and Jun Sun (sunjun <at> sutd.edu.sg)

6. System Security.
   The preferred candidates are those with experience in one or more of the following areas:
      - Binary security and analysis, especially LLVM.
      - Malware and vulnerabilities.
      - Mobile platform security.
      - Embedded system security.
      - Cloud security.

   Contact: Yang Liu (yangliu <at> ntu.edu.sg)

7. Secure Code Generation.
   The preferred candidates are those with experience in one or more of the following areas:
      - Formal methods, model checking, theorem proving.
      - Temporal logics, Higher order logic.
      - Model driven development.

   Contact: Yang Liu (yangliu <at> ntu.edu.sg)

The position involves conducting basic research, developing tools, working as part of a research team,
travelling, and giving presentations. The working language is English.

Apart from specific requirements to each topic candidate general requirements are:
- A PhD in Computer Science or related areas is required.
- Strong background in logic and discrete math.
- Strong programming skills.
- An established research record.

The term is currently one to three years starting as early as January 2015 till all positions are filled.
The salary range is 4000 SGD - 6000 SGD per month for Research Fellows and
6000 - 8000 SGD per month for Senior Research Fellows.
Yearly bonus is 1 to 3 month salary based on the performance.
Singapore's tax is around 3%-5% of the annual salary.
1USD = 1.25 SGD.

Candidates interested in a particular topic or topics should contact the contact person(s) listed in the
respective topics above for more details.

General inquiries can be directed at either Yang Liu, Jun Sun and Alwen Tiu.

CONFIDENTIALITY: This email is intended solely for the person(s) named and may be confidential and/or
privileged. If you are not the intended recipient, please delete it, notify us and do not copy, use, or
disclose its contents.
Towards a sustainable earth: Print only when necessary. Thank you.
Tom Schrijvers | 21 Oct 10:14 2014

Postdoc Position in Functional and Constraint Programming at KU Leuven

Postdoctoral position in Functional and Constraint Programming at KU Leuven

The Declarative Languages and Artificial Intelligence (DTAI) group of KU Leuven (Belgium) invites applicants for a postdoctoral position in the area of functional and constraint programming. The position revolves around domain-specific languages (DSLs) embedded in Haskell for constraint programming. It is part of the EU project GRACeFUL whose overarching theme is tools for collective decision making. The KU Leuven part of the project is under the direction of prof. Tom Schrijvers.

To apply you must hold a recent PhD (or be about to graduate) related to either functional or constraint programming. Experience in both areas is an advantage.

You will work closely with prof. Schrijvers and his PhD students at KU Leuven, as well as with the GRACeFUL project partners across Europe.

The position is for 3 years. The salary is competitive and the starting date negotiable (but no later than February 1). Moreover, KU Leuven's policy of equal opportunities and diversity applies to this position.

prof. dr. ir. Tom Schrijvers

Research Professor
KU Leuven
Department of Computer Science

Celestijnenlaan 200A
3001 Leuven
Phone: +32 16 327 830
Haskell mailing list
Haskell <at> haskell.org
Michael Hanus | 20 Oct 13:08 2014

RTA 2015 - First Call For Papers

              RTA 2015 - CALL FOR PAPERS
           26th International Conference on
        29 June - 1 July, 2015, Warsaw, Poland
      co-located with TLCA, as part of RDP 2015

RTA is the major forum for the presentation of research on all
aspects of rewriting.  Topics of interest include:

* Foundations: string, term, net and graph rewriting; higher-order
rewriting; binding techniques; constrained rewriting and deduction;
categorical and infinitary rewriting; stochastic rewriting;
higher-dimensional rewriting; tree automata; confluence;
termination; complexity; modularity; equational logic;
universal algebra; rewriting logic; rewriting calculi.

* Algorithmic aspects and implementation: strategies; matching;
unification; anti-unification; narrowing; completion; parallel
execution; certification of rewriting properties; abstract machines;
automated (non)termination and confluence provers; automated
complexity analysis; system descriptions.

* Applications of rewriting: programming languages (functional,
logic, object-oriented and other programming paradigms); type
systems; program analysis, transformation and optimisation;
rewriting models of programs; semantics; process calculi;
functional calculi; explicit substitution; constraint solving;
symbolic and algebraic computation; theorem proving;
proof checking; system modelling; system synthesis and
verification; XML queries and transformations; cryptographic
protocols; security policies; systems biology; linguistics;
rewriting in education.

Important Dates:
# Submission: title and abstract: 30 January 2015
              full paper: 6 February 2015
# Rebuttal period: 19-21 March 2015
# Notification:    8 April 2015
# Final version:  25 April 2015

Submission and publication:
The RTA 2015 proceedings will be published by LIPIcs (Leibniz
International Proceedings in Informatics). Papers should present
original work, and should be submitted via Easychair:
Papers should be at most 15 pages (10 for system descriptions)
in the style described in:
This year we particularly welcome submissions on applications of
rewriting. Application papers are regular papers (15 pages); their
originality is judged based on the novelty of the application or the
depth of the rewriting methods applied.
System description papers present new software tools in which
rewriting plays an important role, or significantly new versions
of such tools. The paper should also include an evaluation of the

Programme Committee:
M. Ayala-Rincon, U. Brasilia
H. Cirstea, Loria Nancy
S. Delaune, ENS Cachan
A. Di Pierro, U. Verona
G. Dowek, Inria
M. Fernandez, KCL, chair
J. Giesl, RWTH Aachen U.
M. Hanus, CAU Kiel
D. Kesner, U. Paris-Diderot
T. Kutsia, Johannes Kepler U. Linz
J. Levy, IIIA-CSIC Barcelona
S. Lucas, Polytechnic U. Valencia
C. Lynch, Clarkson U.
I. Mackie, E. Polytechnique
G. Moser, U. Innsbruck
D. Plump, U. York
F. van Raamsdonk, VU Amsterdam
K. Rose, Two Sigma, US
M. Sakai, Nagoya U.
A. Scedrov, U. Pennsylvania
M. Schmidt-Schauss, U. Frankfurt
C. Schuermann, ITU Copenhagen	
P. Selinger, Dalhousie U.
P. Severi, U. Leicester
K. Ueda, Waseda U.

Conference Chair:
Aleksy Schubert
Warsaw University

For more information, please contact the PC chair:
Maribel.Fernandez <at> kcl.ac.uk
Liu Yang (Asst Prof | 17 Oct 11:45 2014

ICFEM 2014, Luxembourg, 3-7 November 2014: Last Call for Participation

16th International Conference on Formal Engineering Methods
ICFEM 2014, Luxembourg, 3-7 November 2014

Last Call for Participation

The 16th International Conference on Formal Engineering Methods (ICFEM
2014) will be held at the Melia Hotel in Luxembourg, Luxembourg from
3rd November to 7 November 2014. Since 1997, ICFEM has been serving as
an international forum for researchers and practitioners who have been
seriously applying formal methods to practical applications.

+ Keynote speakers: Nikolaj Bjorner (Microsoft Research), Lionel
Briand (University of Luxembourg) and Vincent Danos (University of
+ The conference is now available http://icfem2014.uni.lu/program.php
+ Panel discussion on November 4th: Are Formal Engineering Methods and Agile Methods Friend or Enemy?
+ Two affiliated workshops FTSCS 2014 and SOFL+MSVL.

PC Chairs
+ Stephan Merz (INRIA, France)
+ Jun Pang (University of Luxembourg, Luxembourg)
CONFIDENTIALITY: This email is intended solely for the person(s) named and may be confidential and/or
privileged. If you are not the intended recipient, please delete it, notify us and do not copy, use, or
disclose its contents.
Towards a sustainable earth: Print only when necessary. Thank you.
Yaron Minsky | 16 Oct 15:14 2014

[JOB] Summer internships at Jane Street

Jane Street is actively hiring summer interns for our offices in New
York, London and Hong Kong.

Interning at Jane Street is a great learning experience.  If you're
interested in seeing how functional programming is applied to real
world problems at big scale, there's no better place.

Look here


to get a sense of the kinds of projects summer interns do.  As is
reflected there, many of our intern projects make their way out as
open-source projects.  Interns also learn about Jane Street's trading
business through lectures and interactive training sessions.  Plus,
there are a lot of fun social activities throughout the summer.

Feel free to redistribute this to any students you think might be
interested.  And if you're interested directly, you can apply here:


And as usual, we're also hiring developers for fulltime positions in
NYC, Hong Kong and London.


(For the avoidance of doubt, note that summer internships are paid
Mateusz Kowalczyk | 14 Oct 20:05 2014

ANN: yi-0.10.0 , the text editor written in Haskell

We're glad to announce Yi 0.10.0. Yi is 10 years old today!

Our main repository is at [1]. Yi compiles with GHC 7.6.3 all the way
up to GHC 7.8.3.

There have been many changes since the latest Hackage release (0.8.2).
I inline the relevant part of the changelog at the bottom.

We are slowly trying to populate the documentation pages: we have
recently started using GitHub pages[2] for this purpose. Please have a

On top of the issues listed in the changelog, a lot of issues were
closed separately. If you had a pending issue, please check the issue

As always we're looking for contributors: we have tasks in just about
any area. Note that you don't even need to know Haskell to help us.

Visit us on #yi on Freenode: be prepared to stay for more than 5

Installation instructions are available at [2]. If you're using nix,
Yi 0.10.0 will be packaged shortly.


 * Unicode syntax highlighting fixed (issue #82)
 * Hook to GTK Window exposed (#557)
 * Multiple components moved out to separate packages (oo-prototypes,
   word-trie, yi-languages, yi-string)
 * Replace a lot of the API to use YiString/Text instead of String
   improving performance
 * Greatly improve performance in the pango front-end as long as
   line-wrapping is on (default)
 * Recognise read-only files (#145)
 * Various Vim keymap improvements and fixes
 * Use lens instead of uniplate, replace some boilerplate with lens
 * Improve test framework to handle windows interactions, e.g. scrolling.
 * Use GHC.Generics instead of derive on GHC 7.8
 * Remove bitrotten ghcapi and scion flags.
 * Support non-qwerty vim users
 * Support eventlog profiling with -feventlog
 * Eliminate idle CPU consumption in vty frontend
 * General cleanup
 * Make C-w closer to actual emacs behaviour (#612)
 * Make M-h behave more like emacs (#611)
 * Hint with buffer names when using C-k with emacs keymap (#606)
 * Fix display of paths starting with / (#528)
 * Don't mark buffer as changed if nothing was killed (#618)
 * Nicer findFile &c behaviour in dired buffers (#149)
 * Implement C-a for CUA (#167)
 * Fix dired for directories with unicode files/dirs (#445)
 * Fix vim indenting under some circumstances (#621)
 * Allow the font size to be changed per buffer (#608)
 * Double-click and triple-click selection in pango (#100 and #101)
 * Count columns properly in presence of tabs (#440)
 * Extra marking operations in dired

  Alan Zimmerman, Anders Papitto, Anthony Quizon, Ben Armston, Benno
  Carter Charbonneau, Corey O'Connor, Cray Elliott, Dmitry Ivanov,
  Ilya Smelkov, Jakub Arnold, Jared Hance, jetho, Mateusz Kowalczyk,
  Richard Goulter, Ryan Desfosses, Siddhanathan Shanmugam


 * Vim keymap removed. Vim2 is now called Vim.

[1]: https://github.com/yi-editor/yi
[2]: http://yi-editor.github.io/


Mateusz K.
José Pedro Magalhães | 10 Oct 14:59 2014

Mathematics of Program Construction (MPC 2015): first call for papers

Apologies for multiple copies.


12th International Conference on Mathematics of Program Construction (MPC 2015)
Königswinter, Germany, 29 June - 1 July 2015


The MPC conferences aim to promote the development of mathematical principles
and techniques that are demonstrably practical and effective in the process of
constructing computer programs, broadly interpreted.

The 2015 MPC conference will be held in Königswinter, Germany, from 29th June to
1st July 2015. The previous conferences were held in Twente, The Netherlands
(1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden
(1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK
(2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST),
Marseille, France (2008), Québec City, Canada (2010, colocated with AMAST), and
Madrid, Spain (2012).


Papers are solicited on mathematical methods and tools put to use in program
construction. Topics of interest range from algorithmics to support for program
construction in programming languages and systems. The notion of "program" is
broad, from algorithms to hardware. Some typical areas are type systems, program
analysis and transformation, programming-language semantics, security, and
program logics. Theoretical contributions are welcome, provided that their
relevance to program construction is clear. Reports on applications are welcome,
provided that their mathematical basis is evident.

We also encourage the submission of "pearls": elegant, instructive, and fun
essays on the mathematics of program construction.


   * Submission of abstracts:      26 January 2015
   * Submission of full papers:     2 February 2015
   * Notification to authors:      16 March 2015
   * Final version:                13 April 2015


Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be
submitted by 26 January 2015. Full papers (pdf) adhering to the LaTeX llncs
style must be submitted by 2 February 2015. There is no official page limit, but
authors should strive for brevity. The web-based system EasyChair will be used

Papers must report previously unpublished work, and must not be submitted
concurrently to a journal or to another conference with refereed proceedings.
Accepted papers must be presented at the conference by one of the authors.
Please feel free to write to mpc2015 <at> easychair.org with any questions
about academic matters.

The proceedings of MPC 2015 will be published in Springer-Verlag's Lecture Notes
in Computer Science series, as have all the previous editions. Authors of
accepted papers will be expected to transfer copyright to Springer for this
purpose. After the conference, authors of the best papers will be invited to
submit revised versions to a special issue of the Elsevier journal Science of
Computer Programming.


Ralf Hinze                University of Oxford, UK (chair)

Eerke Boiten              University of Kent, UK
Jules Desharnais          Université Laval, Canada
Lindsay Groves            Victoria University of Wellington, New Zealand
Zhenjiang Hu              National Institute of Informatics, Japan
Graham Hutton             University of Nottingham, UK
Johan Jeuring             Utrecht University and Open University, The Netherlands
Jay McCarthy              Vassar College, US
Bernhard Möller           Universität Augsburg, Germany
Shin-Cheng Mu             Academia Sinica, Taiwan
Dave Naumann              Stevens Institute of Technology, US
Pablo Nogueira            Universidad Politécnica de Madrid, Spain
Ulf Norell                University of Gothenburg, Sweden
Bruno C. d. S. Oliveira   The University of Hong Kong, Hong Kong
José Nuno Oliveira        Universidade do Minho, Portugal
Alberto Pardo             Universidad de la República, Uruguay
Christine Paulin-Mohring  INRIA-Université Paris-Sud, France
Tom Schrijvers  KU Leuven, Belgium
Emil Sekerinski           McMaster University, Canada
Tim Sheard                Portland State University, US
Anya Tafliovich           University of Toronto Scarborough, Canada
Tarmo Uustalu             Institute of Cybernetics, Estonia
Janis Voigtländer         Universität Bonn, Germany


The conference will take place in Königswinter, Maritim Hotel, where
accommodation has been reserved. Königswinter is situated on the right bank of
the river Rhine, opposite Germany's former capital Bonn, at the foot of the


Ralf Hinze                      University of Oxford, UK (co-chair)
Janis Voigtländer               Universität Bonn, Germany (co-chair)
José Pedro Magalhães            University of Oxford, UK
Nicolas Wu                      University of Oxford, UK

For queries about local matters, please write to jv <at> informatik.uni-bonn.de.

Haskell mailing list
Haskell <at> haskell.org
David Van Horn | 10 Oct 00:32 2014

ICFP 2015 Call for Workshop and Co-located Event Proposals

                            ICFP 2015
 20th ACM SIGPLAN International Conference on Functional Programming
                   August 30 - September 5, 2015
                        Vancouver, Canada

The 120th ACM SIGPLAN International Conference on Functional
Programming will be held in Vancouver, British Columbia, Canada on
August 30-September 5, 2015.  ICFP provides a forum for researchers
and developers to hear about the latest work on the design,
implementations, principles, and uses of functional programming.

Proposals are invited for workshops (and other co-located events, such
as tutorials) to be affiliated with ICFP 2015 and sponsored by
SIGPLAN. These events should be less formal and more focused than ICFP
itself, include sessions that enable interaction among the attendees,
and foster the exchange of new ideas. The preference is for one-day
events, but other schedules can also be considered.

The workshops are scheduled to occur on August 30 (the day
before ICFP) and September 3-5 (the three days after ICFP).


Submission details
 Deadline for submission:     November 16, 2014
 Notification of acceptance:  December 15, 2014

Prospective organizers of workshops or other co-located events are
invited to submit a completed workshop proposal form in plain text
format to the ICFP 2015 workshop co-chairs (Tom Schrijvers and Nicolas
Wu), via email to icfp2015-workshops <at> cs.kuleuven.be by November 16,
2014. (For proposals of co-located events other than workshops, please
fill in the workshop proposal form and just leave blank any sections
that do not apply.) Please note that this is a firm deadline.

Organizers will be notified if their event proposal is accepted by
December 15, 2014, and if successful, depending on the event, they
will be asked to produce a final report after the event has taken
place that is suitable for publication in SIGPLAN Notices.

The proposal form is available at:


Further information about SIGPLAN sponsorship is available at:



Selection committee

The proposals will be evaluated by a committee comprising the
following members of the ICFP 2015 organizing committee, together with
the members of the SIGPLAN executive committee.

 Workshop Co-Chair: Tom Schrijvers                         (KU Leuven)
 Workshop Co-Chair: Nicolas Wu                  (University of Oxford)
 General Chair:     Kathleen Fisher                 (Tufts University)
 Program Chair:     John Reppy                 (University of Chicago)


Further information

Any queries should be addressed to the workshop co-chairs (Tom
Schrijvers and Nicolas Wu), via email to
icfp2015-workshops <at> cs.kuleuven.be.
Daniel Santa Cruz | 9 Oct 06:07 2014

Haskell Weekly News: Issue 309

Welcome to issue 309 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers
from September 28 to October 4, 2014

Quotes of the Week

   * Uh... I'ma have to read the IRC logs... No good quotes <at> remember'd

Top Reddit Stories

   * Announcing needle: ASCII-fied arrow notation
     Domain: scrambledeggsontoast.github.io, Score: 103, Comments: 119
     Original: [1] http://goo.gl/wCPh8K
     On Reddit: [2] http://goo.gl/UwTJSt

   * How we might abolish Cabal Hell, part 1
     Domain: well-typed.com, Score: 95, Comments: 69
     Original: [3] http://goo.gl/N19hPq
     On Reddit: [4] http://goo.gl/CQQRF0

   * After some failed attempts to learn Parsec I came across this incredibly 
     patient tutorial and now I'm writing parsers!
     Domain: github.com, Score: 79, Comments: 17
     Original: [5] http://goo.gl/msqtkb
     On Reddit: [6] http://goo.gl/p3EgqQ

   * Neil Mitchell's Haskell Blog: Why Traversable/Foldable should not be 
     in the Prelude
     Domain: neilmitchell.blogspot.co.il, Score: 71, Comments: 289
     Original: [7] http://goo.gl/sykNse
     On Reddit: [8] http://goo.gl/4wIxBX

   * Tutorial: Implementing highly efficient data structures with 
     Monoids and Fingertrees
     Domain: codementor.io, Score: 47, Comments: 37
     Original: [9] http://goo.gl/WB7Jwg
     On Reddit: [10] http://goo.gl/jGrLX1

   * There is No Haskell Topology
     Domain: immanence.org, Score: 45, Comments: 32
     Original: [11] http://goo.gl/JAoEDw
     On Reddit: [12] http://goo.gl/wuuF4i

   * Introduction to Low Level Haskell Optimization - Dan Doel
     Domain: youtu.be, Score: 44, Comments: 2
     Original: [13] http://goo.gl/vYS1Hy
     On Reddit: [14] http://goo.gl/dG9Pn5

   * Turn an optparse-applicative program into a CGI program!
     Domain: github.com, Score: 39, Comments: 10
     Original: [15] http://goo.gl/sjCqsb
     On Reddit: [16] http://goo.gl/BXxeno

   * Yesod 1.4 released
     Domain: yesodweb.com, Score: 36, Comments: 1
     Original: [17] http://goo.gl/T5Vqe8
     On Reddit: [18] http://goo.gl/977ey0

   * Updating Auto-Update
     Domain: yesodweb.com, Score: 36, Comments: 20
     Original: [19] http://goo.gl/OwOrGZ
     On Reddit: [20] http://goo.gl/J2zr5n

   * Type-safe Routing for Spock Web Framework released
     Domain: github.com, Score: 32, Comments: 39
     Original: [21] http://goo.gl/QZS9gU
     On Reddit: [22] http://goo.gl/BokvJ8

   * Lattice-Based Data Structures for Deterministic Parallel and Distributed 
     Programming (related to CRDTs; implementation in Haskell)
     Domain: composition.al, Score: 30, Comments: 9
     Original: [23] http://goo.gl/mVQqqX
     On Reddit: [24] http://goo.gl/tZ0XrW

   * A non-recursive sorting algorithm
     Domain: haskellexists.blogspot.com, Score: 27, Comments: 36
     Original: [25] http://goo.gl/jD0z0K
     On Reddit: [26] http://goo.gl/3HpTBy

   * Dijkstra monads
     Domain: why-lambda.blogspot.co.uk, Score: 25, Comments: 4
     Original: [27] http://goo.gl/kx1Q6w
     On Reddit: [28] http://goo.gl/C86igH

   * Improving Haskell-related documentation
     Domain: self.haskell, Score: 23, Comments: 62
     Original: [29] http://goo.gl/rQeuUT
     On Reddit: [30] http://goo.gl/rQeuUT

   * Haskell, Monads and Purity • via Hacker News
     Domain: jelv.is, Score: 23, Comments: 11
     Original: [31] http://goo.gl/vm7juH
     On Reddit: [32] http://goo.gl/1P5OgF

   * FP Complete is hiring: Systems engineer for cloud and cluster work
     Domain: fpcomplete.com, Score: 21, Comments: 11
     Original: [33] http://goo.gl/MLT5Ud
     On Reddit: [34] http://goo.gl/Ql8uIX

   * The future of the haskell2010/haskell98 packages for GHC 7.10
     Domain: haskell.org, Score: 21, Comments: 22
     Original: [35] http://goo.gl/94bnK3
     On Reddit: [36] http://goo.gl/0c80JU

   * ANN: Nomyx V0.7, the only game where you can change the rules
     Domain: self.haskell, Score: 20, Comments: 7
     Original: [37] http://goo.gl/1gGtqb
     On Reddit: [38] http://goo.gl/1gGtqb

   * Let's Build a Browser Engine in Haskell: part 5
     Domain: hrothen.github.io, Score: 19, Comments: 6
     Original: [39] http://goo.gl/zzSF2D
     On Reddit: [40] http://goo.gl/9xzqdR

Top StackOverflow Questions

   * How fundamentaly different push-pull and arrowized FRP are?
     votes: 10, answers: 0
     Read on SO: [41] http://goo.gl/XbbbVW

   * What are hashes (#) used for in Haskell's library's source?
     votes: 10, answers: 1
     Read on SO: [42] http://goo.gl/mvNNlb

   * What is the inverse of a promise?
     votes: 9, answers: 3
     Read on SO: [43] http://goo.gl/usQIiW

   * Is there a default polymorphic unit type haskell
     votes: 7, answers: 1
     Read on SO: [44] http://goo.gl/5Ozy9G

   * nvcc + c2hs on OS X 10.9.5
     votes: 7, answers: 1
     Read on SO: [45] http://goo.gl/0XMNFu

   * How to sort a list using partial order in Haskell?
     votes: 7, answers: 2
     Read on SO: [46] http://goo.gl/GLMiwA

   * Relationship between forward and backward map in Isomorphism 
     (Lens package)
     votes: 6, answers: 1
     Read on SO: [47] http://goo.gl/icIdIR

   * How to implement a generic neural network efficiently in Haskell?
     votes: 6, answers: 0
     Read on SO: [48] http://goo.gl/HIHY8e

   * How do I unify two or more Signals in elerea?
     votes: 6, answers: 1
     Read on SO: [49] http://goo.gl/jacb0r

   * Ambiguous type variable fixed with type equality constraint
     votes: 6, answers: 1
     Read on SO: [50] http://goo.gl/JADmBj

Until next time,
[51]+Daniel Santa Cruz


Haskell mailing list
Haskell <at> haskell.org