The Coinductive Resumption Monad
The Coinductive Resumption Monad
复制标题
共归纳恢复单子
DOI：
10.1016/j.entcs.2014.10.015
复制
发表时间：
2014
影响因子：
0.7
通讯作者：
J. Gibbons
中科院分区：
文献类型：
--
作者：
Maciej Piróg;J. Gibbons
摘要以多种形式出现，作为一种方便的抽象，例如在并发的语义中和作为编程模式。本文在范畴论余代数上下文中引入了广义复述，并给出了它们的基本性质：它们构成一个单子，它们带有Adámek等人S完全迭代单子(CIM)的协递归格式，并且它们具有一定的泛性，这是CIMS范畴中具有自由CIM的余积的特殊性质。
Resumptions appear in many forms as a convenient abstraction, such as in semantics of concurrency and as a programming pattern. In this paper we introduce generalised resumptions in a categorytheoretic, coalgebraic context and show their basic properties: they form a monad, they come equipped with a corecursion scheme in the sense of Adámek et al.’s notion of completely iterative monads (cims), and they enjoy a certain universal property, which specialises to the coproduct with a free cim in the category of cims.