let (rec) insertion without effects, lights or magic
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.
Thu 22 AugDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
10:30 - 12:00
|A right-to-left type system for value recursion|
|let (rec) insertion without effects, lights or magic|
|(TyDe Presentation) FreezeML: Complete and Easy Type Inference for First-Class Polymorphism|