Results 1  10
of
160
Categorical Logic
 A CHAPTER IN THE FORTHCOMING VOLUME VI OF HANDBOOK OF LOGIC IN COMPUTER SCIENCE
, 1995
"... ..."
Categories of Containers
 In Proceedings of Foundations of Software Science and Computation Structures
, 2003
"... Abstract. We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers have good closure properties under a variety of constructions including the formation of initial algebras and f ..."
Abstract

Cited by 40 (7 self)
 Add to MetaCart
Abstract. We introduce the notion of containers as a mathematical formalisation of the idea that many important datatypes consist of templates where data is stored. We show that containers have good closure properties under a variety of constructions including the formation of initial algebras and final coalgebras. We also show that containers include strictly positive types and shapely types but that there are containers which do not correspond to either of these. Further, we derive a representation result classifying the nature of polymorphic functions between containers. We finish this paper with an application to the theory of shapely types and refer to a forthcoming paper which applies this theory to differentiable types. 1
Wellfounded Trees in Categories
, 1999
"... this paper, we give an abstract 2 categorical characterization of Wtypes. We calculate these Wtypes explicitly in some categories of presheaves and sheaves on a site, and in the gluing category or Freyd cover. (We also have an explicit description in the case of Hyland's realizability topos, whic ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
this paper, we give an abstract 2 categorical characterization of Wtypes. We calculate these Wtypes explicitly in some categories of presheaves and sheaves on a site, and in the gluing category or Freyd cover. (We also have an explicit description in the case of Hyland's realizability topos, which will be presented in [17].) These explicit calculations can be formalized in a weak predicative metatheory, and lead to the result that if E is any suitably filtered pretopos with dependent products and Wtypes, then so is the category of internal sheaves on a site in E (Remark 5.9). Our paper is organized as follows. In Section 2 we review some standard definitions concerning pretoposes and dependent products. In Section 3 we present the categorical definition of the Wconstruction, and in Section 4 we prove some of its basic functoriality properties; e.g., that it turns coequalizers into equalizers. In Section 5, a construction is presented which to each map between (pre)sheaves of sets associates a sheaf of wellfounded trees, and it is proved that this is in fact the Wtype in the category (pre)sheaves of sets (Theorem 5.6). In Section 6, we discuss the Wconstruction for the Freyd cover. Finally, in Section 7 it is shown how these categorical constructions are not only analogous to but explicitly related to MartinLof type theory. 2 Pretoposes and dependent products
The Temporal Logic of Coalgebras via Galois Algebras
, 1999
"... This paper introduces a temporal logic for coalgebras. Nexttime and lasttime operators are dened for a coalgebra, acting on predicates on the state space. They give rise to what is called a Galois algebra. Galois algebras form models of temporal logics like Linear Temporal Logic (LTL) and Computatio ..."
Abstract

Cited by 33 (7 self)
 Add to MetaCart
This paper introduces a temporal logic for coalgebras. Nexttime and lasttime operators are dened for a coalgebra, acting on predicates on the state space. They give rise to what is called a Galois algebra. Galois algebras form models of temporal logics like Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). The mapping from coalgebras to Galois algebras turns out to be functorial, yielding indexed categorical structures. This gives many examples, for coalgebras of polynomial functors on sets. Additionally, it will be shown how \fuzzy" predicates on metric spaces, and predicates on presheaves, yield indexed Galois algebras, in basically the same coalgebraic manner. Keywords: Temporal logic, coalgebra, Galois connection, fuzzy predicate, presheaf Classication: 68Q60, 03G05, 03G25, 03G30 (AMS'91); D.2.4, F.3.1, F.4.1 (CR'98). 1 Introduction This paper combines the areas of coalgebra and of temporal logic. Coalgebras are simple mathematical structures (similar, but dual, to...
Equilogical Spaces
, 1998
"... It is well known that one can build models of full higherorder dependent type theory (also called the calculus of constructions) using partial equivalence relations (PERs) and assemblies over a partial combinatory algebra (PCA). But the idea of categories of PERs and ERs (total equivalence relation ..."
Abstract

Cited by 31 (12 self)
 Add to MetaCart
