Similar Items: Modules over monads and operational semantics (expanded version)
- Full abstraction for fair testing in CCS (expanded version)
- Weak bisimulation for coalgebras over order enriched monads
- An intensionally fully-abstract sheaf model for $pi$ (expanded version)
- Hardness of monadic second-order formulae over succinct graphs
- Corecursive Algebras, Corecursive Monads and Bloom Monads
- Monads need not be endofunctors