INDEXED CATEGORIES AS A TOOL FOR THE SEMANTICS OF COMPUTATION

Abstract

This paper presents indexed categories, which model uniformly defined families of categories, and suggests that they are a useful tool for the working computer scientist. An indexed category gives rise to a single flattened category as a disjoint union of its component categories plus some additional morphisms. Similarly, an indexed functor (which is a uniform family of functors between the component categories) induces a flattened functor between the corresponding flattened categories. Under certain assumptions, flattened categories are (co)complete if all their components are, and flattened functors have left adjoints if all their components do. Several examples are given. Although this paper is part 3 of the series "Some Fundamental Algebraic Tools for the Semantics of Computation,"' it is entirely independent of parts 1 and 2.