搜索结果: 1-2 共查到“可计算性理论 subtyping”相关记录2条 . 查询时间(0.06 秒)
We investigate the first-order theory of subtyping constraints.We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where all constructors are ei...
Many type inference and program analysis systems include notions of subtyping and parametric polymorphism. When used together, these two features induce equivalences that allow types to be simpli ed b...