Results 1  10
of
19
Weakly Distributive Categories
 Journal of Pure and Applied Algebra
, 1991
"... There are many situations in logic, theoretical computer science, and category theory where two binary operationsone thought of as a (tensor) "product", the other a "sum"play a key role. In distributive and autonomous categories these operations can be regarded as, respectively, the and/or of ..."
Abstract

Cited by 112 (19 self)
 Add to MetaCart
There are many situations in logic, theoretical computer science, and category theory where two binary operationsone thought of as a (tensor) "product", the other a "sum"play a key role. In distributive and autonomous categories these operations can be regarded as, respectively, the and/or of traditional logic and the times/par of (multiplicative) linear logic. In the latter logic, however, the distributivity of product over sum is conspicuously absent: this paper studies a "linearization" of that distributivity which is present in both case. Furthermore, we show that this weak distributivity is precisely what is needed to model Gentzen's cut rule (in the absence of other structural rules) and can be strengthened in a natural way to generate  autonomous categories. We also point out that this "linear" notion of distributivity is virtually orthogonal to the usual notion as formalized by distributive categories. 0 Introduction There are many situations in logic, theoretical co...
A Brief Guide to Linear Logic
, 1993
"... An overview of linear logic is given, including an extensive bibliography and a simple example of the close relationship between linear logic and computation. ..."
Abstract

Cited by 53 (8 self)
 Add to MetaCart
