arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.08039cs.PL

Trust, but Verify: Two-Phase Typing for Dynamic Languages

Panagiotis Vekris, Benjamin Cosman, Ranjit Jhala

英文摘要:

A key challenge when statically typing so-called dynamic languages is the ubiquity of value-based overloading, where a given function can dynamically reflect upon and behave according to the types of its arguments. Thus, to establish basic types, the analysis must reason precisely about values, but in the presence of higher-order functions and polymorphism, this reasoning itself can require basic types. In this paper we address this chicken-and-egg problem by introducing the framework of two-phased typing. The first "trust" phase performs classical, i.e. flow-, path- and value-insensitive type checking to assign basic types to various program expressions. When the check inevitably runs into "errors" due to value-insensitivity, it wraps problematic expressions with DEAD-casts, which explicate the trust obligations that must be discharged by the second phase. The second phase uses refinement typing, a flow- and path-sensitive analysis, that decorates the first phase's types with logical predicates to track value relationships and thereby verify the casts and establish other correctness properties for dynamically typed languages.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