In this paper we explain the relationship between Frobenius objects in monoidal categories and adjunctions in 2-categories. Specifically, we show that every Frobenius object in a monoidal category M arises from an ambijunction (simultaneous left and right adjoints) in some 2-categoryDinto which M fully and faithfully embeds. Since a 2D topological quantum field theory is equivalent to a commutative Frobenius algebra, this result also shows that every 2D TQFT is obtained from an ambijunction in some 2-category. Our theorem is proved by extending the theory of adjoint monads to the context of an arbitrary 2-category and utilizing the free completion under Eilenberg-Moore objects. We then categorify this theorem by replacing the monoidal category M with a semistrict monoidal 2-category M, and replacing the 2-categoryD into which it embeds by a semistrict 3-category. To state this more powerful result, we must first define the notion of a ‘Frobenius pseudomonoid’, which categorifies that of a Frobenius object. We then define the notion of a ‘pseudo ambijunction’, categorifying that of an ambijunction. In each case, the idea is that all the usual axioms now hold only up to coherent isomorphism. Finally, we show that every Frobenius pseudomonoid in a semistrict monoidal 2-category arises from a pseudo ambijunction in some semistrict 3-category.

Abstract. This paper is a rather informal guide to some of the basic theory of 2-categories and bicategories, including notions of limit and colimit, 2-dimensional universal algebra, formal category theory, and nerves of bicategories. 1. Overview and basic examples This paper is a rather informal guide to some of the basic theory of 2-categories and bicategories, including notions of limit and colimit, 2-dimensional universal algebra, formal category theory, and nerves of bicategories. As is the way of these things, the choice of topics is somewhat personal. No attempt is made at either rigour or completeness. Nor is it completely introductory: you will not find a definition of bicategory; but then nor will you really need one to read it. In keeping with the philosophy of category theory, the morphisms between bicategories play more of a role than the bicategories themselves. 1.1. The key players. There are bicategories, 2-categories, and Cat-categories. The latter two are exactly the same (except that strictly speaking a Cat-category should have small hom-categories, but that need not concern us here). The first two are nominally different — the 2-categories are the strict bicategories, and not every bicategory is strict — but every bicategory is biequivalent to a strict one, and biequivalence is the right general notion of equivalence for bicategories and for 2-categories. Nonetheless, the theories of bicategories, 2-categories, and Catcategories have rather different flavours.

. The 2-category VAR of finitary varieties is not varietal over CAT . We introduce the concept of an algebraically exact category and prove that the 2-category ALG of all algebraically exact categories is an equational hull of VAR w.r.t. all operations with rank. Every algebraically exact category K is complete, exact, and has filtered colimits which (a) commute with finite limits and (b) distribute over products; besides (c) regular epimorphisms in K are product-stable. It is not known whether (a) -- (c) characterize algebraic exactness. An equational hull of VAR w.r.t. all operations is also discussed. 1.

Generalizing the fact that Scott's continuous lattices form the equational hull of the class of all algebraic lattices, we describe an equational hull of LFP, the category of locally finitely presentable categories, over CAT. Up to a set-theoretical hypothesis this hull is formed by the category of all precontinuous categories, i.e., categories in which limits and filtered colimits distribute. This concept is closely related to the continuous categories of P. T. Johnstone and A. Joyal. 1.

Abstract. Maps (left adjoint arrows) between Frobenius objects in a cartesian bicategory B are precisely comonoid homomorphisms and, for A Frobenius and any T in B, Map(B)(T, A) is a groupoid. 1.

Abstract. The enriched effect calculus (EEC) is an extension of Moggi’s computational metalanguage with a selection of primitives from linear logic. This paper explores the enriched effect calculus as a target language for continuation-passing-style (CPS) translations in which the typing of the translations enforces the linear usage of continuations. We first observe that established call-by-value and call-by name linear-use CPS translations of simply-typed lambda-calculus into intuitionistic linear logic (ILL) land in the fragment of ILL given by EEC. These two translations are uniformly generalised by a single generic translation of the enriched effect calculus into itself. As our main theorem, we prove that the generic self-translation of EEC is involutive up to isomorphism. As corollaries, we obtain full completeness results, both for the generic translation, and for the original call-by-value and call-by-name translations. 1.

Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke and Selinger. In particular, we analyze function abstraction in quantum computation, which turns out to characterize its classical interfaces. Some quantum algorithms provide feasible solutions of important hard problems, such as factoring and discrete log (which are the building blocks of modern cryptography). It is of a great practical interest to precisely characterize the computational resources needed to execute such quantum algorithms. There are many ideas how to build a quantum computer. Can we prove some necessary conditions? Categorical semantics help with such questions. We show how to implement an important family of quantum algorithms using just abelian groups and relations. 1

A presentation by generators and relations is given for the monoids of endomorphisms in the simplicial category. These monoids are submonoids of monoids one finds in Temperley-Lieb algebras, and as the monoids of Temperley-Lieb algebras are linked to situations where an endofunctor is adjoint to itself, so the monoids of simplicial endomorphisms axiomatized here are linked to arbitrary adjoint situations. This link is established through diagrams of the kind found in Temperley-Lieb algebras.

A presentation by generators and relations is given for the monoids of endomorphisms in the simplicial category. These monoids are submonoids of monoids one finds in Temperley-Lieb algebras, and as the monoids of Temperley-Lieb algebras are linked to situations where an endofunctor is adjoint to itself, so the monoids of simplicial endomorphisms axiomatized here are linked to arbitrary adjoint situations. This link is established through diagrams of the kind found in Temperley-Lieb algebras.

The monoids of simplicial endomorphisms, i.e. the monoids of endomorphisms in the simplicial category, are submonoids of monoids one finds in Temperley-Lieb algebras, and as the monoids of Temperley-Lieb algebras are linked to situations where an endofunctor is adjoint to itself, so the monoids of simplicial endomorphisms are linked to arbitrary adjoint situations. This link is established through diagrams of the kind found in Temperley-Lieb algebras. Results about these matters, which were previously prefigured up to a point, are here surveyed and reworked. A presentation of monoids of simplicial endomorphisms by generators and relations has been given a long time ago. Here a closely related presentation is given, with completeness proved in a new and self-contained manner.