Results 1  10
of
21
Abstract and Concrete Categories. The Joy of Cats
, 2004
"... Contemporary mathematics consists of many different branches and is intimately related to various other fields. Each of these branches and fields is growing rapidly and is itself diversifying. Fortunately, however, there is a considerable amount of common ground — similar ideas, concepts, and constr ..."
Abstract

Cited by 53 (0 self)
 Add to MetaCart
Contemporary mathematics consists of many different branches and is intimately related to various other fields. Each of these branches and fields is growing rapidly and is itself diversifying. Fortunately, however, there is a considerable amount of common ground — similar ideas, concepts, and constructions. These provide a basis for a general theory of structures.
The purpose of this book is to present the fundamental concepts and results of such a theory, expressed in the language of category theory — hence, as a particular branch of mathematics itself. It is designed to be used both as a textbook for beginners and as a reference source. Furthermore, it is aimed toward those interested in a general theory of structures, whether they be students or researchers, and also toward those interested in using such a general theory to help with organization and clarification within a special field. The only formal prerequisite for the reader is an elementary knowledge of set theory.
A Dependent Type Theory with Names and Binding
 In Proceedings of the 2004 Computer Science Logic Conference, number 3210 in Lecture notes in Computer Science
, 2004
"... We consider the problem of providing formal support for working with abstract syntax involving variable binders. Gabbay and Pitts have shown in their work on FraenkelMostowski (FM) set theory how to address this through firstclass names: in this paper we present a dependent type theory for prog ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We consider the problem of providing formal support for working with abstract syntax involving variable binders. Gabbay and Pitts have shown in their work on FraenkelMostowski (FM) set theory how to address this through firstclass names: in this paper we present a dependent type theory for programming and reasoning with such names. Our development is based on a categorical axiomatisation of names, with freshness as its central notion. An associated adjunction captures constructions known from FM theory: the freshness quantifier N , namebinding, and unique choice of fresh names. The Schanuel topos  the category underlying FM set theory  is an instance of this axiomatisation.
A Study of Categories of Algebras and Coalgebras
, 2001
"... This thesis is intended to help develop the theory of coalgebras by, first, taking classic theorems in the theory of universal algebras and dualizing them and, second, developing an internal logic for categories of coalgebras. We begin with an introduction to the categorical approach to algebras and ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
This thesis is intended to help develop the theory of coalgebras by, first, taking classic theorems in the theory of universal algebras and dualizing them and, second, developing an internal logic for categories of coalgebras. We begin with an introduction to the categorical approach to algebras and the dual notion of coalgebras. Following this, we discuss (co)algebras for a (co)monad and develop a theory of regular subcoalgebras which will be used in the internal logic. We also prove that categories of coalgebras are complete, under reasonably weak conditions, and simultaneously prove the wellknown dual result for categories of algebras. We close the second chapter with a discussion of bisimulations in which we introduce a weaker notion of bisimulation than is current in the literature, but which is wellbehaved and reduces to the standard definition under the assumption of choice. The third chapter is a detailed look at three theorem's of G. Birkho# [Bir35, Bir44], presenting categorical proofs of the theorems which generalize the classical results and which can be easily dualized to apply to categories of coalgebras. The theorems of interest are the variety theorem, the equational completeness theorem and the subdirect product representation theorem. The duals of each of these theorems is discussed in detail, and the dual notion of "coequation" is introduced and several examples given. In the final chapter, we show that first order logic can be interpreted in categories of coalgebras and introduce two modal operators to first order logic to allow reasoning about "endomorphisminvariant" coequations and bisimulations internally. We also develop a translation of terms and formulas into the internal language of the base category, which preserves and reflects truth. La...
A universal characterization of the closed euclidean interval (Extended Abstract)
 PROC. OF 16TH ANN. IEEE SYMP. ON LOGIC IN COMPUTER SCIENCE, LICS'01
, 2001
"... We propose a notion of interval object in a category with finite products, providing a universal property for closed and bounded real line segments. The universal property gives rise to an analogue of primitive recursion for defining computable functions on the interval. We use this to define basi ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We propose a notion of interval object in a category with finite products, providing a universal property for closed and bounded real line segments. The universal property gives rise to an analogue of primitive recursion for defining computable functions on the interval. We use this to define basic arithmetic operations and to verify equations between them. We test the notion in categories of interest. In the
A New Framework for Declarative Programming
, 2001
"... We propose a new indexedcategory syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over taucategories:finite product categories with canonical structure. ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We propose a new indexedcategory syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over taucategories:finite product categories with canonical structure.
Standardization and Evaluation in Combinatory Reduction Systems
, 2000
"... A rewrite system has standardization i for any rewrite sequence there is an equivalent one which contracts the redexes in a standard order. Standardization is extremely useful for finding normalizing strategies and proving that a rewrite system for a programming language is sound with respect to the ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A rewrite system has standardization i for any rewrite sequence there is an equivalent one which contracts the redexes in a standard order. Standardization is extremely useful for finding normalizing strategies and proving that a rewrite system for a programming language is sound with respect to the language's operational semantics. Although for some rewrite systems the standardorder can be simple, e.g., lefttoright or outermostfirst, many systems need a more delicate order. There are abstract notions of standard order which always apply, but proofs (often quite dicult) are required that the rewrite system satis es a number of axioms and not much guidance is provided for finding a concrete order that satisfies the abstract definition. This paper gives a framework based on combinatory reduction systems (CRS's) which is general enough to handle many programming languages. If the CRS is orthogonal and fully extended and a good redex ordering can be found, then a standard order is obtain...