ICFP 2024
Mon 2 - Sat 7 September 2024 Milan, Italy

This program is tentative and subject to change.

Mon 2 Sep 2024 16:30 - 17:00 at Orange 1 - Session 3

We extend a Coq formalization of monadic equational reasoning with a monad to represent typed stores. This leads us to design an original equational theory, that we experimented on a number of examples. The examples themselves are generated from OCaml programs using an experimental compiler from OCaml to Coq, which targets the typed store monad.

Extended abstract (friendly-hope.pdf)247KiB

This program is tentative and subject to change.

Mon 2 Sep

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

16:00 - 17:30
Session 3HOPE at Orange 1
16:00
30m
Talk
Arrows as applicatives in a monad
HOPE
Leo White Jane Street
16:30
30m
Talk
Mechanized monadic equational reasoning for ML references
HOPE
Reynald Affeldt AIST, Jacques Garrigue Nagoya University, Takafumi Saikawa Nagoya University
File Attached
17:00
30m
Talk
Modularizing Reasoning about AI Capabilities via Abstract Dijkstra Monads
HOPE
Cyrus Omar University of Michigan, Anil Madhavapeddy University of Cambridge, UK