2026-05-29

[Caml-list] Summer School on Verification Technology, Systems & Applications

================================================================== First Call for Participation 14th International Summer School on Verification Technology, Systems & Applications http://www.mpi-inf.mpg.de/vtsa26/ The 18th edition of the Summer School on Verification Technology, Systems and Applications (VTSA) will be organized by the Max-Planck-Institute for Informatics Saarbruecken in cooperation with the University of Liege, Inria Nancy - Grand Est, and the University of Luxembourg. The school will take place from August 24 to August 28, 2026 on Saarland Informatics Campus, Saarbruecken, Germany. The following speakers have accepted to give courses at VTSA 2026: - Maria Paola Bonacina: Reasoning about Data Structures with CDSAT - Mathias Fleury: SAT Solving: 30 Years of CDCL, 20 Years of Proofs, 15 Years of Inprocessing, 3 Years of User Propagator - Mikoláš Janota: SMT Solving and Challenges and Opportunities - Cynthia Kop: Open-world Termination Analysis in a Small Functional Language - Christoph Scholl: Fully Automatic Formal Verification of Arithmetic Circuits Participation is free (except for travel and accommodation costs) and open to anybody holding at least a bachelor degree or equivalent in computer science. It includes the lectures, daily coffee breaks and lunches as well as a school dinner. Attendance is limited to 40 participants. Please apply electronically by sending an email to jmueller@mpi-inf.mpg.de: - a one-page CV, - an application letter explaining your interest in the school and your experience in the area, - a copy of your bachelor certificate (or equivalent or a more significant certificate), - a short statement if you want to contribute to the student sessions The deadline for application is July 5, 2026. Notification of acceptance will be given by July 10, 2026. Full details are available at http://www.mpi-inf.mpg.de/vtsa26/

2026-05-26

[Caml-list] Attn: Development Editor, Latest OCaml Weekly News

OCaml Weekly News

Previous Week Up Next Week

Hello

Here is the latest OCaml Weekly News, for the week of May 19 to 26, 2026.

Dune 3.23

Continuing this thread, Shon announced

The Dune team is pleased to announce the release of dune 3.23.1.

This is a patch release consisting of the following bug fixes.

If you encounter a problem with this release, please report it in our issue tracker.

