arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.09169cs.LOcs.CC
收藏

复杂性分析的自动化规模化类型推断(技术报告)

Automating Sized Type Inference for Complexity Analysis (Technical Report)

Martin Avanzini, Ugo Dal Lago

摘要:

本文介绍了一种高阶函数程序复杂性分析的新方法,它基于三个组成部分:一个强大的类型系统的规模分析和一个健全的类型推断过程,一个滴答单子变换和约束求解。值得注意的是,所提出的方法可以完全自动化,并且能够分析一系列大多数竞争对手方法无法处理的例子。这是可能的,因为选择采用抽象索引语言和索引多态性在更高的排名。原型实现可用。

英文摘要:

This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three ingredients: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic transformation, and constraint solving. Noticeably, the presented methodology can be fully automated, and is able to analyse a series of examples which cannot be handled by most competitor methodologies. This is possible due to the choice of adopting an abstract index language and index polymorphism at higher ranks. A prototype implementation is available.

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

↑