3 results
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 […]
Published on September 18, 2013
Dirk Pattinson ; Lutz Schröder.
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal […]
Published on March 17, 2011
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 […]
Published on January 31, 2020