Equational presentations of functors and monads-Reference-Cited by-同舟云学术

Equational presentations of functors and monads

Published:2011-03-25 Issue:2 Volume:21 Page:363-381
ISSN:0960-1295
Container-title:Mathematical Structures in Computer Science
language:en
Short-container-title:Math. Struct. Comp. Sci.

Author:

VELEBIL JIŘÍ,KURZ ALEXANDER

Abstract

We study equational presentations of functors and monads defined on a category

that is equipped by an adjunction F ˧ U :

→

of descent type. We present a class of functors/monads that admit such an equational presentation that involves finitary signatures in

.We apply these results to an equational description of functors arising in various areas of theoretical computer science.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,Mathematics (miscellaneous)

Reference23 articles.

1. Kurz A. and Rosický J. (2006) Strongly complete logics for coalgebras.

2. Kurz A. , Petrişan D. and Velebil J. (2010) Algebraic theories over nominal sets. Available as arXiv preprint at http://front.math.ucdavis.edu/1006.3027.

3. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads

4. Structures defined by finite limits in the enriched context I;Kelly;Cahiers de Top. et Géom. Diff.,1982

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. EXTENDING SET FUNCTORS TO GENERALISED METRIC SPACES;LOG METH COMPUT SCI;2019

2. Coalgebraic Completeness-via-Canonicity;Coalgebraic Methods in Computer Science;2016

3. An institutional approach to positive coalgebraic logic;Journal of Logic and Computation;2015-10-27

4. Positive fragments of coalgebraic logics;Logical Methods in Computer Science;2015-09-22

5. Presenting Distributive Laws;Logical Methods in Computer Science;2015-08-07