Programming with Explicit Effects in ReML
An important aspect of building robust systems that execute on dedicated hardware and perhaps in constrained environments is to control and manage the effects performed by program code.
We present ReML, a higher-order statically-typed functional language, which allows programmers to be explicit about the effects performed by program code and in particular effects related to memory management. Allowing programmers to be explicit about effects and the regions in which values reside makes programs robust to changes in the program source code and to compiler updates, including compiler optimisations.
ReML is integrated with a polymorphic inference system that builds on top of region-inference, as it is implemented in the MLKit, a Standard ML compiler that uses region-based memory management as its primary memory management scheme.
Fri 8 SepDisplayed time zone: Pacific Time (US & Canada) change
14:00 - 15:30 | |||
14:00 30mTalk | Programming with Explicit Effects in ReML Higher-order, Typed, Inferred, Strict: ML Family Workshop Martin Elsman University of Copenhagen, Denmark | ||
14:30 30mTalk | Wasocaml: a compiler from OCaml to WebAssembly (moved from OCaml workshop) Higher-order, Typed, Inferred, Strict: ML Family Workshop | ||
15:00 30mTalk | Layout Polymorphism: Using static computation to allow efficient polymorphism over variable representations Higher-order, Typed, Inferred, Strict: ML Family Workshop Richard A. Eisenberg Jane Street File Attached |