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

正归纳递归定义

Positive Inductive-Recursive Definitions

Neil Ghani, Fredrik Nordvall Forsberg, Lorenzo Malatesta

摘要:

提出了一种新的数据类型理论,它允许将类型定义为某些函子Fam(C)-> Fam(C)的初始代数.这个理论,我们称之为积极的归纳递归定义,是一个概括的Dybjer和Setzer的理论归纳递归定义内的C必须是离散的-我们的工作因此可以被视为解除这一限制。这是一个实质性的努力,因为我们不仅需要为这样的数据类型引入一种类型的代码(如Dybjer和Setzer的工作),而且还需要在这样的代码之间引入一种类型的态射(这在Dybjer和Setzer的开发中是不需要的)。我们展示了这些代码如何被解释为Fam(C)上的函子,以及这些代码的态射如何被解释为这些函子之间的自然变换。然后,我们给出了一个应用程序的积极的归纳递归定义的理论嵌套数据类型,我们给出了具体的例子,递归函数定义在宇宙中使用其消除原则。最后,我们证明存在的积极的归纳递归定义适应Dybjer和Setzer的集理论模型,我们的设置。

英文摘要:

A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) -> Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer and Setzer's theory of inductive-recursive definitions within which C had to be discrete -- our work can therefore be seen as lifting this restriction. This is a substantial endeavour as we need to not only introduce a type of codes for such data types (as in Dybjer and Setzer's work), but also a type of morphisms between such codes (which was not needed in Dybjer and Setzer's development). We show how these codes are interpreted as functors on Fam(C) and how these morphisms of codes are interpreted as natural transformations between such functors. We then give an application of positive inductive-recursive definitions to the theory of nested data types and we give concrete examples of recursive functions defined on universes by using their elimination principle. Finally we justify the existence of positive inductive-recursive definitions by adapting Dybjer and Setzer's set-theoretic model to our setting.

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

↑