Hongseok Yang | 24 Jul 18:48 2014

HOPE 2014 Call for Participation (with Workshop Program)


                      CALL FOR PARTICIPATION

                           HOPE 2014

                The 3rd ACM SIGPLAN Workshop on
              Higher-Order Programming with Effects

                        August 31, 2014
                      Gothenburg, Sweden
                   (the day before ICFP 2014)


HOPE 2014 aims at bringing together researchers interested in the design, 
semantics, implementation, and verification of higher-order effectful 
programs. It will be *informal*, consisting of invited talks, contributed 
talks on work in progress, and open-ended discussion sessions. 


Deadline for early registration: 3 August 2014

This is the registration site for ICFP 2014 and all the affiliated
workshops including HOPE 2014.

Invited Talk

Title: Verifying Security Properties of SES Programs
Speaker: Philippa Gardner, Imperial College London

List of Accepted Talks

(1) Stevan Andjelkovic. Towards indexed algebraic effects and handlers

(2) Kwok Cheung. Separating Entangled State

(3) Filip Sieczkowski and Lars Birkedal. ModuRes: a Coq Library for Reasoning about Concurrent Higher-Order Imperative Programming Languages

(4) Ohad Kammar. Graphical algebraic foundations for monad stacks

(5) Paul Downen and Zena M. Ariola. Delimited control with multiple prompts in theory and practice

(6) Carter Schonwald. A Type Directed model of Memory Locality and the design of High Performance Array APIs

(7) Georg Neis, Chung-Kil Hur, Jan-Oliver Kaiser, Derek Dreyer and Viktor Vafeiadis. Compositional Compiler Verification via Parametric Simulation

(8) Danel Ahman and Tarmo Uustalu. From stateful to stackful computation

Goals of the Workshop

A recurring theme in many papers at ICFP, and in the research of many
ICFP attendees, is the interaction of higher-order programming with
various kinds of effects: storage effects, I/O, control effects,
concurrency, etc. While effects are of critical importance in many
applications, they also make it hard to build, maintain, and reason
about one's code. Higher-order languages (both functional and
object-oriented) provide a variety of abstraction mechanisms to help
"tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types,
typestate, first-class events, transactions, Hoare Type Theory,
session types, substructural and region-based type systems), and a
number of different semantic models and verification technologies have
been developed in order to codify and exploit the benefits of this
encapsulation (e.g. bisimulations, step-indexed Kripke logical
relations, higher-order separation logic, game semantics, various
modal logics). But there remain many open problems, and the field is
highly active.

The goal of the HOPE workshop is to bring researchers from a variety
of different backgrounds and perspectives together to exchange new and
exciting ideas concerning the design, semantics, implementation, and
verification of higher-order effectful programs.

We want HOPE to be as informal and interactive as possible. The
program will thus involve a combination of invited talks, contributed
talks about work in progress, and open-ended discussion
sessions. There will be no published proceedings, but participants
will be invited to submit working documents, talk slides, etc. to be
posted on this website.

Workshop Organization

Program Co-Chairs:

Neel Krishnaswami (University of Birmingham)
Hongseok Yang (University of Oxford)

Program Committee:

Zena Ariola (University of Oregon)
Ohad Kammar (University of Cambridge)
Ioannis Kassios (ETH Zurich)
Naoki Kobayashi (University of Tokyo)
Paul Blain Levy (University of Birmingham)
Aleks Nanevski (IMDEA)
Scott Owens (University of Kent)
Sam Staton (Radboud University Nijmegen)
Steve Zdancewic (University of Pennsylvania)
Haskell mailing list
Haskell <at> haskell.org
Sebastian Erdweg | 24 Jul 17:19 2014

Call for Talk Proposals: Domain-Specific Language Design and Implementation 2014


DSLDI 2014

Second Workshop on
Domain-Specific Language Design and Implementation

October 20/21, 2014
Portland, USA
Co-located with SPLASH/OOPSLA


Deadline for talk proposals: August 27, 2014

