PLDI 2022 (series) / SIGPLAN Track /
(OOPSLA 2021) Study of the subtyping machine of nominal subtyping with variance
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.
https://dl.acm.org/doi/abs/10.1145/3485514
this URL might only work when visiting from a https://dl.acm.org/doi/abs/10.1145/3485514 URL.
this URL might only work when visiting from a https://dl.acm.org/doi/abs/10.1145/3485514 URL.
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 16 JunDisplayed time zone: Pacific Time (US & Canada) change
Thu 16 Jun
Displayed time zone: Pacific Time (US & Canada) change
13:30 - 14:50 | |||
13:30 20mTalk | (ICFP 2020) Kinds Are Calling Conventions SIGPLAN Track Paul Downen University of Massachusetts Lowell, Zena M. Ariola University of Oregon, Simon Peyton Jones Microsoft Research, Richard A. Eisenberg Tweag Link to publication DOI Authorizer link Pre-print | ||
13:50 20mTalk | (OOPSLA 2021) Study of the subtyping machine of nominal subtyping with variance SIGPLAN Track Ori Roth Technion Link to publication DOI Authorizer link Pre-print | ||
14:10 20mTalk | (POPL 2021) Fully Abstract from Static to Gradual SIGPLAN Track | ||
14:30 20mTalk | (POPL 2021) On the Semantic Expressiveness of Recursive Types SIGPLAN Track | ||
