arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.2128cs.LO
收藏

集合上单子张量性的有界性探讨

Exploring the Boundaries of Monad Tensorability on Set

Nathan Bowler, Sergey Goncharov, Paul Blain Levy, Lutz Schröder

摘要:

我们研究了单子上的组合操作,相当于大方程理论。具体来说,我们讨论张量的存在,这是理论的组合,施加相互交换的操作从组件的理论。因此,他们扩展了两个理论的总和,这只是他们无限制的组合。理论的张量出现在几个上下文中;特别是在程序设计语言的语义中,全局状态的单子Transformer由张量给出。我们提出了两个主要结果:我们通过提出两个反例,其中一个涉及有限幂集(即连接半格理论),证明了两个单子的张量一般不需要存在;这解决了一个长期存在的开放问题,并与最近的结果形成对比,这些结果排除了以前预期的反例。另一方面,我们表明,张量有界幂集单子确实存在从可数幂集向上。

英文摘要:

We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the component theories. As such, they extend the sum of two theories, which is just their unrestrained combination. Tensors of theories arise in several contexts; in particular, in the semantics of programming languages, the monad transformer for global state is given by a tensor. We present two main results: we show that the tensor of two monads need not in general exist by presenting two counterexamples, one of them involving finite powerset (i.e. the theory of join semilattices); this solves a somewhat long-standing open problem, and contrasts with recent results that had ruled out previously expected counterexamples. On the other hand, we show that tensors with bounded powerset monads do exist from countable powerset upwards.

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

↑