Countably based filter spaces have been suggested in the 1970’s as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the class of spaces which can be handled by the Type-2 Model of Effectivity (TTE). We prove that the category of countably based proper filter spaces is equivalent to the category of countably based weak limit spaces. This resul...

One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we begin to adapt the machinery of globular operads [1] to this task. We present a general construction of a tensor product on the category of n-globular sets from any normalised (n + 1)-operad A, in such a way that the algebras for A ma...

There are two ways to describe the interaction between classical and quantum information categorically: one based on completely positive maps between Frobenius algebras, the other using symmetric monoidal 2-categories. This paper makes a first step towards combining the two. The integrated approach allows a unified description of quantum teleportation and classical encryption in a single 2-cate...

Higher dimensional central extensions of groups were introduced by G. Janelidze as particular instances of the abstract notion of covering morphism from categorical Galois theory. More recently, the notion has been extended to and studied in arbitrary semi-abelian categories. Here, we further extend the scope to exact Mal’tsev categories and beyond. For this, we consider conditions on a Galois ...

Introduction The following text arose from the desire to establish a rm relationship between higher order categories and topological spaces. Our approach combines the algebraic features of Michael Batanin's !-operads 1] with the geometric features of Andr e Joyal's cellular sets 15] and tries to mimick as far as possible the classical construction of the simplicial nerve of a category. Higher o...

Reynolds’ theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds’ theory can be seen as the instantiation at dimension 1 of a theory of relational parametricity for System F that holds at all higher dimensions, including i...