Control flow semantics
Modal logic
Automata and Algebras in Categories
Automata and Algebras in Categories
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Algebra and the HSP Theorem
Journal of Logic and Computation
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
On universal algebra over nominal sets
Mathematical Structures in Computer Science
Journal of Logic and Computation
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Finitary functors: from set to preord and poset
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
An algebraic presentation of predicate logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
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.