首页> 外文期刊>Theoretical computer science >An equational notion of lifting monad
【24h】

An equational notion of lifting monad

机译:提升单子的方程式概念

获取原文
获取原文并翻译 | 示例
       

摘要

We introduce the notion of an equational lifting monad: a commutative strong monad satisfying one additional equation (valid for monads arising from partial map classifiers). We prove that any equational lifting monad has a representation by a partial map classifier such that the Kleisli category of the former fully embeds in the partial category of the latter. Thus, equational lifting monads precisely capture the equational properties of partial maps as induced by partial map classifiers. The representation theorem also provides a tool for transferring non-equational properties of partial map classifiers to equational lifting monads. It is proved using a direct axiomatization of Kleisli categories of equational lifting monads. This axiomatization is of interest in its own right.
机译:我们引入了方程式提升单子的概念:满足一个附加方程的可交换强单子(对于由部分地图分类器产生的单子有效)。我们证明,任何方程式提升单子都具有部分地图分类器的表示,从而前者的Kleisli类别完全嵌入后者的部分类别中。因此,方程式提升单子方程可精确捕获由局部图分类器诱导的局部图的方程式属性。表示定理还提供了一种工具,用于将部分地图分类器的非等式属性转换为等式提升单子。使用方程式提升单子的Kleisli类别的直接公理化证明了这一点。公理化本身就是令人感兴趣的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号