PCF类型的可编码性层次结构
The encodability hierarchy for PCF types
摘要:
在自然数的基本类型(包括乘积类型)上处理简单类型时,我们考虑类型$σ$何时可编码为$τ$的可定义收缩的问题:也就是说,当存在$λ$ -项$e:σ\rightarrowτ$和$d:τ\rightarrowσ$以及$d \circ e = id$时。一般来说,这个问题的答案可能会有所不同,根据选择$λ$ -演算和平等的概念考虑;然而,我们将表明,类型之间的可编码性关系$\preceq$实际上在一大类语言和等式关系中保持稳定,范围从具有无限多个可区分常数的非常基本的语言$0,1,\ldots$(但没有算术)考虑模计算相等,直到整个Plotkin的PCF考虑模观测等价。我们证明了$σ\preceq τ\preceq σ$当且仅当$σ\cong τ$通过平凡同构,并且对于任何$σ,τ$,我们有$σ\preceq τ$或$τ\preceq σ$。此外,我们表明,诱导的线性顺序同构类的类型实际上是一个良好的排序类型$ε_0$,事实上,有一个密切的语法之间的对应关系简单的类型和康托正常形式的序数低于$ε_0$。这意味着关系$\preceq$是容易判定的,并且当$σ\preceq τ$成立时,证明收回$σ\lhd τ$的项是容易构造的。
英文摘要:
Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type $σ$ is encodable as a definable retract of $τ$: that is, when there are $λ$-terms $e:σ\rightarrowτ$ and $d:τ\rightarrowσ$ with $d \circ e = id$. In general, the answer to this question may vary according to both the choice of $λ$-calculus and the notion of equality considered; however, we shall show that the encodability relation $\preceq$ between types actually remains stable across a large class of languages and equality relations, ranging from a very basic language with infinitely many distinguishable constants $0,1,\ldots$ (but no arithmetic) considered modulo computational equality, up to the whole of Plotkin's PCF considered modulo observational equivalence. We show that $σ\preceq τ\preceq σ$ iff $σ\cong τ$ via trivial isomorphisms, and that for any $σ,τ$ we have either $σ\preceq τ$ or $τ\preceq σ$. Furthermore, we show that the induced linear order on isomorphism classes of types is actually a well-ordering of type $ε_0$, and indeed that there is a close syntactic correspondence between simple types and Cantor normal forms for ordinals below $ε_0$. This means that the relation $\preceq$ is readily decidable, and that terms witnessing a retraction $σ\lhd τ$ are readily constructible when $σ\preceq τ$ holds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。