This talk is about some theory relating to inverse semigroups and inverse categories that arises in theoretical and practical computer science -- mostly, but not entirely, relating to the field of reversible computation. Despite its motivation and origins in theoretical computing, this talk

is an exploration of the structures involved for their own sake. This turns out to involve interactions between inverse monoids, inverse categories and partially \& totally ordered sets.