The Largest Topological Subcategory of Countably-based Equilogical Spaces

AbstractThere are two main approaches to obtaining “topological” cartesian-closed categories. Under one approach, one restricts to a full subcategory of topological spaces that happens to be cartesian closed — for example, the category of sequential spaces. Under the other, one generalises the notion of space — for example, to Scott's notion of equilogical space. In this paper we show that the two approaches are equivalent for a large class of objects. We first observe that the category of countably-based equilogical spaces has, in a precisely defined sense, a largest full subcategory that can be simultaneously viewed as a full subcategory of topological spaces. This category consists of certain “ω-projecting” topological quotients of countably-based topological spaces, and contains, in particular, all countably-based spaces. We show that this category is cartesian closed with its structure inherited, on the one hand, from the category of sequential spaces, and, on the other, from the category of equilogical spaces

A Uniform Approach to Domain Theory in Realizability Models

this paper we provide a uniform approach to modelling them in categories of modest sets. To do this, we identify appropriate structure for doing "domain theory" in such "realizability models". In Sections 2 and 3 we introduce PCAs and define the associated "realizability" categories of assemblies and modest sets. Next, in Section 4, we prepare for our development of domain theory with an analysis of nontermination. Previous approaches have used (relatively complicated) categorical formulations of partial maps for this purpose. Instead, motivated by the idea that A provides a primitive programming language, we consider a simple notion of "diverging" computation within A itself. This leads to a theory of divergences from which a notion of (computable) partial function is derived together with a lift monad classifying partial functions. The next task is to isolate a subcategory of modest sets with sufficient structure for supporting analogues of the usual domain-theoretic constructions. First, we expect to be able to interpret the standard constructions of total type theory in this category, so it should inherit cartesian-closure, coproducts and the natural numbers from modest sets. Second, it should interact well with the notion of partiality, so it should be closed under application of the lift functor. Third, it should allow the recursive definition of partial functions. This is achieved by obtaining a fixpoint object in the category, as defined in (Crole and Pitts 1992). Finally, although there is in principle no definitive list of requirements on such a category, one would like it to support more complicated constructions such as those required to interpret polymorphic and recursive types. The central part of the paper (Sections 5, 6, 7 and 9) is devoted to establish..

Topological and limit-space subcategories of countably-based equilogical spaces

this paper we show that the two approaches are equivalent for

A Convenient Category of Domains

We motivate and define a category of "topological domains", whose objects are certain topological spaces, generalising the usual $omega$-continuous dcppos of domain theory. Our category supports all the standard constructions of domain theory, including the solution of recursive domain equations. It also supports the construction of free algebras for (in)equational theories, provides a model of parametric polymorphism, and can be used as the basis for a theory of computability. This answers a question of Gordon Plotkin, who asked whether it was possible to construct a category of domains combining such properties

Towards a Convenient Category of Topological Domains

We propose a category of topological spaces that promises to be convenient for the purposes of domain theory as a mathematical theory for modelling computation. Our notion of convenience presupposes the usual properties of domain theory, e.g. modelling the basic type constructors, fixed points, recursive types, etc. In addition, we seek to model parametric polymorphism, and also to provide a flexible toolkit for modelling computational effects as free algebras for algebraic theories. Our convenient category is obtained as an application of recent work on the remarkable closure conditions of the category of quotients of countably-based topological spaces. Its convenience is a consequence of a connection with realizability models

Topological Domain Theory

This thesis presents Topological Domain Theory as a powerful and flexible framework for denotational semantics. Topological Domain Theory models a wide range of type constructions and can interpret many computational features. Furthermore, it has close connections to established frameworks for denotational semantics, as well as to well-studied mathematical theories, such as topology and computable analysis.We begin by describing the categories of Topological Domain Theory, and their categorical structure. In particular, we recover the basic constructions of domain theory, such as products, function spaces, fixed points and recursive types, in the context of Topological Domain Theory.As a central contribution, we give a detailed account of how computational effects can be modelled in Topological Domain Theory. Following recent work of Plotkin and Power, who proposed to construct effect monads via free algebra functors, this is done by showing that free algebras for a large class of parametrised equational theories exist in Topological Domain Theory. These parametrised equational theories are expressive enough to generate most of the standard examples of effect monads. Moreover, the free algebras in Topological Domain Theory are obtained by an explicit inductive construction, using only basic topological and set-theoretical principles.We also give a comparison of Topological and Classical Domain Theory. The category of omega-continuous dcpos embeds into Topological Domain Theory, and we prove that this embedding preserves the basic domain-theoretic constructions in most cases. We show that the classical powerdomain constructions on omega-continuous dcpos, including the probabilistic powerdomain, can be recovered in Topological Domain Theory.Finally, we give a synthetic account of Topological Domain Theory. We show that Topological Domain Theory is a specific model of Synthetic Domain Theory in the realizability topos over Scott's graph model. We give internal characterisations of the categories of Topological Domain Theory in this realizability topos, and prove the corresponding categories to be internally complete and weakly small. This enables us to show that Topological Domain Theory can model the polymorphic lambda-calculus, and to obtain a richer collection of free algebras than those constructed earlier.In summary, this thesis shows that Topological Domain Theory supports a wide range of semantic constructions, including the standard domain-theoretic constructions, computational effects and polymorphism, all within a single setting

Comparing Cartesian-closed Categories of (Core) Compactly Generated Spaces

It is well known that, although the category of topological spaces is not cartesian closed, it possesses many cartesian closed full subcategories, e.g.: (i) compactly generated Hausdorff spaces; (ii) quotients of locally compact Hausdorff spaces, which form a larger category; (iii) quotients of locally compact spaces without separation axiom, which form an even larger one; (iv) quotients of core compact spaces, which is at least as large as the previous; (v) sequential spaces, which are strictly included in (ii); and (vi) quotients of countably based spaces, which are strictly included in the category (v). We give a simple and uniform proof of cartesian closedness for many categories of topological spaces, including (ii)–(v), and implicitly (i), and we also give a self-contained proof that (vi) is cartesian closed. Our main aim, however, is to compare the categories (i)–(vi), and others like them. When restricted to Hausdorff spaces, (ii)–(iv) collapse to (i), and most non-Hausdorff spaces of interest, such as those which occur in domain theory, are already in (ii). Regarding the cartesian closed structure, finite products coincide in (i)–(vi). Function spaces are characterized as coreflections of both the Isbell and natural topologies. In general, the function spaces differ between the categories, but those of (vi) coincide with those in any of the larger categories (ii)–(v). Finally, the topologies of the spaces in the categories (i)–(iv) are analysed in terms of Lawson duality