Results 1  10
of
17
Restriction categories I: Categories of partial maps
 Theoretical Computer Science
, 2001
"... ..."
(Show Context)
STABLE MEET SEMILATTICE FIBRATIONS AND FREE RESTRICTION CATEGORIES
"... Abstract. The construction of a free restriction category can be broken into two steps: the construction of a free stable semilattice fibration followed by the construction of a free restriction category for this fibration. Restriction categories produced from such fibrations are “unitary”, in a sen ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Abstract. The construction of a free restriction category can be broken into two steps: the construction of a free stable semilattice fibration followed by the construction of a free restriction category for this fibration. Restriction categories produced from such fibrations are “unitary”, in a sense which generalizes that from the theory of inverse semigroups. Characterization theorems for unitary restriction categories are derived. The paper ends with an explicit description of the free restriction category on a directed graph. 1.
Restriction categories III: colimits, partial limits, and extensivity
 Mathematical Structures in Computer Science
, 2007
"... ..."
(Show Context)
Partial Functions, Ordered Categories, Limits and Cartesian Closure
 in: G. Birtwistle (ed), IV Higher Order Workshop
, 1993
"... Introduction Partial maps are naturally ordered according to their extent of definition. Constructions on partial maps should preserve this order so that as a component or module in a construction (such as pairing or composition) becomes more defined then so does the construct as a whole, without c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Introduction Partial maps are naturally ordered according to their extent of definition. Constructions on partial maps should preserve this order so that as a component or module in a construction (such as pairing or composition) becomes more defined then so does the construct as a whole, without changing any of its existing values. Yet despite the vast literature devoted to partial maps (e.g. [3, 6, 7, 17, 18]) this principle of modularity has not been given systematic attention. To do so the partial maps must be viewed as the morphisms of an ordered category, and the theory of limits, etc. developed in this context. The usual limit theory is inadequate for ordered categories since even if the usual limits exist their constructions will typically violate the order. This can be rectified by the judicious replacement of equations by inequalities (previous approaches to this problem, e.g. lax limits, are inappropriate here). It is expected that these results will
Locally connected recursion categories
, 2006
"... Abstract. A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of noncomplemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of noncomplemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable problems is new; the approach allows us to relax the hypotheses under which the results were originally proved. The results are generalized to nonlocally
Partial Hyperdoctrines: Categorical Models for Partial Function Logic and Hoare Logic
, 1993
"... In this paper we provide a categorical interpretation of the firstorder Hoare logic of a small programming language, by giving a weakest precondition semantics for the language. To this end, we extend the wellknown notion of a (firstorder) hyperdoctrine to include partial maps. The most important ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we provide a categorical interpretation of the firstorder Hoare logic of a small programming language, by giving a weakest precondition semantics for the language. To this end, we extend the wellknown notion of a (firstorder) hyperdoctrine to include partial maps. The most important new aspect of the resulting partial (first order) hyperdoctrine is a different notion of morphism between the fibres. We also use this partial hyperdoctrine to give a model for Beeson's Partial Function Logic such that (a version of) his axiomatization is complete w.r.t. this model. This shows the usefulness of the notion independent of its intended use as a model for Hoare logic.
1 INTRODUCTION 1 Guarded and Banded Semigroups
"... The variety of guarded semigroups consists of all (S, ·, ) where (S, ·) is a semigroup ..."
Abstract
 Add to MetaCart
(Show Context)
The variety of guarded semigroups consists of all (S, ·, ) where (S, ·) is a semigroup