arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1702.02278cs.LO
收藏

交叉口类型和计数

Intersection Types and Counting

Paweł Parys

摘要:

我们提出了一种新的方法来解决以下元问题:给定树的一个数量属性,设计一个类型系统,使得由无限基元项生成的树的期望属性对应于该元项的类型的导出的一些属性,在这个类型系统中。我们的方法是在特殊情况下的语言有限性问题的非确定性高阶递归计划(HORS):给定一个非确定性的HORS,决定这HORS生成的所有有限树的集合是否是有限的。我们给出一个类型系统,使得HORS可以生成任意大的有限大小的树当且仅当在类型系统中,我们可以获得任意大的导子,在适当的意义上,后一个条件可以很容易地决定。

英文摘要:

We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of a derivation of a type for this lambda-term, in this type system. Our approach is presented in the particular case of the language finiteness problem for nondeterministic higher-order recursion schemes (HORSes): given a nondeterministic HORS, decide whether the set of all finite trees generated by this HORS is finite. We give a type system such that the HORS can generate a tree of an arbitrarily large finite size if and only if in the type system we can obtain derivations that are arbitrarily large, in an appropriate sense; the latter condition can be easily decided.

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

↑