University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Polymorphism, subtyping and type inference in MLsub

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Polymorphism, subtyping and type inference in MLsub

Download to your calendar using vCal

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 lists

Orange Boardroom, Maxwell Building, Cavendish Laboratory Faculty of Education, Mary Allan Building room 106, Homerton College, Hills Road, Cambridge CB2 8PQ MR3, CMS, Wilberforce Road, Cambridge, CB3 0WB

Other talks

Title TBC Title to be confirmed Bacterial Physiology During Growth Arrest: Can It Be Targeted by Anti-Bacterial Therapeutics? Title to be confirmed Title TBC Differences between Robin and Neumann eigenvalues
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity