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

解除限制的初始代数——一种在Agda中形式化的新型初始代数构造

Initial Algebras Unchained -- A Novel Initial Algebra Construction Formalized in Agda

Thorsten Wißmann, Stefan Milius

AI总结:

该研究提出一种不依赖序数索引链的新型初始代数构造方法,通过构造所有有限递归余代数的余极限得到初始代数,证明为构造性且已在Agda中完全形式化。

摘要:

自函子F的初始代数为构造子由F描述的数据结构提供了递归与归纳模式。Adámek(1974)提出的初始代数构造从初始对象(例如空集)出发,连续应用该函子直至达到不动点,这一思路受Kleene不动点定理启发。根据目标函子的不同,该过程可能需要由序数索引的超限多步才能终止。\n 我们提出了一种不依赖序数索引链的新型初始代数构造方法。该构造受Pataraia不动点定理的松散启发,通过构造所有有限递归余代数的余极限得到初始代数,这与自函子有理不动点的构造思路相似——后者通过构造所有有限余代数的余极限得到。在主正确性定理中,我们假设给定的自函子在(弱形式的)局部可表现范畴上是可达的。我们的证明是构造性的,且已在Agda中完全形式化。

英文摘要:

The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Adámek (1974) starts with the initial object (e.g. the empty set) and successively applies the functor until a fixed point is reached, an idea inspired by Kleene's fixed point theorem. Depending on the functor of interest, this may require transfinitely many steps indexed by ordinal numbers until termination. We provide a new initial algebra construction which is not based on an ordinal-indexed chain. Instead, our construction is loosely inspired by Pataraia's fixed point theorem and forms the colimit of all finite recursive coalgebras. This is reminiscent of the construction of the rational fixed point of an endofunctor that forms the colimit of all finite coalgebras. For our main correctness theorem, we assume the given endofunctor is accessible on a (weak form of) locally presentable category. Our proofs are constructive and fully formalized in Agda.

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

↑