Subtype Polymorphism à la carte via Machine Learning on Dependent Types
The ability to write ‘closed’ frameworks in terms of abstract supertypes and subsequently extend them via contractually-conforming subtypes is a ubiquitous programming paradigm (e.g. underpinning Object-Orientation). While the motivation for such abstraction is to insulate against requirements change, any change of contract requires extensive (typically manual) refactoring, potentially throughout the entire class hierarchy. As an alternative to defining such abstractions a priori, we describe the broad role that Machine Learning can play in inducing abstractions from a pre-existing codebase. Concrete examples are given in which contacts are enforced by dependent types in the Idris language.
Wed 18 Jul Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|16:00 - 16:30|
|16:30 - 17:00|
Artem PelenitsynCzech Technical University in Prague
|17:00 - 17:30|