Frozen inference constraints for type-directed disambiguation
We present work-in-progress on type inference in presence of type-directed name disambiguation (where an ambiguous name is resolved using type information), following the approach of constraint-based type inference.
Our specific goal is to implement inference for OCaml sum/variant constructor disambiguation, and our approach is to introduce ``frozen constraint'', a more general constraint mechanism. We have a prototype implementation of frozen constraints in the Inferno library, and discuss the implementation and meta-theoretical challenges.
Fri 27 AugDisplayed time zone: Seoul change
01:30 - 03:00
|Frozen inference constraints for type-directed disambiguation|
MLPre-print Media Attached
|Experience Report: Domain Modeling with F# (short talk)|
Scott Wlaschin NoneMedia Attached File Attached
|Isomorphisms are back! (short talk)|
|Sylvester: Unified, typed, notation for symbolic mathematics and proofs (short talk)|
Allister Beharry NoneMedia Attached File Attached
|A Data-centered User Study for jsCoq (short talk)|
Hanneli Tavante McGill UniversityFile Attached