If designed and implemented well, domain-specific languages (DSLs)
combine the best features of general-purpose programming languages
(e.g., performance) with high productivity (e.g., ease of

*** Workshop Goal ***

The goal of the DSLDI workshop is to bring together researchers and
practitioners interested in sharing ideas on how DSLs should be
designed, implemented, supported by tools, and applied in realistic
application contexts. We are both interested in discovering how
already known domains such as graph processing or machine learning can
be best supported by DSLs, but also in exploring new domains that
could be targeted by DSLs. More generally, we are interested in
building a community that can drive forward the development of modern

*** Workshop Format ***

DSLDI is a single-day workshop and will consist of a series of short
talks whose main goal is to trigger exchange of opinion and
discussions. The talks should be on the topics within DSLDI's area of
interest, which include but are not limited to the following ones:

* DSL implementation techniques, including compiler-level and
runtime-level solutions
* utilization of domain knowledge for driving optimizations of DSL
* utilizing DSLs for managing parallelism and hardware heterogeneity
* DSL performance and scalability studies
* DSL tools, such as DSL editors and editor plugins, debuggers,
refactoring tools, etc.
* applications of DSLs to existing as well as emerging domains, for
example graph processing, image processing, machine learning,
analytics, robotics, etc.
* practitioners reports, for example descriptions of DSL deployment in
a real-life production setting

*** Call for Submissions ***

We solicit talk proposals in the form of short abstracts (max. 2
pages). A good talk proposal describes an interesting position,
demonstration, or early achievement. The submissions will be reviewed
on relevance and clarity, and used to plan the mostly interactive
sessions of the workshop day. Publication of accepted abstracts and
slides on the website is voluntary.

* Deadline for talk proposals: August 27, 2014
* Notification: September 12, 2014
* Workshop: October 19 or 20, 2014
* Submission website: https://www.easychair.org/conferences/?conf=dsldi2014

*** Workshop Organization ***


* Sebastian Erdweg, TU Darmstadt, Germany
* Adam Welc, Oracle Labs, USA

Program committee

* Martin Erwig, Oregon State University, USA
* Matthew Flatt, University of Utah, USA
* Klaus Ostermann, University of Marburg, Germany
* Tiark Rompf, EPFL/Oracle Labs, Switzerland
* Tijs van der Storm, CWI, Netherlands
* Juha-Pekka Tolvanen, University of Jyväskylä/Metacase, Finland
* Emina Torlak, University of California, Berkeley, USA
* Laurence Tratt, King's College London, UK
* Markus Völter, itemis/independent, Germany
* Guido Wachsmuth, TU Delft, Netherlands

ecoop-info mailing list
ecoop-info <at> ecoop.org
Mary Sheeran | 24 Jul 15:27 2014

FHPC 2014 (and reminder about ICFP early reg)

The programme for the Workshop on Functional High Performance Computing (Sept. 4 immediately after ICFP) is available at
It will be a very enjoyable workshop so please consider attending.

This is also a reminder that the last day for early registration at ICFP and associated workshops is August 3. Online registration for both ICFP and FHPC starts here:

with best wishes

Mary Sheeran
Haskell mailing list
Haskell <at> haskell.org
Stefan Wehr | 22 Jul 14:39 2014

Call for participation: Haskell tutorial at CUFP on 4 Sep 2014

Dear Haskellers,

I'll be giving an advanced Haskell tutorial as part of the CUFP 2014 workshop.

  * Date/time: 4 Sep 2014, 9:00 AM - 12:30 PM
  * Place: Gothenburg, Sweden (affiliated with ICFP 2014)
  * Early registration deadline: 3 Aug 2014!

The tutorial teaches important techniques for writing correct, robust,
scalable, and fast Haskell programs. The topics covered are: network
programming, serialization, persistence, logging, performance,
scalability, testing, and concurrency.

The tutorial aims at programmers with some Haskell experience. It is
not necessary to be an Haskell expert, but you should know how to
write functions and data types.

For more details, see

Registration page: https://regmaster4.com/2014conf/ICFP14/register.php

Please distribute this call for participation.

See you in Gothenburg!
Huibiao Zhu | 21 Jul 21:45 2014





TASE 2014: 8th Theoretical Aspects of Software Engineering Symposium


1-3 September 2014, Changsha, China







Modern society is increasingly dependent on software systems that are becoming larger and more complex. This poses new challenges to the various aspects of software engineering, for instance, software dependability in trusted computing, interaction with physical components in cyber physical systems, distribution in cloud computing applications, etc. Hence, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2014 aims to provide a forum for people from academia and industry to communicate their latest results on theoretical advances in software engineering. TASE 2014 is the 8th in the TASE series. The past TASE symposiums were successfully held in Shanghai ('07), Nanjing ('08), Tianjin ('09), Taipei ('10), Xi'an ('11), Beijing ('12), Birmingham ('13). The proceedings of the TASE 2014 symposium will be published by the IEEE Computer Society Press.





