函数式程序的复杂性分析:高阶遇到一阶(长版)
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version)
摘要:
我们展示了如何高阶函数程序的复杂性可以自动分析,通过应用程序转换到一个去功能化的版本,他们,并将结果反馈给现有的工具的复杂性分析的一阶长期重写系统。这样做的同时仔细分析复杂性保存和反射的转换,使所获得的长期重写系统的复杂性反映在初始程序的复杂性。此外,我们描述了合适的策略的应用研究的转换,并提供了充足的实验数据,以评估我们的方法的可行性。
英文摘要:
We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding the result to existing tools for the complexity analysis of first-order term rewrite systems. This is done while carefully analysing complexity preservation and reflection of the employed transformations such that the complexity of the obtained term rewrite system reflects on the complexity of the initial program. Further, we describe suitable strategies for the application of the studied transformations and provide ample experimental data for assessing the viability of our method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。