arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.05059cs.LO
收藏

余归纳类型的操作性解释

An operational interpretation of coinductive types

Łukasz Czajka

AI总结:

本文为严格正嵌套高阶(余)归纳类型提出一种基于重写的操作语义,通过逼近定理证明良类型项具有良好定义的解释,推广了生产力概念。

摘要:

我们为严格正嵌套高阶(余)归纳类型引入了一种基于重写操作语义。该语义考虑了无限归约序列的“极限”。这可以看作是对项重写中生产力概念的细化与推广,将其扩展到具有高阶函数以及由嵌套高阶归纳和余归纳定义所指定数据的环境中。直观上,我们通过对应于其完全展开的潜在无限项来解释高阶函数语言中的惰性数据结构。我们证明了一个逼近定理,该定理本质上表明:如果一个项在余归纳类型解释中归约到某个无限对象的任意大的有限逼近,那么它无限地(即在“极限”中)归约到该类型解释中的一个无限对象。我们引入了一个充分语法正确性判据,以类型系统的形式,用于带有类型信息的有限项。利用逼近定理,我们证明了每个良类型项在我们的语义中都具有良好定义的解释。

英文摘要:

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and generalization of the notion of productivity in term rewriting to a setting with higher-order functions and with data specified by nested higher-order inductive and coinductive definitions. Intuitively, we interpret lazy data structures in a higher-order functional language by potentially infinite terms corresponding to their complete unfoldings. We prove an approximation theorem which essentially states that if a term reduces to an arbitrarily large finite approximation of an infinite object in the interpretation of a coinductive type, then it infinitarily (i.e. in the "limit") reduces to an infinite object in the interpretation of this type. We introduce a sufficient syntactic correctness criterion, in the form of a type system, for finite terms decorated with type information. Using the approximation theorem, we show that each well-typed term has a well-defined interpretation in our semantics.

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

↑