TASE 2014 will be held at Yannian Century Hotel, Changsha, China. Changsha is the capital and largest city of Hunan province in south-central China, located on the lower reaches of the Xiang River, a branch of the Yangtze River. Read more about Changsha at: http://wikitravel.org/en/Changsha





Registration fees and deadlines are detailed below.  

 Type       Deadline               Fees

 Early     By July 10         RMB 4000(USD 650)

 Late     After July 10       RMB 4600(USD 750)

Student   Anytime       RMB 3000(USD 500)


The details of registration can be found at: http://www.nudt.edu.cn/tase2014/reg.htm






Jifeng He (East China Normal University, China)



Ji Wang (National University of Defense Technology, China)

Martin Leucker (University of Lubeck, Germany)



Keijiro Araki (Kyushu University, Japan)

Shengchao Qin (Teesside University, UK)

Jifeng He (East China Normal University, China)

Huibiao Zhu (East China Normal University, China)

Michael Hinchey (Lero, Ireland)


Wei Dong (National University of Defense Technology, China)





- Klaus Havelund (NASA JPL, USA)

Data Automata in Scala

- Axel Legay (INRIA, France)

 PLASMA-lab: a Flexible, Distributable Statistical Model Checking Library

- Kwangkeun Yi (Seoul National University, Korea)

 Sound, Precise, and Scalable Static Analysis





More information about TASE 2014 is available from the symposium web site: http://www.nudt.edu.cn/tase2014/


Haskell mailing list
Haskell <at> haskell.org
Stefan Wehr | 14 Jul 17:15 2014

ANN: HacBerlin - Haskell Hackathon in Berlin, 26-28 Sep 2014

Dear Haskellers,

another Haskell Hackathon is waiting for you!

Where: Berlin, Germany
When:  Fri 26 - Sun 28 September 2014

Meet in Berlin, discuss, hack together and improve the Haskell
infrastructure. We welcome all programmers interested in Haskell,
beginners and experts!