Fixed

  • Fix the menhir opam dependency injection introduced in 3.23. Dune now only fills in the lower bound {>= "20180523"} on an existing user-declared menhir dependency; it no longer adds menhir as a new dependency to packages that did not declare it themselves. (#14434, fixes #14428, @robinbb)
  • Gate the dune version-bound deduplication in generated opam files (introduced in 3.23) on (lang dune 3.23). Projects at earlier lang versions get the prior And [...] shape — e.g. {>= "3.17" & >= "3.20"} — restoring 3.22 behaviour and avoiding a silent change to opam output on dune-binary upgrade. (#14436, @robinbb)
  • Preserve library order when building a shared jsoo standalone runtime. (#14438, @vouillon)
  • Fix the fallback to the secondary compiler, allowing recovering of support for packages with upper bounds on OCaml less than 4.14. Packages depending on dune 3.23.1 or later and with an upper bound on the OCaml compiler that is less than 4.14, will now be able to use the latest dune, but dune will be built with the secondary compiler at version 4.14. (#14443, @Alizter)
  • Fix the bootstrap on NetBSD by including <sys/wait.h> in lev_stubs.c, matching the existing FreeBSD/OpenBSD guard. (#14512, fixes #14484, @0-wiz-0)

Call for Presentations: ML Family Workshop 2026

Benoît Montagu announced

Higher-order, Typed, Inferred, Strict: ML Family Workshop 2026

August 28, 2026

Indianapolis (Co-located with ICFP) + Paris (Co-located with FW'26)

Website: https://icfp26.sigplan.org/home/mlfamilyworkshop-2026

Submission Link: https://ml2026.hotcrp.com/

Submission Deadline: June 24, 2026, AoE

Call for Presentations

ML (originally, "Meta Language") is a family of programming languages that includes dialects known as Standard ML, OCaml, and F#, among others. The development of these languages has inspired a large amount of computer science research, both practical and theoretical.

The ML 2026 workshop will continue the informal approach followed since 2010. Presentations are selected by the program committee from submitted proposals. There are no published proceedings, so contributions may be submitted for publication elsewhere. The main criterion is promoting and informing the development of the entire extended ML family and delivering a lively workshop atmosphere. We particularly encourage talks about works in progress, presentations of negative results (things that were expected to but did not quite work out) and informed positions.

Each presentation should take 20-25 minutes. The exact time will be decided based on scheduling constraints.

Note: this year, the workshop will take place across two events: (1) co-located with ICFP’26, and (2) co-located with FW’26. We will have a single Program Committee to review submissions. Presenters can choose either event to attend in-person. We also encourage remote participation, and plan to facilitate remote presentations.

Scope

We seek presentations on topics including (but not limited to):

  • Language design: abstraction, higher forms of polymorphism, concurrency and parallelism, distribution and mobility, staging, extensions for semi-structured data, generic programming, object systems, etc.
  • Implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, foreign function interfaces, etc.
  • Type systems: inference, effects, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc.
  • Applications: case studies, experience reports, pearls, etc.
  • Environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc.
  • Semantics of ML-family languages: operational and denotational semantics, program equivalence, parametricity, mechanization, etc.

We specifically encourage reporting what did not meet expectations or what, despite all efforts, did not work to satisfaction.

Four kinds of submissions are solicited: Research Presentations, Experience Reports, Demos, and Informed Positions.

  • Research Presentations: Research presentations should describe new ideas, experimental results, or significant advances in ML-related projects. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. These presentations should be structured in a way which can be, at least in part, of interest to (advanced) users.
  • Experience Reports: Users are invited to submit Experience Reports about their use of ML and related languages. These presentations do not need to contain original research but they should tell an interesting story to researchers or other advanced users, such as an innovative or unexpected use of advanced features or a description of the challenges they are facing or attempting to solve.
  • Demos: Live demonstrations or short tutorials should show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or applications built on or related to ML and related languages. (You will need to provide all the hardware and software required for your demo; the workshop organizers are only able to provide a projector.)
  • Informed Positions: A justified argument for or against a language feature. The argument must be substantiated, either theoretically (e.g., by a demonstration of (un)soundness, an inference algorithm, a complexity analysis), empirically or by substantial experience. Personal experience is accepted as justification so long as it is extensive and illustrated with concrete examples.

Submission details

Submissions must be in the PDF format and have a short summary (abstract) at the beginning. Submissions in the categories of Experience Reports, Demos, or Informed Positions should indicate so in the title or subtitle. The point of the submission should be clear from its two first pages (PC members are not obligated to read any further.)

Submissions must be uploaded to the workshop submission website before the submission deadline.

Only the short summary/abstract of accepted submissions will be published on the conference website. After acceptance, authors will have the opportunity to attach or link to that summary any relevant material (such as the updated submission, slides, etc.)

Submission Website: https://ml2026.hotcrp.com/

Workshop Website: https://icfp26.sigplan.org/home/mlfamilyworkshop-2026

Dates and Deadlines

Submission Deadline: Wednesday, June 24 AoE

Initial Author Notification (most cases): Thursday, July 23

Final Author Notification (if needed): Thursday, July 30

Workshop Date: Friday, August 28

Program Committee

  • Benoît Montagu (Inria, France)
  • Gabriel Scherer (Inria, France)
  • Sam Westrick (New York University, United States)
  • Clément Blaudeau (Inria, France)
  • Richard A. Eisenberg (Jane Street, United States)
  • Kavon Farvardin (Apple, United States)
  • Kiran Gopinathan (Basis, United States)
  • Magnus Madsen (Aarhus University, Denmark)
  • Alexandre Moine (New York University, United States)
  • Dominic Orchard (University of Cambridge; University of Kent, United Kingdom)
  • Lionel Parreaux (HKUST (The Hong Kong University of Science and Technology), Hong Kong SAR China)
  • Gabriel Radanne (Inria, France)
  • Takafumi Saikawa (Nagoya University, Japan)
  • Milla Valnet (Sorbonne Université, France)
  • Michael Vollmer (University of Kent, United Kingdom)
  • Ningning Xie (University of Toronto, Canada)
  • Yizhou Zhang (University of Waterloo, Canada)

Coordination with the OCaml Users and Developers Workshop

The OCaml workshop is seen as more practical and is dedicated in significant part to OCaml community building and the development of the OCaml system. In contrast, the ML family workshop is not focused on any language in particular, is more research-oriented, and deals with general issues of ML-style programming and type systems. There is some overlap, which we are keen to explore in various ways. The authors who feel their submission fits both workshops are encouraged to mention it at submission time or contact the program chairs.

ocaml-halo 0.1 – Performance oriented HTTP 1.1 server built on top of libuv

Firgeis announced

Hi community, I'm happy to announce the first "alpha" release of ocaml-halo, a performance oriented Ocaml HTTP 1.1 server.

The main idea behind this server is keep the performance sensitive parts of an HTTP in C, leveraging Effects to ease the transition between the boundary of FFI and ocaml resolvers.

Features

  • Full HTTP 1.1 spec
  • SSL/TLS enabled
  • Streaming
  • Performance, currently on par with with Go frameworks like gin-gonic

dead_code_analyzer 1.1.1 and 1.2.0

fantazio announced

Hello everyone,

I am happy to announce 2 releases of the dead_code_analyzer (available via opam) :

  • Release 1.1.1 includes a number of bug fixes and strengthens semantics. It also improves the user documentation by describing each report section, their usage and limitations with examples. This release is compatible with OCaml 5.2.
  • Release 1.2.0 is an update of 1.1.1, compatible with OCaml 5.3. The analyzer now takes .cmti and .cmt files as input instead of .cmi and .cmt. You may notice a larger memory consumption (more information available here).

I addition to these releases, a version compatible with OCaml 4.14 is available on my fork.

Thanks to the OCaml Software Foundation its funding!

If you encounter any issue with these releases, please report it on the github repository. Feedback and contributions are welcome.

Old CWN

If you happen to miss a CWN, you can send me a message and I'll mail it to you, or go take a look at the archive or the RSS feed of the archives.

If you also wish to receive it every week by mail, you may subscribe to the caml-list.

2026-05-25

[Caml-list] [2nd CFP] HOPE'26: ACM SIGPLAN Workshop on Higher-Order Programming with Effects

********************************************************************** 2nd Call for Proposals - HOPE 2026 ********************************************************************** TL;DR: Talk proposal deadline for HOPE 2026 is on May 29, 2026. This year, the workshop will be co-located with ICFP'26 (Indiana, US) and FW'26 (Paris, France) ---------------------------------------------------------------------- HOPE 2026 The 14th ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 24, 2026 (the day before ICFP 2026) https://icfp26.sigplan.org/home/hope-2026 HOPE 2026 aims 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. ---------------------- 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 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, Taro Sekiyama (tsekiyama@acm.org) and Francesco Gavazzo (francesco.gavazzo@unipd.it). Important Note: HOPE’26 will be co-located with ICFP’26 (https://icfp26.sigplan.org/) and FW’26 (https://www.irif.fr/~scherer/events/fpw-2026/announce.html). Presenters can choose either event to attend in-person. We also encourage remote participation and will support remote presentations. Deadline for talk proposals: May 29, 2026 (Friday) Notification of acceptance: June 26, 2026 (Friday) Workshop: August 24, 2026, Indiana, United States & Paris, France (tentatively) The submission website is now open: https://hope26.hotcrp.com --------------------- Workshop Organization --------------------- Program Committee: Yuyan Bao (Augusta University) Raphaëlle Crubillé (Aix-Marseille University) Francesco Dagnino (University of Genova) Elena di Lavore (University of Oxford) Francesco Gavazzo (University of Padua) Cristina Matache (University of Edinburgh) Ken Sakayori (The University of Tokyo) Taro Sekiyama (National Institute of Informatics) Dario Stein (Radboud University) Niels Voorneveld (Cybernetica) Zhixuan Yang (University of Exeter) --------------------- 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. -- Taro Sekiyama

2026-05-20

[Caml-list] IFL 2026 First call for papers

======================================================================= IFL 2026 38th Symposium on Implementation and Application of Functional Languages venue: Aspenäs Herrgård, Gothenburg, Sweden October 28 - 30 2026 https://ifl26.cse.chalmers.se/ ======================================================================= ### Scope The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2026 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. ### Topics of interest Topics of interest to IFL include, but are not limited to: - language concepts - type systems, type checking, type inferencing - compilation techniques - staged compilation - run-time function specialisation - run-time code generation - partial evaluation - (abstract) interpretation - meta-programming - generic programming - automatic program generation - array processing - concurrent/parallel programming - concurrent/parallel program execution - embedded systems - web applications - (embedded) domain specific languages - security - novel memory management techniques - run-time profiling performance measurements - debugging and tracing - virtual/abstract machine architectures - validation, verification of functional programs - tools and programming techniques ### Peer-review process Following IFL tradition, IFL 2026 will use a post-symposium review process for the formal proceedings. Authors are invited to submit draft papers before the symposium. The program chairs will screen submissions for relevance to IFL, and accepted drafts will be shared with all participants. Each accepted paper must be presented at the symposium by at least one author. If submissions exceed capacity, selection will be based on quality, maturity, and relevance. Authors of accepted presentations will have the opportunity to revise their work in response to symposium feedback and submit a full paper to the post-proceedings. These submissions will be reviewed by the program committee for correctness, novelty, originality, relevance, significance, and clarity. The post-symposium review process is single-blind, with at least three reviews per paper. Camera-ready versions may include minor revisions without further review. ### Important dates Submission of draft papers September 4, 2026 Draft papers notification September 11, 2026 Deadline for early registration September 18, 2026 Deadline for late registration September 25, 2026 IFL symposium October 28-30, 2026 Submission of papers for proceedings November 25, 2026 Notification of acceptance February 12, 2027 Camera-ready version March 12, 2027 Deadlines are end of day Anywhere on Earth (UTC-12). ### Submission details All contributions must be written in English. Papers must use the ACM two columns conference format, which can be found at: http://www.acm.org/publications/proceedings-template Submit your paper here: https://easychair.org/conferences/?conf=ifl26 Important note to authors about the new ACM open access publishing model: ACM has introduced a new open access publishing model for the International Conference Proceedings Series (ICPS). Authors based at institutions that are not yet part of the ACM Open program and do not qualify for a waiver will be required to pay an article processing charge (APC) to publish their ICPS article in the ACM Digital Library. To determine whether or not an APC will be applicable to your article, please follow the detailed guidance here: https://www.acm.org/publications/icps/author-guidance Further information: ICPS publishing model FAQ: https://www.acm.org/publications/icps/faq ACM Open program details: https://www.acm.org/publications/openaccess Questions: icps-info@acm.org ### Peter Landin Prize The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. ### Organisation PC Chairs: - Alex Gerdes, Chalmers and University of Gothenburg, Sweden - Koen Claessen, Chalmers and University of Gothenburg, Sweden Publicity Chair: - Mart Lubbers, Radboud University, The Netherlands Local Chairs: - Alex Gerdes, Chalmers and University of Gothenburg, Sweden - Koen Claessen, Chalmers and University of Gothenburg, Sweden Please direct any questions you may have towards alexg@chalmers.se. ### Program committee - Abhiroop Sarkar, ETH Zurich - Andres Löh, Well-Typed LLP - Daan Leijen, Microsoft - Dominic Orchard, University of Kent - Fritz Henglein, DIKU - Graham Hutton, University of Nottingham - Guillaume Allais, University of Strathclyde - Jesper Cockx, Delft University of Technology - Mart Lubbers, Radboud University - Nachiappan Valliappan, University of Edinburgh - Nicolas Wu, Imperial College London - Niki Vazou, IMDEA Software Institute The program committee is still being finalized and may be updated. ### Venue IFL 2026 will be held at Aspenäs Herrgård, just outside Gothenburg, Sweden. Aspenäs Herrgård will host the symposium venue and provide a scenic setting for the conference. We will add more information about the venue, accommodation, and travel options soon. ### Acknowledgments This call-for-papers is an adaptation and evolution of content from previous instances of IFL. We are grateful to prior organisers for their work, which is reused here.

2026-05-19

[Caml-list] PLMW @ ICFP 2026: Funding Call

APPLICATION FOR PLMW TRAVEL FUNDING

Applications for travel funding to PLMW @ ICFP are now open - we will begin awarding funding starting from June 1 AOE until all funding is committed. So long as funding remains, we will continue to consider applications submitted before June 30th AOE.

We advise all interested to apply as soon as possible, especially if a visa is required.


PLMW is a workshop co-located with ICFP 2026 (the International Conference on Functional Programming) in Indanapolis, US, from August 24-29.

The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will bring together world leaders in programming languages research and teaching from academia and industry to help students imagine how they might contribute to our research community. Topics will range from the abstract (e.g., what is PL research and how does one become involved in it) to the concrete (e.g., how to navigate an academic conference, how to pick a research area) as well as technical talks on cutting-edge topics. See the link below for more details:



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.

2026-05-12

[Caml-list] LPAR-26 Call for Papers - The 26th Conference on Logic for Programming, Artificial Intelligence and Reasoning

=============================================================================== LPAR 2026: The 26th Conference on Logic for Programming, Artificial Intelligence and Reasoning Spetses, Greece 25-30 October 2026 =============================================================================== Conference website: https://lpar-26.info Submission link: https://easychair.org/conferences/?conf=lpar2026 Conference program: https://easychair.org/smart-program/LPAR-26/ =============================================================================== Abstract deadline: 3 June 2026 Submission deadline: 17 June 2026 =============================================================================== The International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is an academic conference aimed at discussing cutting-edge results in the fields of automated reasoning, computational logic, programming languages and their applications. Papers from previous proceedings are listed in DBLP. LPAR's slogan is "To boldly go where no reasonable conference has gone before". LPAR brings first class research and researchers to interesting places, and exposes the conference attendees to interesting cultures. The 26th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR-26) will be held on Spetses, Greece, 25-30 October 2026. The proceedings of LPAR-26 will be published by EasyChair, in the EPiC Series in Computing. =============================================================================== Call for Papers Submission Guidelines All papers must be original and not simultaneously submitted to another journal or conference. The following paper categories are welcome: * Regular papers describing solid new research results. They can be up to 15 pages long in EasyChair style, including figures but excluding references and appendices (that reviewers are not required to read). Where applicable, regular papers are supported by experimental validation. * Experimental and tool papers describing implementations of systems, reporting experiments with implemented systems, or comparing implemented systems. They can be up to 8 pages long in in EasyChair style, including figures but excluding references and appendices (that reviewers are not required to read). Experimental and tool papers should be supported by a link to the artifact/ experimental evaluation available to the reviewers. The EasyChair style files are avbailable from: https://easychair.org/publications/for_authors Both types of papers must be electronically submitted in PDF via EasyChair: https://easychair.org/conferences/?conf=lpar2026 The review process is single blind. Authors of accepted papers are required to ensure that at least one of them will be present at the conference. Topics New results in the fields of computational logic and applications are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Topics of interest include, but are not limited to: Abduction, Answer set programming, Automated reasoning, Constraint programming, Computational proof theory, Decision procedures, Description logics, Formalizing mathematics, Foundations of security, Hardware verification, Implementations of logic, Interpolation, Interactive theorem proving, Knowledge representation and reasoning, Logic and computational complexity, Logic and databases, Logic and games, Logic and language models, Logic and machine learning, Logic and the web, Logic and types, Logic in artificial intelligence, Logic programming, Logical foundations of programming, Logics of knowledge and belief, Modal and temporal logics, Model checking, Non-monotonic reasoning, Ontologies and large knowledge bases, Probabilistic and fuzzy reasoning, Program analysis, Rewriting, Satisfiability checking, Satisfiability modulo theories, Software verification, Unification theory. LPAR steering committee Nikolaj Bjorner Microsoft Research Andrei Voronkov The University of Manchester Geoff Sutcliffe University of Miami ===============================================================================

2026-04-29

[Caml-list] [CFP] HOPE'26: ACM SIGPLAN Workshop on Higher-Order Programming with Effects

TL;DR: Talk proposal deadline for HOPE 2026 is on May 29, 2026. This year, the workshop will be co-located with ICFP'26 (Indiana, US) and FW'26 (Paris, France) ---------------------------------------------------------------------- HOPE 2026 The 14th ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 24, 2026 (the day before ICFP 2026) https://icfp26.sigplan.org/home/hope-2026 HOPE 2026 aims 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. ---------------------- 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 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, Taro Sekiyama (tsekiyama@acm.org) and Francesco Gavazzo (francesco.gavazzo@unipd.it). Important Note: HOPE’26 will be co-located with ICFP’26 (https://icfp26.sigplan.org/) and FW’26 (https://www.irif.fr/~scherer/events/fpw-2026/announce.html). Presenters can choose either event to attend in-person. We also encourage remote participation and will support remote presentations. Deadline for talk proposals: May 29, 2026 (Friday) Notification of acceptance: June 26, 2026 (Friday) Workshop: August 24, 2026, Indiana, United States & Paris, France (tentatively) The submission website is now open: https://hope26.hotcrp.com --------------------- Workshop Organization --------------------- Program Committee: Yuyan Bao (Augusta University) Raphaëlle Crubillé (Aix-Marseille University) Francesco Dagnino (University of Genova) Elena di Lavore (University of Oxford) Francesco Gavazzo (University of Padua) Cristina Matache (University of Edinburgh) Ken Sakayori (The University of Tokyo) Taro Sekiyama (National Institute of Informatics) Dario Stein (Radboud University) Niels Voorneveld (Cybernetica) Zhixuan Yang (University of Exeter) --------------------- 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. -- Taro Sekiyama