ABSTRACT. Given a bicategory, Y , with stable local coequalizers, we construct a bicategory of monads Y -mnd by using lax functors from the generic 0-cell, 1-cell and 2-cell, respectively, into Y .… (More)

J.R.B. COCKETT, J. KOSLOWSKI , and R.A.G. SEELY 1 Department of Computer Science, University of Calgary, 2500 University Drive, Calgary, AL, T2N1N4, Canada. robin@cpsc.ucalgary.ca 2 Institut für… (More)

The Galois connection given in 1985 by Pumpl un and RR ohrl between the classes of objects and the classes of morphisms in any category is shown (under ordinary circumstances) to have a \natural"… (More)

Basic results are obtained concerning Galois connections between collections of closure operators (of various types) and collections consisting of subclasses of (pairs of) morphisms in M for an 〈E,M… (More)

0. INTRODUCTION Closure operators are well-known in topology and order theory. In the setting of an hE; Mi-category for sinks we show that the categorical abstraction of the notion of closure… (More)

Linear bicategories are a generalization of ordinary bicategories in which there are two horizontal (1-cell) compositions corresponding to the “tensor” and “par” of linear logic. Benabou’s notion of… (More)

In the quest for an elegant formulation of the notion of “polycategory” we develop a more symmetric counterpart to Burroni’s notion of “T -category”, where T is a cartesian monad on a category X with… (More)

The well-known simulation of Turing machines by push-down automata with two stacks is shown to be possible, even if the latter has only a single state and is deterministic. This sheds new light on… (More)