For all details, visit our wiki page
(http://www.haskell.org/haskellwiki/HacBerlin2014) and make sure to
register early.

By the way: we are currently looking for one or two keynote talks. If you
feel qualified, please let us know.

Happy hacking,
Sebastian Erdweg | 14 Jul 16:30 2014

Call for Talk Proposals: Parsing <at> SLE


Second Workshop on 
Parsing <at> SLE 2014

September 14, 2014
Västerås, Sweden
Co-located with ASE, SLE, and GPCE


Deadline for talk proposals: July 25, 2014

The goal of this workshop is to bring together today's experts in the fields of
parser construction and parser application from across the diverse application
areas. Participants will present ongoing work as well as explore the challenges
that lie ahead. By bringing the whole community together (a rare occurrence,
given the diversity of domain-specific conferences/workshops), we aim to forge
new collaborations inspired by a wide-ranging collection of talks on
parsing-related topics.

*** Topics ***

While parsing and parser generation, both in theory and in practice, are mature
topics, there are challenging problems with respect to the construction,
maintenance, optimization, and application of parsers in real-world scenarios.

Especially in the context of real programming languages there are ample
theoretical as well as practical obstacles to be overcome. Contemporary parsing
challenges are caused by programming-language evolution and diversity in the
face of new application areas such as IDE construction, reverse engineering,
software metrics, domain specific (embedded) languages, etc. What are modular
meta-formalisms for parser generation? How to obtain (fast and correct) parsers
for both legacy and new languages that require more computational power than
context-free grammars and regular expressions can provide? How to enable the
verified construction or prototyping of parsers for languages such as COBOL, C++
and Scala without years of effort?

In addition to the traditional programming-language applications of parsing
technology, several other areas of computing also depend heavily on
parsers. Examples include computational linguistics, network traffic
classification, network security, and bioinformatics. Those areas often have
their own unusual requirements, such as: speed (e.g. in network algorithmics),
memory efficiency (e.g. embedded devices for networks, but also computational
linguistics), or rapid/dynamic parser construction (e.g. in network traffic
classification and in bioinformatics) as grammars are adapted. We specifically
encourage talk proposals on parsing challenges and solutions in these
non-traditional areas.

*** Call for Submissions ***

We solicit talk proposals in the form of short abstracts (max. 2 pages in ACM
2-column format). A good talk proposal describes an interesting position,
demonstration, or early achievement. The submissions will be reviewed on
relevance and clarity, and used to plan the mostly interactive sessions of the
workshop day. Publication of accepted abstracts and slides on the website is

* Deadline for talk proposals: July 25, 2014
* Workshop: September 14, 2014
* Notification: August 6, 2014
* Submission website: https://www.easychair.org/conferences/?conf=parsingsle2014

*** Workshop Organization ***


* Sebastian Erdweg, TU Darmstadt, Germany
* Bruce Watson, FASTAR, Stellenbosch University, South Africa
Levent Erkok | 12 Jul 21:49 2014

[ANNOUNCE] New release of SBV (v3.1)

I'm pleased to announce v3.1 release of SBV, a library for integrating SMT solvers into Haskell.

This release coincides with GHC 7.8.3: A a prior bug in the 7.8 series caused SBV to crash under heavy load. GHC 7.8.3 fixes this bug; so if you're an SBV user, please upgrade to both GHC 7.8.3 and your version of SBV.

Also new in this release are two oft-requested features:

- Parallel solving capabilities: Using multiple SMT solvers at the same time to get the fastest result (speed), or get all results (to make sure they all behave the same way, safety). 

- A variant of symbolic if-then-else (called sBranch) that can call the external solver during simulation before it symbolically simulates "then" and "else" branches. This is useful for programming with recursive functions where termination depends on symbolic values.

As usual, bug reports and feedback are most welcome!

Haskell mailing list
Haskell <at> haskell.org
José Pedro Magalhães | 12 Jul 11:59 2014

Call for participation: Workshop on Generic Programming

                         CALL FOR PARTICIPATION

                               WGP 2014

            10th ACM SIGPLAN Workshop on Generic Programming
                          Gothenburg, Sweden
                        Sunday, August 31, 2014


                          Co-located with the
    International Conference on Functional Programming (ICFP 2014)

Generic programming is about making programs more adaptable by making
them more general. Generic programs often embody non-traditional kinds
of polymorphism; ordinary programs are obtained from them by suitably
instantiating their parameters. In contrast with normal programs, the
parameters of a generic program are often quite rich in structure; for
example they may be other programs, types or type constructors, class
hierarchies, or even programming paradigms.

Generic programming techniques have always been of interest, both to
practitioners and to theoreticians, and, for at least 20 years,
generic programming techniques have been a specific focus of research
in the functional and object-oriented programming communities. Generic
programming has gradually spread to more and more mainstream
languages, and today is widely used in industry. This workshop brings
together leading researchers and practitioners in generic programming
from around the world, and features papers capturing the state of the
art in this important area.


09:00 Welcome
Session 1
09:10 Bruno C. d. S. Oliveira. Functional Programming, Object-Oriented Programming and Algebras! (invited talk)
10:00 Coffee break
Session 2
10:30 Larry Diehl and Tim Sheard. Generic Constructors and Eliminators from Descriptions
11:00 Thomas Williams, Pierre-Évariste Dagand and Didier Rémy. Ornaments in Practice
11:30 Matthew Roberts and Tony Sloane. Type Inference for the Spine View of Data
12:00 Lunch
Session 3
14:00 Alexander Slesarenko, Alexander Filippov and Alexey Romanov. First-class Isomorphic Specialization by Staged Evaluation
14:30 Sam Lindley. Algebraic Effects and Effect Handlers for Idioms and Arrows
15:00 Larisse Voufo, Marcin Zalewski and Andrew Lumsdaine. Scoping Rules on a Platter – A Framework for Understanding and Specifying Name Binding
15:30 Tea break
Session 4
16:00 Patrick Bahr. Composing and Decomposing Data Types – A Closed Type Families Implementation of Data Types à la Carte
16:30 Edsko de Vries and Andres Löh. True Sums of Products
17:00 End


You can register via the ICFP 2014 registration:

Early registration deadline is 3 August.

Program Committee

José Pedro Magalhães (co-chair), University of Oxford
Tiark Rompf (co-chair), Oracle Labs & EPFL
Peter Achten, Radboud University Nijmegen
Nada Amin, Ecole Polytechnique Fédérale de Lausanne (EPFL)
Pierre-Évariste Dagand, INRIA Paris-Rocquencourt
Fritz Henglein, University of Copenhagen
Andrew Lumsdaine, Indiana University
Alexander Slesarenko, Huawei Labs & Keldysh Institute of Applied Mathematics (KIAM)
Anthony M. Sloane, Macquarie University
Wouter Swierstra, Utrecht University
Meng Wang, Chalmers University of Technology

WGP Steering Committee

Shin-Cheng Mu (chair)
Jaako Järvi
Andres Löh
Ronald Garcia
Jacques Carette
Jeremiah Willcock
Tim Sheard
Stephanie Weirich
Tarmo Uustalu

Haskell mailing list
Haskell <at> haskell.org
Jacob Johannsen | 12 Jul 00:00 2014

PPDP 2014 Call for Participation



			      PPDP 2014
		   16th International Symposium on
	  Principles and Practice of Declarative Programming
		Canterbury, Kent, September 8-10, 2014
                           co-located with

			     LOPSTR 2014
		   24th International Symposium on
	   Logic-Based Program Synthesis and Transformation
		Canterbury, Kent, September 9-11, 2014


Registration is now open:

A significant discount is available when registering to both events,
especially as a student (until August 8).

PPDP 2014 features
* an invited talk by Roberto Giacobazzi, shared with LOPSTR:
   "Obscuring Code -- Unveiling and Veiling Information in Programs"
* no fewer than 4 distilled tutorials by
   - Henrik Nilsson and Ivan Perez:
     "Declarative Game Programming"
   - Danko Ilik:
     "Proofs in Continuation-Passing Style:
      normalization of Gödel's System T extended with sums and
      delimited control operators"
   - Jerzy Karczmarczuk:
     "On the Declarative Structure of Quantum Concepts:
      States and Observables"
   - Ralf Laemmel, Andrei Varanovich, and Martin Leinberger:
     "Declarative Software Development"
* a rich program of 22 contributed research talks
* the most influential paper 10-year award for PPDP 2004

Also, please note a change of dates: LOPSTR will start on September 9,
rather than September 10 as previously announced.

Hope to see you in Canterbury.
Austin Seipp | 11 Jul 15:40 2014

ANNOUNCE: GHC version 7.8.3

    The (Interactive) Glasgow Haskell Compiler -- version 7.8.3

The GHC Team is pleased to announce a new patchlevel release of GHC, 7.8.3.

This is an important bugfix release relative to 7.8.2 (with over 50
defects fixed), so we
highly recommend upgrading from the previous 7.8 releases.

The full release notes are here:


How to get it

The easy way is to go to the web page, which should be self-explanatory:


We supply binary builds in the native package format for many
platforms, and the source distribution is available from the same

Packages will appear as they are built - if the package for your
system isn't available yet, please try again later.


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:


Ports to other platforms are possible with varying degrees of
difficulty.  The Building Guide describes how to go about porting to a
new platform:



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:


Mailing lists

We run mailing lists for GHC users and bug reports; to subscribe, use
the web interfaces at


There are several other haskell and ghc-related mailing lists on
www.haskell.org; for the full list, see


Some GHC developers hang out on #haskell on IRC, too:


Please report bugs using our bug tracking system.  Instructions on
reporting bugs can be found here:


Hashes & Signatures

Included in this email is a signed copy of the SHA256 hashes for the
tarballs, using my GPG key (keyid 0x3B58D86F).



Austin Seipp, Haskell Consultant
Well-Typed LLP, http://www.well-typed.com/
Attachment (SHA256SUMS): application/octet-stream, 3963 bytes
Attachment (SHA256SUMS.sig): application/octet-stream, 1130 bytes
Haskell mailing list
Haskell <at> haskell.org