Results 11  20
of
29
Simple free starautonomous categories and full coherence
, 2005
"... This paper gives a simple presentation of the free starautonomous category over a category, based on EilenbergKellyMacLane graphs and Trimble rewiring, for full coherence. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
This paper gives a simple presentation of the free starautonomous category over a category, based on EilenbergKellyMacLane graphs and Trimble rewiring, for full coherence.
Explicit Substitution Internal Languages for Autonomous and *Autonomous Categories
 In Proc. Category Theory and Computer Science (CTCS'99), Electron
, 1999
"... We introduce a family of explicit substitution type theories as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the simplytyped calculus with surjective pairing is the internal language for cartesian closed categories. We show tha ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
We introduce a family of explicit substitution type theories as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the simplytyped calculus with surjective pairing is the internal language for cartesian closed categories. We show that the eight equality and three commutation congruence axioms of the autonomous type theory characterise autonomous categories exactly. The associated rewrite systems are all strongly normalising; modulo a simple notion of congruence, they are also confluent. As a corollary, we solve a Coherence Problem a la Lambek [12]: the equality of maps in any autonomous category freely generated from a discrete graph is decidable. 1 Introduction In this paper we introduce a family of type theories which can be regarded as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that the standard simplytyped calculus with surjective pairing is...
On the Algebra of Structural Contexts
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2007
"... We discuss a general way of defining contexts in linear logic, based on the observation that linear universal algebra can be symmetrized by assigning an additional variable to represent the output of a term. We give two approaches to this, a syntactical one based on a new, reversible notion of term, ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We discuss a general way of defining contexts in linear logic, based on the observation that linear universal algebra can be symmetrized by assigning an additional variable to represent the output of a term. We give two approaches to this, a syntactical one based on a new, reversible notion of term, and an algebraic one based on a simple generalization of typed operads. We relate these to each other and to known examples of logical systems, and show new examples, in particular discussing the relationship between intuitionistic and classical systems. We then present a general framework for extracting deductive systems from a given theory of contexts, and give a generic proof that all these systems have cutelimination.
A sequent calculus for compact closed categories
"... In this paper, we introduce the system CMLL of sequent calculus and establish its correspondence with compact closed categories. CMLL is equivalent in provability to the system MLL of classical linear logic with the tensor and par connectives identified. We show that the system allows a fairly simpl ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we introduce the system CMLL of sequent calculus and establish its correspondence with compact closed categories. CMLL is equivalent in provability to the system MLL of classical linear logic with the tensor and par connectives identified. We show that the system allows a fairly simple cutelimination, and the proofs in the system have a natural interpretation in compact closed categories. However, the soundness of the cutelimination procedure in terms of the categorical interpretation is by no means evident. We answer to this question affirmatively and establish the soundness by using the coherence result on compact closed categories by Kelly and Laplaza. 1
Type Theories for Autonomous and *Autonomous Categories: I. Type Theories and Rewrite Systems  II. Internal Languages and Coherence Theorems
, 1998
"... We introduce a family of type theories as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that simplytyped calculus (augmented by appropriate constructs for products and the terminal object) is the internal language for cartesian clos ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We introduce a family of type theories as internal languages for autonomous (or symmetric monoidal closed) and autonomous categories, in the same sense that simplytyped calculus (augmented by appropriate constructs for products and the terminal object) is the internal language for cartesian closed categories. The rules are presented in the style of Gentzen's Sequent Calculus. A key feature is the systematic treatment of naturality conditions by explicitly representing the categorical composition, or cut in the type theory, by explicit substitution, and the introduction of new letconstructs, one for each of the three type constructors ?;\Omega and (, and a Parigotstyle ¯abstraction to give expression to the involutive negation. The commutation congruences of these theories are precisely those imposed by the naturality conditions. In particular the type theory for autonomous categories may be regarded as a term assignment system for the multiplicative (\Omega ; (;?;?)fragmen...
Fock Space: A Model of Linear Exponential Types
, 1994
"... It has been observed by several people that, in certain contexts, the free symmetric algebra construction can provide a model of the linear modality ! . This construction arose independently in quantum physics, where it is considered as a canonical model of quantum field theory. In this context, the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
It has been observed by several people that, in certain contexts, the free symmetric algebra construction can provide a model of the linear modality ! . This construction arose independently in quantum physics, where it is considered as a canonical model of quantum field theory. In this context, the construction is known as (bosonic) Fock space. Fock space is used to analyze such quantum phenomena as the annihilation and creation of particles. There is a strong intuitive connection to the principle of renewable resource, which is the philosophical interpretation of the linear modalities. In this paper, we examine Fock space in several categories of vector spaces. We first consider vector spaces, where the Fock construction induces a model of the\Omega ; &; ! fragment in the category of symmetric algebras. When considering Banach spaces, the Fock construction provides a model of a weakening cotriple in the sense of Jacobs. While the models so obtained model a smaller fragment, it is cl...
A specification structure for deadlockfreedom of synchronous processes
 TCS
, 1999
"... Many different notions of "program property", and many different methods of verifying such properties, arise naturally in programming. We present a general framework of Specification Structures for combining different notions and methods in a coherent fashion. We then apply the ide ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Many different notions of &quot;program property&quot;, and many different methods of verifying such properties, arise naturally in programming. We present a general framework of Specification Structures for combining different notions and methods in a coherent fashion. We then apply the idea of specification structures to concurrency in the setting of Interaction Categories. As a specific example, a certain specification
A logical basis for quantum evolution and entanglement
, 2011
"... We reconsider discrete quantum casual dynamics where quantum systems are viewed as discrete structures, namely directed acyclic graphs. In such a graph, events are considered as vertices and edges depict propagation between events. Evolution is described as happening between a special family of spa ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We reconsider discrete quantum casual dynamics where quantum systems are viewed as discrete structures, namely directed acyclic graphs. In such a graph, events are considered as vertices and edges depict propagation between events. Evolution is described as happening between a special family of spacelike slices, which were referred to as locative slices. Such slices are not so large as to result in acausal influences, but large enough to capture nonlocal correlations. In our logical interpretation, edges are assigned logical formulas in a special logical system, called BV, an instance of a deep inference system. We demonstrate that BV, with its mix of commutative and noncommutative connectives, is precisely the right logic for such analysis. We show that the commutative tensor encodes (possible) entanglement, and the noncommutative seq encodes causal precedence. With this interpretation, the locative slices are precisely the derivable strings of formulas.
A canonical graphical syntax for nonempty finite products and sums
, 2002
"... system for finite products and sums, and proved decidability of equality of morphisms. The question remained ∗ as to whether one can present free categories with finite products and sums in a canonical way, i.e., as a category with morphisms and composition defined directly, rather than modulo equiv ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
system for finite products and sums, and proved decidability of equality of morphisms. The question remained ∗ as to whether one can present free categories with finite products and sums in a canonical way, i.e., as a category with morphisms and composition defined directly, rather than modulo equivalence relations. This paper shows that the nonempty case (i.e., omitting initial and final objects) can be treated in a surprisingly simple way: morphisms of the free category can be viewed as certain binary relations, with composition the usual composition of binary relations. In particular, there is a forgetful functor into the category Rel of sets and binary relations. The paper ends by relating these binary relations to proof nets. 1
Deep Inference and Probabilistic Coherence Spaces
, 2009
"... This paper proposes a definition of categorical model of the deep inference system BV, introduced by Guglielmi. Our definition is based on the notion of a linear functor, due to Cockett and Seely. A BVcategory is a linearly distributive category, possibly with negation, with an additional tensor pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper proposes a definition of categorical model of the deep inference system BV, introduced by Guglielmi. Our definition is based on the notion of a linear functor, due to Cockett and Seely. A BVcategory is a linearly distributive category, possibly with negation, with an additional tensor product which, when viewed as a bivariant functor, is linear with a degeneracy condition. We show that this simple definition implies all of the key isomorphisms of the theory. We show that coherence spaces, with Retoré’s noncommutative tensor, is a model.We then consider Girard’s category of probabilistic coherence spaces and show that it contains a selfdual monoidal structure in addition to the ∗autonomous structure exhibited by Girard. This