Results 1  10
of
17
Categories and groupoids
, 1971
"... In 1968, when this book was written, categories had been around for 20 years and groupoids for twice as long. Category theory had by then become widely accepted as an essential tool in many parts of mathematics and a number of books on the subject had appeared, or were about to appear (e.g. [13, 22, ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
In 1968, when this book was written, categories had been around for 20 years and groupoids for twice as long. Category theory had by then become widely accepted as an essential tool in many parts of mathematics and a number of books on the subject had appeared, or were about to appear (e.g. [13, 22, 37, 58, 65] 1). By contrast, the use of groupoids was confined to a small number of pioneering articles, notably by Ehresmann [12] and Mackey [57], which were largely ignored by the mathematical community. Indeed groupoids were generally considered at that time not to be a subject for serious study. It was argued by several wellknown mathematicians that group theory sufficed for all situations where groupoids might be used, since a connected groupoid could be reduced to a group and a set. Curiously, this argument, which makes no appeal to elegance, was not applied to vector spaces: it was well known that the analogous reduction in this case is not canonical, and so is not available, when there is extra structure, even such simple structure as an endomorphism. Recently, Corfield in [41] has discussed methodological issues in mathematics with this topic, the resistance to the notion of groupoids, as a prime example. My book was intended chiefly as an attempt to reverse this general assessment of the time by presenting applications of groupoids to group theory
Categorybased Semantics for Equational and Constraint Logic Programming
, 1994
"... This thesis proposes a general framework for equational logic programming, called categorybased equational logic by placing the general principles underlying the design of the programming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equation ..."
Abstract

Cited by 24 (10 self)
 Add to MetaCart
This thesis proposes a general framework for equational logic programming, called categorybased equational logic by placing the general principles underlying the design of the programming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfying certain natural conditions; completeness is proved under a hypothesis of quantifier projectivity, using a semantic treatment that regards quantifiers as models rather than variables, and regards valuations as model morphisms rather than functions. This is used as a basis for a model theoretic categorybased approach to a paramodulationbased operational semantics for equational logic programming languages. Categorybased equational logic in conjunction with the theory of institutions is used to give mathematical foundations for modularisation in equational logic programming. We study the soundness and completeness problem for module imports i...
An Oxford Survey of Order Sorted Algebra
 MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 1994
"... ..."
Pseudo limits, biadjoints, and pseudo algebras: categorical foundations of conformal field theory
 Mem. Amer. Math. Soc
"... The purpose of this paper is to work out the categorical basis for the foundations of Conformal Field Theory. The definition of Conformal Field Theory was outlined in Segal [45] and recently given in [24] and [25]. Concepts of 2category theory, such as versions of algebra, limit, colimit, and adjun ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
The purpose of this paper is to work out the categorical basis for the foundations of Conformal Field Theory. The definition of Conformal Field Theory was outlined in Segal [45] and recently given in [24] and [25]. Concepts of 2category theory, such as versions of algebra, limit, colimit, and adjunction, are necessary for this
Pseudo algebras and pseudo double categories
 J. Homotopy Relat. Struct
"... Abstract. As an example of the categorical apparatus of pseudo algebras over 2theories, we show that pseudo algebras over the 2theory of categories can be viewed as pseudo double categories with folding or as appropriate 2functors into bicategories. Foldings are equivalent to connection pairs, an ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Abstract. As an example of the categorical apparatus of pseudo algebras over 2theories, we show that pseudo algebras over the 2theory of categories can be viewed as pseudo double categories with folding or as appropriate 2functors into bicategories. Foldings are equivalent to connection pairs, and also to thin structures if the vertical and horizontal morphisms coincide. In a sense, the squares of a double category with folding are determined in a functorial way by the 2cells of the horizontal 2category. As a special case, strict 2algebras with one object and everything invertible are crossed modules under a group.
Completeness of CategoryBased Equational Deduction
 Mathematical Structures in Computer Science
, 1995
"... Equational deduction is generalised within a categorybased abstract model theory framework, and proved complete under a hypothesis of quantifier projectivity, using a semantic treatment that regards quantifiers as models rather than variables, and regards valuations as model morphisms rather tha ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Equational deduction is generalised within a categorybased abstract model theory framework, and proved complete under a hypothesis of quantifier projectivity, using a semantic treatment that regards quantifiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted [conditional] equational logics, Horn clause logic, equational deduction modulo a theory, constraint logics, and more, as well as any possible combination among them. In the cases of equational deduction modulo a theory and of constraint logic the completeness result is new. One important consequence is an abstract version of Herbrand's Theorem, which provides an abstract model theoretic foundations for equational and constraint logic programming. 1 Introduction A uniform treatment of the model theory of classical equational logic is now possible due to the comprehensive development of categorical universal algebra; without any c...
Hidden Algebra for Software Engineering
 Proceedings Combinatorics, Computation and Logic
, 1999
"... : This paper is an introduction to recent research on hidden algebra and its application to software engineering; it is intended to be informal and friendly, but still precise. We first review classical algebraic specification for traditional "Platonic" abstract data types like integers, vectors, ma ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
: This paper is an introduction to recent research on hidden algebra and its application to software engineering; it is intended to be informal and friendly, but still precise. We first review classical algebraic specification for traditional "Platonic" abstract data types like integers, vectors, matrices, and lists. Software engineering also needs changeable "abstract machines," recently called "objects," that can communicate concurrently with other objects through visible "attributes" and statechanging "methods." Hidden algebra is a new development in algebraic semantics designed to handle such systems. Equational theories are used in both cases, but the notion of satisfaction for hidden algebra is behavioral, in the sense that equations need only appear to be true under all possible experiments; this extra flexibility is needed to accommodate the clever implementations that software engineers often use to conserve space and/or time. The most important results in hidden algebra are ...
Stretching First Order Equational Logic: Proofs with Partiality, Subtypes and Retracts
 Proceedings, Workshop on First Order Theorem Proving
, 1998
"... It is widely recognized that equational logic is simple, (relatively) decidable, and (relatively) easily mechanized. But it is also widely thought that equational logic has limited applicability because it cannot handle subtypes or partial functions. We show that a modest stretch of equational logic ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
It is widely recognized that equational logic is simple, (relatively) decidable, and (relatively) easily mechanized. But it is also widely thought that equational logic has limited applicability because it cannot handle subtypes or partial functions. We show that a modest stretch of equational logic effectively handles these features. Space limits preclude a full theoretical treatment, so we often sketch, motivate and exemplify.
Free Iterative Theories
 A Coalgebraic View, Math. Structures Comput. Sci
"... Summary. We prove that iteration theories can be introduced as algebras for the monad Rat on the category of signatures assigning to every signature Σ the rationalΣtree signature. This supports the result that iteration theories axiomatize precisely the equational properties of least fixed points ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Summary. We prove that iteration theories can be introduced as algebras for the monad Rat on the category of signatures assigning to every signature Σ the rationalΣtree signature. This supports the result that iteration theories axiomatize precisely the equational properties of least fixed points in domain theory: Rat is the monad of free rational theories and every free rational theory has a continuous completion. Key words: Iteration theory, rational theory, monad, EilenbergMoore algebra. 1