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 10th ACM SIGPLAN Workshop on Higher-Order Programming with Effects will take place on Sunday, September 11, 2022, that is, the day before ICFP 2022.
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.
This is the 10th edition of the HOPE workshop.
The 9th edition of the workshop was held online due to the Covid-19 pandemic, but would otherwise have been held in Seoul, South Korea, in August 2021.
The 8th edition of the workshop was held online due to the Covid-19 pandemic, but would otherwise have been held in Jersey City, New Jersey, in August 2020.
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.
Sun 11 SepDisplayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
08:00 - 09:00
Catering & social
09:00 - 10:30
|Lift Inference for Lexical Effect Handlers with Second-Class Functions|
|Higher order programming with probabilistic effects: A model of stochastic memoization and name generation|
|Effect Handlers in Scope, EvidentlyVirtual|
10:30 - 11:00
Catering & social
11:00 - 12:30
|Relative Monads in CBPV for Stack-based Effects|
Max New University of Michigan
|Temporal refinements for Call-By-Push-Value with fixpoint|
Guilhem Jaber University of Nantes, Kenji Maillard Inria Nantes & University of Chile, Colin Riba LIP - ENS de LyonFile Attached
|On Reinforcement Learning, Effect Handlers, and the State Monad|
14:00 - 15:30
|Flexibly graded monads and graded algebras|
|Monadic Semantics of Bidirectional Effects|
15:30 - 16:00
Catering & social
16:00 - 17:30
|Dependent Temporal Type-and-Effect System with Delimited Continuations|
|Enabling Safe Shared-Memory Interoperability in WebAssemblyVirtual|
|Verifying non-terminating programs with IO in F*|
Cezar-Constantin Andrici MPI-SP, Theo Winterhalter MPI-SP, Cătălin Hriţcu MPI-SP, Exequiel Rivas Tallinn University of TechnologyPre-print File Attached
Not scheduled yet
|Not scheduled yet|
|Quantitative and Metric Rewriting: Abstract and Linear Systems|
Call for Talk Proposals
We solicit proposals for contributed talks. We recommend preparing proposals of at most 2 pages excluding references, 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 around 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, Daniel Hillerström (firstname.lastname@example.org) and Oleg Kiselyov (email@example.com).
We offer in-person as well as virtual participation for HOPE. Virtual attendees and presenters can find more information about virtual participation and preparation of video materials on the general ICFP virtual participation page.