arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.05729cs.LOmath.ATmath.CT
收藏

任意拓扑$λ$ -模型生成的$\infty$ -广群

The $\infty$-groupoid generated by an arbitrary topological $λ$-model

Daniel O. Martínez-Rivillas, Ruy J. G. B. de Queiroz

摘要:

λ演算是一种通用的程序设计语言。它可以表示可计算的函数,这提供了一个正式的对应的观点的功能规则。术语表示函数,这允许将术语/函数应用于任何其他术语/函数,包括其本身。微积分可以被看作是一种形式化的理论,具有一定的预先建立的公理和推理规则,可以通过模型来解释。Dana Scott提出了扩展λ演算的第一个非平凡模型,称为$ D_\infty$,将$λ$ -项表示为集合论的典型函数,其中不允许将函数应用于自身。在这里,我们提出了一个$\infty$ -广群从任何lambda模型赋予一个拓扑结构的建设。我们将这种构造应用于特殊情况$D_\infty$,我们看到Scott拓扑没有提供足够的关于更高同伦之间关系的信息。这激发了一个新的研究方向,重点是探索具有非平凡$\infty$ -广群结构的$λ$ -模型,以推广项转换的证明(例如,$β$ -等式,$η$ -等式)到$λ$ -演算中的高级证明。

英文摘要:

The lambda calculus is a universal programming language. It can represent the computable functions, and such offers a formal counterpart to the point of view of functions as rules. Terms represent functions and this allows for the application of a term/function to any other term/function, including itself. The calculus can be seen as a formal theory with certain pre-established axioms and inference rules, which can be interpreted by models. Dana Scott proposed the first non-trivial model of the extensional lambda calculus, known as $ D_\infty$, to represent the $λ$-terms as the typical functions of set theory, where it is not allowed to apply a function to itself. Here we propose a construction of an $\infty$-groupoid from any lambda model endowed with a topology. We apply this construction for the particular case $D_\infty$, and we see that the Scott topology does not provide enough information about the relationship between higher homotopies. This motivates a new line of research focused on the exploration of $λ$-models with the structure of a non-trivial $\infty$-groupoid to generalize the proofs of term conversion (e.g., $β$-equality, $η$-equality) to higher-proofs in $λ$-calculus.

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

↑