首页    期刊浏览 2024年09月19日 星期四
登录注册

文章基本信息

  • 标题:Exploring the Boundaries of Monad Tensorability on Set
  • 本地全文:下载
  • 作者:Nathan Bowler ; Sergey Goncharov ; Paul Levy
  • 期刊名称:Logical Methods in Computer Science
  • 印刷版ISSN:1860-5974
  • 电子版ISSN:1860-5974
  • 出版年度:2013
  • 卷号:9
  • 期号:3
  • 页码:1
  • DOI:10.2168/LMCS-9(3:22)2013
  • 出版社:Technical University of Braunschweig
  • 摘要: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.
  • 其他关键词:Monads, tensor products, side effects, non-determinism.
国家哲学社会科学文献中心版权所有