An overview of linear logic is given, including an extensive bibliography and a simple example of the close relationship between linear logic and computation.
Applications of Linear Logic to Computation: An Overview
, 1993
"... This paper is an overview of existing applications of Linear Logic (LL) to issues of computation. After a substantial introduction to LL, it discusses the implications of LL to functional programming, logic programming, concurrent and objectoriented programming and some other applications of LL, li ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
This paper is an overview of existing applications of Linear Logic (LL) to issues of computation. After a substantial introduction to LL, it discusses the implications of LL to functional programming, logic programming, concurrent and objectoriented programming and some other applications of LL, like semantics of negation in LP, nonmonotonic issues in AI planning, etc. Although the overview covers pretty much the stateoftheart in this area, by necessity many of the works are only mentioned and referenced, but not discussed in any considerable detail. The paper does not presuppose any previous exposition to LL, and is addressed more to computer scientists (probably with a theoretical inclination) than to logicians. The paper contains over 140 references, of which some 80 are about applications of LL. 1 Linear Logic Linear Logic (LL) was introduced in 1987 by Girard [62]. From the very beginning it was recognized as relevant to issues of computation (especially concurrency and stat...
The Stone gamut: A coordinatization of mathematics
 In Logic in Computer Science
, 1995
"... We give a uniform representation of the objects of mathematical practice as Chu spaces, forming a concrete selfdual bicomplete closed category and hence a constructive model of linear logic. This representation distributes mathematics over a twodimensional space we call the Stone gamut. The Stone ..."
Abstract

Cited by 30 (13 self)
 Add to MetaCart
We give a uniform representation of the objects of mathematical practice as Chu spaces, forming a concrete selfdual bicomplete closed category and hence a constructive model of linear logic. This representation distributes mathematics over a twodimensional space we call the Stone gamut. The Stone gamut is coordinatized horizontally by coherence, ranging from −1 for sets to 1 for complete atomic Boolean algebras (CABA’s), and vertically by complexity of language. Complexity 0 contains only sets, CABA’s, and the inconsistent empty set. Complexity 1 admits noninteracting setCABA pairs. The entire Stone duality menagerie of partial distributive lattices enters at complexity 2. Groups, rings, fields, graphs, and categories have all entered by level 16, and every category of relational structures and their homomorphisms eventually appears. The key is the identification of continuous functions and homomorphisms, which puts StonePontrjagin duality on a uniform basis by merging algebra and topology into a simple common framework. 1 Mathematics from matrices We organize much of mathematics into a single category Chu of Chu spaces, or games as Lafont and Streicher have called them [LS91]. A Chu space is just a matrix that we shall denote =, but unlike the matrices of linear algebra, which serve as representations of linear transformations, Chu spaces serve as representations of the objects of mathematics, and their essence resides in how they transform. This organization permits a general twodimensional classification of mathematical objects that we call the Stone gamut 1, distributed horizontally by ∗This work was supported by ONR under grant number N0001492J1974. 1 “Spectrum, ” the obvious candidate for this appliction, already has a standard meaning in Stone duality, namely the representation of the dual space of a lattice by its prime ideals. “A
A Linear Specification Language for Petri Nets
, 1991
"... This paper defines a category GNet with object set all Petri nets. A morphism in GNet from a net N to a net N ’ gives a precise way of simulating every evolution of N by an evolution of N’. We exhibit a morphism from a simple message handler to one with error—correction, showing that the more refine ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
This paper defines a category GNet with object set all Petri nets. A morphism in GNet from a net N to a net N ’ gives a precise way of simulating every evolution of N by an evolution of N’. We exhibit a morphism from a simple message handler to one with error—correction, showing that the more refined message handler can simulate any behaviour ofits simple counterpart. The existence of such a morphism proves the correctness of the refinement. Earlier work [BroPO, BG9O, BG] defined a modular theory of elementary Petri nets based on de Paiva’s Dialectica categorical models of linear logic. We here modify her construction, defining categories MNC which model intuitionistic linear logic [GL87]. GNet arises naturally from MNSOt, inheriting the structure which models linear logic. This more general framework has several advantages over our previous one. The theory is simplified, we obtain precise results about morphisms as simulations, relating them to CCS, and we obtain a natural extension to marked nets. The linear connectives are modelled in GNet by net combinators. Being functonal, these combinators opt are such that, if each N~is refined by a net N~,then op~(Ns Nm) is refined by opt(N ~ N~,,).We show that the operation of restriction also has this property, and thus (in the language of algebraic specification) our notion ofrefinement composes horizontally with respect to the linear connectives and restriction. Furthermore, our notion ofrefinement composes vertically because it corresponds to categorical morphisms. These properties of our notion of refinement are precisely those required to develop an algebra of nets in which complex nets can be built from smaller components, and refined in a modular and compositional way. We illustrate our approach with an extended example, analogous to Mllner’s Jobshop example. 1
Higher Dimensional Automata Revisited
 MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 2000
"... ..."
Chu Spaces as a Semantic Bridge Between Linear Logic and Mathematics
 Theoretical Computer Science
, 1998
"... The motivating role of linear logic is as a "logic behind logic." We propose a sibling role for it as a logic of transformational mathematics via the selfdual category of Chu spaces, a generalization of topological spaces. These create a bridge between linear logic and mathematics by soundly interp ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
The motivating role of linear logic is as a "logic behind logic." We propose a sibling role for it as a logic of transformational mathematics via the selfdual category of Chu spaces, a generalization of topological spaces. These create a bridge between linear logic and mathematics by soundly interpreting linear logic while fully and concretely embedding a comprehensive range of concrete categories of mathematics. Our main goal is to treat each end of this bridge in expository detail. In addition we introduce the dialectic lambdacalculus, and show that dinaturality semantics is not fully complete for the Chu interpretation of linear logic. 1 Introduction Linear logic was introduced by J.Y. Girard as a "logic behind logic." It separates logical reasoning into a core linear part in which formulas are merely moved around, and an auxiliary nonlinear part in which formulas may be deleted and copied. The core, multiplicative linear logic (MLL), is a substructural logic whose basic connect...
THE CHU CONSTRUCTION
, 1996
"... We take another look at the Chu construction and show how to simplify it by looking at ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We take another look at the Chu construction and show how to simplify it by looking at
First Order Linear Logic in Symmetric Monoidal Closed Categories
, 1991
"... There has recently been considerable interest in the development of `logical frameworks ' which can represent many of the logics arising in computer science in a uniform way. Within the Edinburgh LF project, this concept is split into two components; the first being a general proof theoretic encodin ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
There has recently been considerable interest in the development of `logical frameworks ' which can represent many of the logics arising in computer science in a uniform way. Within the Edinburgh LF project, this concept is split into two components; the first being a general proof theoretic encoding of logics, and the second a uniform treatment of their model theory. This thesis forms a case study for the work on model theory. The models of many first and higher order logics can be represented as fibred or indexed categories with certain extra structure, and this has been suggested as a general paradigm. The aim of the thesis is to test the strength and flexibility of this paradigm by studying the specific case of Girard's linear logic. It should be noted that the exact form of this logic in the first order case is not entirely certain, and the system treated here is significantly different to that considered by Girard.