Study of the Subtyping Machine of Nominal Subtyping with Variance (full version) release_n7p7q2z5wnfd7dtid2skulig6a

by Ori Roth

Released as a article .

2021  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  1.0 MB
file_ibkr5qjoxndv3i6vnf5vp7pqdu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-09-08
Version   v1
Language   en ?
arXiv  2109.03950v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ada884a5-c95d-49c1-9e6a-065bbf5ab805
API URL: JSON