Search

• < Previous
• 1
• Next >

---

Exploring the Boundaries of Monad Tensorability on Set

Nathan Bowler ; Sergey Goncharov ; Paul Blain Levy ; Lutz Schröder.

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&nbsp;[&hellip;]

---

Efficient and Modular Coalgebraic Partition Refinement

Thorsten Wißmann ; Ulrich Dorsch ; Stefan Milius ; Lutz Schröder.

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical relational systems but also, e.g. various forms of weighted systems&nbsp;[&hellip;]

---