HOPE is a new workshop that is intended to bring 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. This 1st edition of HOPE is dedicated to John Reynolds, whose work is an inspiration to us all.


There were 21 talk submissions, of extraordinarily high quality. As the workshop is only one day long, we were only able to accept 13 of them for presentation at the workshop. So there will be 13 contributed talks, but no invited talks or other sessions. We expect this to be a very high-octane workshop!

Please register for HOPE by selecting the "Sunday pass" on the ICFP registration page.

Session 1: Verification
9:00 Modular Specification and Verification of Delegation with SMT Solvers
Ioannis Kassios, Peter Müller
Abstract [txt] | Slides [pdf]
9:30 On Higher-Order Separation Logic for Higher-Order Concurrent Imperative Programs
Kasper Svendsen, Lars Birkedal, Matthew Parkinson
Abstract [txt] | Slides [pdf]
10:00 Verifying an Open Compiler from ML to Assembly
James T. Perconti, Amal Ahmed
Abstract [txt] | Slides [pdf]
10:30 Break
Session 2: Monads and More
11:00 Handlers in Action
Ohad Kammar, Sam Lindley, Nicolas Oury
Abstract [txt] | Slides [pdf]
11:30 Contract Monitoring as an Effect
Zachary Owens
Abstract [txt] | Slides [pdf]
12:00 Hope for a HOPE-theoretic Understanding of Zero-Knowledge
Noam Zeilberger
Abstract [txt] | Slides [svg]
12:30 Lunch
Session 3: Types and Effects
2:00 Koka: A Language with Row-Polymorphic Effect Inference
Daan Leijen
Abstract [txt]
2:30 Effects for Funargs
Jeremy Siek, Michael Vitousek, Jonathan Turner
Abstract [txt] | Slides [pdf]
3:00 Generative Names and Dependent Types
Andrew Pitts
Abstract [txt] | Slides [pdf]
3:30 Break
Session 4: Logical Relations and Parametricity
4:00 Logical Relations for Fine-Grained Concurrency
Aaron Turon, Jacob Thamsborg, Amal Ahmed, Lars Birkedal, Derek Dreyer
Abstract [txt] | Slides [pdf]
4:30 Logical Relations for a Manifest Contract Calculus, Fixed
Taro Sekiyama, Atsushi Igarashi
Abstract [txt] | Slides [pdf]
5:00 Proof-Relevant Logical Relations
Nick Benton, Martin Hofmann, Andrew Kennedy, Vivek Nigam
Abstract [txt] | Slides [pdf]
5:30 Two Theories of Information Hiding
Uday Reddy
Abstract [txt]

Goals of the Workshop

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

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

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

Call for Talk Proposals

We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read.

We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2012@mpi-sws.org.

Deadline for talk proposals:     June 8, 2012 (Friday)
Notification of acceptance:     July 1, 2012 (Sunday)
Workshop:     September 9, 2012 (Sunday)

The submission website is now closed.

Workshop Organization

Program Co-Chairs Amal Ahmed (Northeastern University)
Derek Dreyer (MPI-SWS, Germany)
Program Committee Jim Laird (University of Bath)
Rasmus Møgelberg (IT University of Copenhagen)
Greg Morrisett (Harvard University)
Aleks Nanevski (IMDEA Software Institute)
David Naumann (Stevens Institute of Technology)
Matthew Parkinson (Microsoft Research Cambridge)
François Pottier (INRIA Rocquencourt)
Amr Sabry (Indiana University)
Eijiro Sumii (Tohoku University)
Nikhil Swamy (Microsoft Research Redmond)
Nobuko Yoshida (Imperial College London)
Imprint | Data Protection