Since LISP, dynamic languages have supported dynamically checked type annotations. Even in dynamic languages, these annotations are typically static: tests are restricted to checking low-level features of objects and values, such as primitive types or membership of an explicit programmer-defined class.
We propose much more dynamic types for dynamic languages—first-class objects that programmers can customise, that can be composed with other types and depend on computed values—and to use these first-class type-like values as types. In this way programs can define their own conceptual models of types, extending both the kinds of tests programs can make via types, and the guarantees those tests can provide. Building on a comprehensive pattern-matching system and leveraging standard language syntax lets these types be created, composed, applied, and reused straightforwardly, so programmers can use these truly dynamic first-class types to make their programs easier to read, understand, and debug.
Sun 20 Oct
|11:00 - 11:30|
Michael HomerVictoria University of Wellington, Timothy JonesMontoux, James NobleVictoria University of WellingtonPre-print Media Attached
|11:30 - 12:00|
Daniel StolpeHasso-Plattner-Institut, Tim FelgentreffOracle Labs, Potsdam, Christian HumerOracle Labs, Switzerland, Fabio NiephausHasso Plattner Institute, University of Potsdam, Robert HirschfeldHasso-Plattner-Institut (HPI), GermanyPre-print Media Attached
|12:00 - 12:30|
Michael M. VitousekIndiana University, Jeremy G. SiekIndiana University, USA, Avik ChaudhuriFacebook, USAMedia Attached