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

Relating Idioms, Arrows and Monads from Monoidal Adjunctions

Exequiel Rivas

英文摘要:

We revisit once again the connection between three notions of computation: monads, arrows and idioms (also called applicative functors). We employ monoidal categories of finitary functors and profunctors on finite sets as models of these notions of computation, and develop the connections between them through adjunctions. As a result, we obtain a categorical version of Lindley, Yallop and Wadler's characterisation of monads and idioms as arrows satisfying an isomorphism.

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

↑