Getting F-bounded polymorphism into shape

PLDI(2014)

引用 58|浏览54
暂无评分
摘要
We present a way to restrict recursive inheritance without sacrificing the benefits of F-bounded polymorphism. In particular, we distinguish two new concepts, materials and shapes, and demonstrate through a survey of 13.5 million lines of open-source generic-Java code that these two concepts never actually overlap in practice. With this Material-Shape Separation, we prove that even naïve type-checking algorithms are sound and complete, some of which address problems that were unsolvable even under the existing proposals for restricting inheritance. We illustrate how the simplicity of our design reflects the design intuitions employed by programmers and potentially enables new features coming into demand for upcoming programming languages.
更多
查看译文
关键词
recursive inheritance,type-checking algorithm,million line,open-source generic-java code,material-shape separation,f-bounded polymorphism,upcoming programming language,existing proposal,new feature,new concept,decidability,shapes,variance,materials,subtyping
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要