Action calculi have been introduced by Milner as a framework for representing models of interactive behaviour. Two natural extensions of action calculi have been proposed: the higher-order action calculi, which add higher-order features to the basic setting, and the reflexive action calculi, which allow circular bindings of processes and gives recursion in the presense of higher-order features. In this paper, we present simple type theories for action calculi, higher-order action calculi and reflexive action calculi. We also give the categorical models of the extensions, by enriching Power's models of action calculi. As applications, we give a semantic proof of the conservativity of higher-order action calculi over action calculi, and a precise connection with Moggi's computational lambda calculus and notions of computation. We also relate the models of higher-order reflexive action calculi to models of recursive computation, by following the observation that the trace operator of Joya...

Summary. Monoidal dagger categories play a central role in the abstract quantum mechanics of Abramsky and Coecke. The authors show that a great deal of elementary quantum mechanics can be carried out in these categories; for example, the Born rule emerges naturally. In this paper, we construct a category of tame formal distributions with coefficients in a commutative associative algebra and show that it is a dagger category. This gives access to a broad new class of models, with the abstract scalars in the sense of Abramsky being the elements of the algebra. We will also consider a subcategory of local formal distributions, based on the ideas of Kac. Locality has been of fundamental significance in various formulations of quantum field theory. Thus our work may provide the possibility of extending the abstract framework to QFT. We also show that these categories of formal distributions are monoidal and contain a nuclear ideal, a weak form of adjunction appropriate for analyzing categories

Abstract. Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based constructions. For example, they cannot capture protocols such as quantum key distribution, that rely on the law of large numbers. To overcome this limitation, we introduce the notion of a compactly accessible category, relying on the extra structure of a factorisation system. This notion allows for infinite dimension while retaining key properties of compact categories: the main technical result is that the choice-of-duals functor on the compact

Abstract not found

A pipeline is a popular architecture which connects computational components/filers) through connectors (pipes) so that computations are performed in a stream like fashion. The data are transported through the pipes between filers, gradually transforming inputs to outputs. This kind of stream processing has been made popular through UNIX pipes that serially connect independent components for performing a sequence of tasks. We show in this paper how to formalize this architecture in terms of monads, hereby including relational specifications as special cases. The system is given through a directed acyclic graph the nodes of which carry the computational structure by being labelled with morphisms from the monad, and the edges provide the data for these operations. It is shown how fundamental compositional operations like combining pipes and filers, and refining a system by replacing simple parts through more elaborate ones, are supported through this construction.

We study bialgebras in the compact closed category Rel of sets and binary relations. Various monoidal categories with extra structure arise as the categories of (co)modules of

Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so quantum processes can also be viewed as proofs in a suitable logic. We describe such a logic, the logic of compact closed categories and biproducts, presented both as a sequent calculus and as a system of proof-nets. This logic captures much of the necessary structure needed to represent quantum processes under classical control, while remaining agnostic to the fine details. We demonstrate how to represent quantum processes as proof-nets, and show that the dynamic behaviour of a quantum process is captured by the cut-elimination procedure for the logic. We show that the cut elimination procedure is strongly normalising: that is, that every legal way of simplifying a proof-net leads to the same, unique, normal form. Finally, taking some initial set of operations