Results 1  10
of
16
Categorical Logic
 A CHAPTER IN THE FORTHCOMING VOLUME VI OF HANDBOOK OF LOGIC IN COMPUTER SCIENCE
, 1995
"... ..."
Bi hyperdoctrines, higherorder separation logic, and abstraction
 IN ESOP’05, LNCS
, 2005
"... We present a precise correspondence between separation logic and a simple notion of predicate BI, extending the earlier correspondence given between part of separation logic and propositional BI. Moreover, we introduce the notion of a BI hyperdoctrine and show that it soundly models classical and in ..."
Abstract

Cited by 57 (22 self)
 Add to MetaCart
We present a precise correspondence between separation logic and a simple notion of predicate BI, extending the earlier correspondence given between part of separation logic and propositional BI. Moreover, we introduce the notion of a BI hyperdoctrine and show that it soundly models classical and intuitionistic first and higherorder predicate BI, and use it to show that we may easily extend separation logic to higherorder. We also demonstrate that this extension is important for program proving, since it provides sound reasoning principles for data abstraction in the presence of
A Logical View Of Concurrent Constraint Programming
, 1995
"... . Concurrent Constraint Programming (CCP) has been the subject of growing interest as the focus of a new paradigm for concurrent computation. Like logic programming it claims close relations to logic. In fact CCP languages are logics in a certain sense that we make precise in this paper. In recent ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
. Concurrent Constraint Programming (CCP) has been the subject of growing interest as the focus of a new paradigm for concurrent computation. Like logic programming it claims close relations to logic. In fact CCP languages are logics in a certain sense that we make precise in this paper. In recent work it was shown that the denotational semantics of determinate concurrent constraint programming languages forms a fibred categorical structure called a hyperdoctrine, which is used as the basis of the categorical formulation of firstorder logic. What this shows is that the combinators of determinate CCP can be viewed as logical connectives. In this paper we extend these ideas to the operational semantics of such languages and thus make available similar analogies for a much broader variety of languages including indeterminate CCP languages and concurrent blockstructured imperative languages. CR Classification: F3.1, F3.2, D1.3, D3.3 Key words: Concurrent constraint programming, simula...
Programming Metalogics with a Fixpoint Type
, 1992
"... A programming metalogic is a formal system into which programming languages can be translated and given meaning. The translation should both reflect the structure of the language and make it easy to prove properties of programs. This thesis develops certain metalogics using techniques of category th ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
A programming metalogic is a formal system into which programming languages can be translated and given meaning. The translation should both reflect the structure of the language and make it easy to prove properties of programs. This thesis develops certain metalogics using techniques of category theory and treats recursion in a new way. The notion of a category with fixpoint object is defined. Corresponding to this categorical structure there are type theoretic equational rules which will be present in all of the metalogics considered. These rules define the fixpoint type which will allow the interpretation of recursive declarations. With these core notions FIX categories are defined. These are the categorical equivalent of an equational logic which can be viewed as a very basic programming metalogic. Recursion is treated both syntactically and categorically. The expressive power of the equational logic is increased by embedding it in an intuitionistic predicate calculus, giving rise to the FIX logic. This contains propositions about the evaluation of computations to values and an induction principle which is derived from the definition of a fixpoint object as an initial algebra. The categorical structure which accompanies the FIX logic is defined, called a FIX hyperdoctrine, and certain existence and disjunction properties of FIX are stated. A particular FIX hyperdoctrine is constructed and used in the proof of the same properties. PCFstyle languages are translated into the FIX logic and computational adequacy reaulta are proved. Two languages are studied: Both are similar to PCF except one has call by value recursive function declararations and the other higher order conditionals. ...
formal and formalized ontologies
 International Journal of HumanComputer Studies
"... 2. Descriptive, formal and formalized ontologies 3. Variants of formalized ontology 4. Some data on formal ontologists 5. A note on Husserl’s conception of formal ontology ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
2. Descriptive, formal and formalized ontologies 3. Variants of formalized ontology 4. Some data on formal ontologists 5. A note on Husserl’s conception of formal ontology
Axiom of Choice and Excluded Middle in Categorical Logic
 Bulletin of Symbolic Logic
, 1995
"... The axiom of choice is shown to hold in the predicative logic of any locally cartesian closed category. A predicative form of excluded middle is then shown to be equivalent to the usual form of choice in topoi. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The axiom of choice is shown to hold in the predicative logic of any locally cartesian closed category. A predicative form of excluded middle is then shown to be equivalent to the usual form of choice in topoi.
A Complete Axiomatization of HigherOrder Intuitionistic Logic
 CLE ePrints
, 2001
"... Two Hilbert calculi for higherorder logic (or theory of types) are introduced. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Two Hilbert calculi for higherorder logic (or theory of types) are introduced.
From IF to BI A Tale of Dependence and Separation
"... Abstract. We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges ’ semantics can be seen as a special case of a general construction, which provides a context for a useful ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges ’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics is the logic of Bunched Implications due to Pym and O’Hearn, which combines intuitionistic and multiplicative connectives. This introduces several new connectives not previously considered in logics of informational dependence, but which we show play a very natural rôle, most notably intuitionistic implication. As regards the quantifiers, we show that their interpretation in the Hodges semantics is forced, in that they are the image under the general construction of the usual Tarski semantics; this implies that they are adjoints to substitution, and hence uniquely determined. As for the dependence predicate, we show that this is definable from a simpler predicate, of constancy or dependence on nothing. This makes essential use of the intuitionistic implication. The Armstrong axioms for functional dependence are then recovered as a standard set of axioms for intuitionistic implication. We also prove a full abstraction result in the style of Hodges, in which the intuitionistic implication plays a very natural rôle. 1.
A Theory of Adjoint Functors —with some Thoughts about their Philosophical Significance
, 2005
"... The question “What is category theory ” is approached by focusing on universal mapping properties and adjoint functors. Category theory organizes mathematics using morphisms that transmit structure and determination. Structures of mathematical interest are usually characterized by some universal map ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The question “What is category theory ” is approached by focusing on universal mapping properties and adjoint functors. Category theory organizes mathematics using morphisms that transmit structure and determination. Structures of mathematical interest are usually characterized by some universal mapping property so the general thesis is that category theory is about determination through universals. In recent decades, the notion of adjoint functors has moved to centerstage as category theory’s primary tool to characterize what is important and universal in mathematics. Hence our focus here is to present a theory of adjoint functors, a theory which shows that all adjunctions arise from the birepresentations of “chimeras ” or “heteromorphisms ” between the objects of different categories. Since representations provide universal mapping properties, this theory places adjoints within the framework of determination through universals. The conclusion considers some unreasonably effective analogies between these mathematical