It is well known that one can build models of full higherorder dependent type theory (also called the calculus of constructions) using partial equivalence relations (PERs) and assemblies over a partial combinatory algebra (PCA). But the idea of categories of PERs and ERs (total equivalence relations) can be applied to other structures as well. In particular, we can easily dene the category of ERs and equivalencepreserving continuous mappings over the standard category Top 0 of topological T 0 spaces; we call these spaces (a topological space together with an ER) equilogical spaces and the resulting category Equ. We show that this categoryin contradistinction to Top 0 is a cartesian closed category. The direct proof outlined here uses the equivalence of the category Equ to the category PEqu of PERs over algebraic lattices (a full subcategory of Top 0 that is well known to be cartesian closed from domain theory). In another paper with Carboni and Rosolini (cited herein) a more abstract categorical generalization shows why many such categories are cartesian closed. The category Equ obviously contains Top 0 as a full subcategory, and it naturally contains many other well known subcategories. In particular, we show why, as a consequence of work of Ershov, Berger, and others, the KleeneKreisel hierarchy of countable functionals of nite types can be naturally constructed in Equ from the natural numbers object N by repeated use in Equ of exponentiation and binary products. We also develop for Equ notions of modest sets (a category equivalent to Equ) and assemblies to explain why a model of dependent type theory is obtained. We make some comparisons of this model to other, known models. 1
The Discrete Objects in the Effective Topos
 Proc. London Math. Soc
, 1990
"... The original aim of this paper was to give a rather quick and undemanding proof that the effective topos contains two nontrivial small (i.e. internal) full subcategories which are closed under all small limits in the topos (and hence in particular are internally complete). The interest in such subc ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
The original aim of this paper was to give a rather quick and undemanding proof that the effective topos contains two nontrivial small (i.e. internal) full subcategories which are closed under all small limits in the topos (and hence in particular are internally complete). The interest in such subcategories arises from
Deliverables: A Categorical Approach to Program Development in Type Theory
, 1992
"... This thesis considers the problem of program correctness within a rich theory of dependent types, the Extended Calculus of Constructions (ECC). This system contains a powerful programming language of higherorder primitive recursion and higherorder intuitionistic logic. It is supported by Pollack's ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
This thesis considers the problem of program correctness within a rich theory of dependent types, the Extended Calculus of Constructions (ECC). This system contains a powerful programming language of higherorder primitive recursion and higherorder intuitionistic logic. It is supported by Pollack's versatile LEGO implementation, which I use extensively to develop the mathematical constructions studied here. I systematically investigate Burstall's notion of deliverable, that is, a program paired with a proof of correctness. This approach separates the concerns of programming and logic, since I want a simple program extraction mechanism. The \Sigmatypes of the calculus enable us to achieve this. There are many similarities with the subset interpretation of MartinLof type theory. I show that deliverables have a rich categorical structure, so that correctness proofs may be decomposed in a principled way. The categorical combinators which I define in the system package up much logical bo...
Local Realizability Toposes and a Modal Logic for Computability (Extended Abstracts)
 Presented at Tutorial Workshop on Realizability Semantics, FLoC'99
, 1999
"... ) Steven Awodey 1 Lars Birkedal 2y Dana S. Scott 2z 1 Department of Philosophy, Carnegie Mellon University 2 School of Computer Science, Carnegie Mellon University April 15, 1999 Abstract This work is a step toward developing a logic for types and computation that includes both the usual ..."
Abstract

Cited by 24 (8 self)
 Add to MetaCart
) Steven Awodey 1 Lars Birkedal 2y Dana S. Scott 2z 1 Department of Philosophy, Carnegie Mellon University 2 School of Computer Science, Carnegie Mellon University April 15, 1999 Abstract This work is a step toward developing a logic for types and computation that includes both the usual spaces of mathematics and constructions and spaces from logic and domain theory. Using realizability, we investigate a configuration of three toposes, which we regard as describing a notion of relative computability. Attention is focussed on a certain local map of toposes, which we study first axiomatically, and then by deriving a modal calculus as its internal logic. The resulting framework is intended as a setting for the logical and categorical study of relative computability. 1 Introduction We report here on the current status of research on the Logic of Types and Computation at Carnegie Mellon University [SAB + ]. The general goal of this research program is to develop a logical fra...