|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Polymorphism, subtyping and type inference in MLsub
If you have a question about this talk, please contact Dominic Mulligan.
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.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsFeatured talks Well-being Institute Seminars NanoScience Seminar
Other talksLiving in Happiness - Spirituality in Daily Life series Variable epigenetic silencing of the repeat genome: implications for non-genetic inheritance Thinking religion today with Gandhi Poetic electrons: Ted Hughes and the mayfly Can perinatal mental health care prevent mental health problems in children? Railway induced ground vibrations: hybrid predictions combining experimental measurements and numerical models