Write a Blog >>
ICFP 2020
Thu 20 - Fri 28 August 2020

The HOPE workshop series are intended to bring together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. They are informal, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. They are dedicated to John Reynolds, whose work is an inspiration to us all.

The 8th ACM SIGPLAN Workshop on Higher-Order Programming with Effects will take place on Sunday, August 23, 2020, that is, the day before ICFP 2020.

HOPE on YouTube

All talks are available on YouTube. Please see the ACM’s HOPE playlist.

Invited speaker

Paul Blain Levy, University of Birmingham.

Covid-19 updates

1) Due to the Covid-19 pandemic, HOPE will take place online only.

2) After a hiatus of 1 year, we were hoping to use submission and participation data as surrogate measure for the community of, and the need for, the HOPE workshop. Since the Covid-19 situation may well skew those numbers, please do get in touch with the PC chairs with any input about the future of HOPE.

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 code harder to build, maintain, and reason about. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help “tame” or “encapsulate” effects (e.g. monads and handlers, 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 made available online.

Previous Editions

This is the 8th edition of the HOPE workshop.

The 7th edition of the workshop was held in St. Louis, Missouri, in September 2018

The 6th edition of the workshop was held in Oxford, United Kingdom, in September 2017

The 5th edition of the workshop was held in Nara, Japan, in September 2016.

The 4th edition of the workshop was held in Vancouver, Canada, in August 2015.

The 3rd edition of the workshop was held in Gothenburg, Sweden, in August 2014.

The 2nd edition of the workshop was held in Boston, Massachusetts, in September 2013.

The 1st edition of the workshop was held in Copenhagen, Denmark, in September 2012.

You're viewing the program in a time zone which is different from your device's time zone change time zone

Sun 23 Aug

Displayed time zone: Eastern Time (US & Canada) change

08:00 - 11:30
Keynote and Session 1HOPE at HOPE
08:00
60m
Keynote
Variants of call-by-push-value
HOPE
Paul Blain Levy University of Birmingham
09:15
45m
Talk
Kripke open relations and operational game semantics
HOPE
Guilhem Jaber Université de Nantes, Andrzej Murawski University of Oxford
10:00
45m
Talk
Merging coeffect production into effect handling
HOPE
Tarmo Uustalu Reykjavik University, Tallinn University of Technology, Niels Voorneveld Tallinn University of Technology
10:45
45m
Talk
Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming
HOPE
Patrick Bahr IT University of Copenhagen, Christian Uldal Graulund IT University of Copenhagen, Rasmus Ejlers Møgelberg IT University of Copenhagen
12:00 - 14:00
Session 2HOPE at HOPE
12:00
45m
Talk
Higher-order Programming with Effects and Handlers — without First-Class Functions
HOPE
Jonathan Immanuel Brachthäuser University of Tübingen, Germany, Philipp Schuster University of Tübingen, Germany
12:45
45m
Talk
Towards Highly Symmetric Effects and Coeffects and a Systematic Separation between the Extra- and Intra-Logical
HOPE
Ingo Skupin University of Tübingen, Julian Jabs University of Tübingen, David Binder University of Tübingen
File Attached
14:30 - 16:00
Session 3HOPE at HOPE
14:30
45m
Talk
Effectful Improvement Theory
HOPE
Martin Ceresa UNR - CIFASIS - CONICET
15:15
45m
Talk
Alef: A bidirectional effect system for algebraic effects.
HOPE
Antonio Locascio Universidad Nacional de Rosario

Call for Papers

We solicit proposals for contributed talks. We recommend preparing proposals of at most 2 pages, in either plain text or PDF format. However, we will accept longer proposals or submissions to other conferences, under the understanding that PC members are only expected to read the first two pages of such longer submissions. When submitting talk proposals, authors 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, Filip Sieczkowski (efes@cs.uni.wroc.pl) and Ohad Kammar (ohad.kammar@ed.ac.uk).