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.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference30 articles.
1. Introduction to generalized type systems
2. Greibach Normal Form Transformation Revisited
3. SEQUEL
4. H. Comon M. Dauchet R. Gilleron C. Löding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. 2007. Tree Automata Techniques and App.. Available on:. http://tata.gforge.inria.fr/ H. Comon M. Dauchet R. Gilleron C. Löding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. 2007. Tree Automata Techniques and App.. Available on:. http://tata.gforge.inria.fr/
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Type Automata;Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis;2023-07-12
2. Yet Another Generating Method of Fluent Interfaces Supporting Flat- and Sub-chaining Styles;Proceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering;2022-11-29