Study of the Subtyping Machine of Nominal Subtyping with Variance
Virtual
Thu 21 Oct 2021 21:50 - 22:05 at Zurich D - Types - mirror Chair(s): Wei-Ngan Chin
This is a study of the computing power of the subtyping machine behind
Kennedy and Pierce's nominal subtyping with variance.
We depict the lattice of fragments of Kennedy and Pierce's type system and characterize
their computing power in terms of
regular, context-free, deterministic, and non-deterministic tree languages.
Based on the theory, we present Treetop—a generator of C#
implementations of subtyping machines.
The software artifact constitutes the first feasible (yet POC) fluent API generator
to support context-free API protocols in a decidable type system fragment.
Ori Roth is a PhD student at the Technion—Israel Institute of Technology. His research interests include programming languages, software engineering, and automata theory.
Thu 21 OctDisplayed time zone: Central Time (US & Canada) change
13:50 - 15:10 | |||
13:50 15mTalk | Study of the Subtyping Machine of Nominal Subtyping with Variance OOPSLA Ori Roth Technion DOI Pre-print Media Attached | ||
14:05 15mTalk | Label Dependent Lambda Calculus and Gradual TypingVirtual OOPSLA Weili Fu University of Edinburgh, Fabian Krause University of Freiburg, Peter Thiemann University of Freiburg, Germany DOI | ||
14:20 15mTalk | Relational Nullable Types with Boolean UnificationVirtual OOPSLA DOI | ||
14:35 15mTalk | Type Stability in Julia: Avoiding Performance Pathologies in JIT CompilationIn-Person OOPSLA Artem Pelenitsyn Northeastern University, Julia Belyakova Northeastern University, Benjamin Chung Northeastern University, Ross Tate Cornell University, Jan Vitek Northeastern University; Czech Technical University DOI Pre-print Media Attached | ||
14:50 20mLive Q&A | Discussion, Questions and Answers OOPSLA | ||
21:50 - 23:10 | |||
21:50 15mTalk | Study of the Subtyping Machine of Nominal Subtyping with Variance OOPSLA Ori Roth Technion DOI Pre-print Media Attached | ||
22:05 15mTalk | Label Dependent Lambda Calculus and Gradual TypingVirtual OOPSLA Weili Fu University of Edinburgh, Fabian Krause University of Freiburg, Peter Thiemann University of Freiburg, Germany DOI | ||
22:20 15mTalk | Relational Nullable Types with Boolean UnificationVirtual OOPSLA DOI | ||
22:35 15mTalk | Type Stability in Julia: Avoiding Performance Pathologies in JIT CompilationIn-Person OOPSLA Artem Pelenitsyn Northeastern University, Julia Belyakova Northeastern University, Benjamin Chung Northeastern University, Ross Tate Cornell University, Jan Vitek Northeastern University; Czech Technical University DOI Pre-print Media Attached | ||
22:50 20mLive Q&A | Discussion, Questions and Answers OOPSLA | ||
