.png){kind=icon}
返回
A graph-based generic type system for object-oriented programs
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-012-1307-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a graph-basedmodel of a generic type system for an OO language. The type system supports the features of recursive types, generics and interfaces, which are commonly found in modern OO languages such as Java. In the classical graph theory, we define type graphs, instantiation graphs and conjunction graphs that naturally illustrate the relations among types, generics and interfaces within complex OO programs. The model employs a combination of nominal and anonymous nodes to represent respectively types that are identified by names and structures, and defines graph-based relations and operations on types including equivalence, subtyping, conjunction and instantiation. Algorithms based on the graph structures are designed for the implementation of the type system. We believe that this type system is important for the development of a graph-based logical foundation of a formal method for verification of and reasoning about OO programs.
Keyword:
OO programs
type systems
generics
type graphs
recursive types
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
查看更多机构
引用论文
.png){kind=icon}
没有更多内容