关于DOT的化学分型
Towards Algorithmic Typing for DOT
摘要:
依赖对象类型(DOT)演算形式化了Scala的关键特性。D $_{<: }$演算是DOT的核心。到目前为止,D $_{<: }$的介绍使用了声明式类型和子类型规则,而不是算法规则。不幸的是,已知全D $_{<: }$的算法类型是一个不可判定的问题。我们探索的D $_{<: }$,具有可判定的类型检查的限制版本的设计空间。即使在这个简化的D $_{<: }$中,由于“坏边界”问题,算法类型化和子类型化也是棘手的。Scala编译器会绕过错误的边界,代价是类型系统的表达能力下降。基于Scala编译器中采用的方法,我们给出了D $_{<: }$的Step类型和Step子类型关系。我们证明了这些关系的声音和决定。相对于原始D $_{<: }$规则,它们是不完整的。
英文摘要:
The Dependent Object Types (DOT) calculus formalizes key features of Scala. The D$_{<: }$ calculus is the core of DOT. To date, presentations of D$_{<: }$ have used declarative typing and subtyping rules, as opposed to algorithmic. Unfortunately, algorithmic typing for full D$_{<: }$ is known to be an undecidable problem. We explore the design space for a restricted version of D$_{<: }$ that has decidable typechecking. Even in this simplified D$_{<: }$ , algorithmic typing and subtyping are tricky, due to the "bad bounds" problem. The Scala compiler bypasses bad bounds at the cost of a loss in expressiveness in its type system. Based on the approach taken in the Scala compiler, we present the Step Typing and Step Subtyping relations for D$_{<: }$. We prove these relations sound and decidable. They are not complete with respect to the original D$_{<: }$ rules.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。