xThe data center, from which the conference websites are hosted, is currently experiencing power issues. Our colleagues are working hard to resolve the issue and keep downtime to a minimum.
ICFP 2021
Sun 22 - Sat 28 August 2021
Fri 27 Aug 2021 00:00 - 00:30 at Haskell - Paper Session 2

Programmers make assumptions about the order of memory operations, which are not captured in the operations’ types and therefore cannot be enforced statically by a compiler. This can lead programmers to accidentally violate those assumptions if they are not careful. To address this issue, we encode the memory locations that are accessed by a given computation using a graded monad. We use the data flow dependencies which arise from this to construct a type-level graph that we analyse to automatically order the computations so that no dependencies are violated. This also allows for computations which have no dependencies on each other to be run concurrently.

Thu 26 Aug

Displayed time zone: Seoul change

23:30 - 01:00
Paper Session 2Haskell at Haskell
23:30
30m
Talk
Design Patterns for Parser Combinators (Functional Pearl)
Haskell
Jamie Willis Imperial College London, Nicolas Wu Imperial College London, UK
00:00
30m
Talk
Graded Monads and Type-Level Programming for Dependence Analysis
Haskell
Finnbar Keating University of Warwick, Michael Gale University of Warwick, UK
00:30
30m
Talk
Chair Report
Haskell
Jurriaan Hage Utrecht University, Netherlands