In automata theory, a machine transitions from one state to the next when it reads an input symbol. It is common to also allow an automaton to transition without input, via an Îµ-transition. Theseâ€¦ (More)

State spaces in probabilistic and quantum computation are convex sets, that is, Eilenbergâ€“Moore algebras of the distribution monad. This article studies some computationally relevant properties ofâ€¦ (More)

Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related toâ€¦ (More)

Effect algebras have been introduced in the 1990s in the study of the foundations of quantum mechanics, as part of a quantum-theoretic version of probability theory. This paper is part of thatâ€¦ (More)

In the Simply Typed Î»-calculus [Hin97, BDS13] Statman investigates the reducibility relation â‰¤Î²Î· between types: for A,B âˆˆ T, types freely generated using â†’ and a single ground type 0, define A â‰¤Î²Î· Bâ€¦ (More)

It is a well-known fact that a nondeterministic automaton can be transformed into an equivalent deterministic automaton via the powerset construction. From a categorical perspective this constructionâ€¦ (More)