Write a Blog >>
ICFP 2019
Sun 18 - Fri 23 August 2019 Berlin, Germany
Thu 22 Aug 2019 10:55 - 11:20 at Pine - Session 2 Chair(s): Andreas Rossberg

At last year’s ML Family Workshop we presented an interface for let(rec) insertion – i.e. for generating (mutually recursive) definitions. We demonstrated its expressiveness and applications, but not its implementation, which relied on effects and compiler magic.

We now show how one can understand let insertion – and hence, implement it in plain OCaml. We give the first denotational semantics of let(rec)-insertion, which does not rely on any effects at all.

Conference Day
Thu 22 Aug

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

10:30 - 12:00
Session 2ML at Pine
Chair(s): Andreas RossbergDfinity Stiftung
10:30
25m
Talk
A right-to-left type system for value recursion
ML
Alban ReynaudENS Lyon, Gabriel SchererINRIA Saclay, Jeremy YallopUniversity of Cambridge, UK
Pre-print
10:55
25m
Talk
let (rec) insertion without effects, lights or magic
ML
Oleg Kiselyov, Jeremy YallopUniversity of Cambridge, UK
Pre-print
11:20
25m
Talk
(TyDe Presentation) FreezeML: Complete and Easy Type Inference for First-Class Polymorphism
ML
Frank EmrichThe University of Edinburgh, Sam LindleyThe University of Edinburgh and Imperial College London, Jan StolarekUniversity of Edinburgh, UK, James CheneyUniversity of Edinburgh, UK