搜索结果: 1-4 共查到“计算机科学技术基础学科 types”相关记录4条 . 查询时间(0.093 秒)
We present a simple and powerful type inference method for dynamically typed languages where no type information is supplied by the user. Type inference is reduced to the problem of solvability of a s...
Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)
Optimal Representations Polymorphic Types Subtyping (Extended Abstract)
2016/5/24
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...
On Typability for Rank-2 Intersection Types with Polymorphic Recursion
Typability Rank-2 Intersection Types Polymorphic Recursion
2016/5/24
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context free language (CFL) g...
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...