LFCS seminar: Stephen Dolan: Polymorphism, subtyping and type inference in MLsub
—
filed under:
LFCS Seminar,
Upcoming events
| What |
|
|---|---|
| When |
Nov 08, 2016 from 04:00 PM to 05:00 PM |
| Where | IF 4.31/4.33 |
| Add event to calendar |
vCal
iCal
|
We present a type system combining subtyping and ML-style parametric
polymorphism. Unlike previous work, our system supports type inference
and has compact principal types. We demonstrate this system in the
minimal language MLsub, which types a strict superset of core ML
programs.
This is made possible by keeping a strict separation between the types
used to describe inputs and those used to describe outputs, and
extending the classical unification algorithm to handle subtyping
constraints between these input and output types. Principal types are
kept compact by type simplification, which exploits deep connections
between subtyping and the algebra of regular languages. An
implementation is available online.
LFCS seminar: Danupon Nanongkai: Challenges in distributed shortest paths algorithms
Congratulations to Perdita Stevens who has received a prestigious award (10-year most influential paper, from the MODELS conference)
