Results 1 
5 of
5
Full completeness of the multiplicative linear logic of chu spaces
 Proc. IEEE Logic in Computer Science 14
, 1999
"... We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cutfree proofs of MLL theorems are in a natural bijection with the binary logical transformations of the corresponding operations on the category of Chu spaces on ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cutfree proofs of MLL theorems are in a natural bijection with the binary logical transformations of the corresponding operations on the category of Chu spaces on a twoletter alphabet. This is the online version of the paper of the same title appearing in the LICS’99 proceedings. 1
Towards Semantics of SelfAdaptive Software
, 2000
"... When people perform computations, they routinely monitor their results, and try to adapt and improve their algorithms when a need arises. The idea of selfadaptive software is to implement this common facility of human mind within the framework of the standard logical methods of software engineering ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
When people perform computations, they routinely monitor their results, and try to adapt and improve their algorithms when a need arises. The idea of selfadaptive software is to implement this common facility of human mind within the framework of the standard logical methods of software engineering. The ubiquitous practice of testing, debugging and improving programs at the design time should be automated, and established as a continuing run time routine. Technically, the task thus requires combining functionalities of automated software development tools and of runtime environments. Such combinations lead not just to challenging engineering problems, but also to novel theoretical questions. Formal methods are needed, and the standard techniques do not suffice. As a first contribution in this direction, we present a basic mathematical framework suitable for describing selfadaptive software at a high level of semantical abstraction. A static view leads to a structure akin...
Coalgebras, Chu Spaces, and Representations of Physical Systems
, 2009
"... We revisit our earlier work on the representation of quantum systems as Chu spaces, and investigate the use of coalgebra as an alternative framework. On the one hand, coalgebras allow the dynamics of repeated measurement to be captured, and provide mathematical tools such as final coalgebras, bisimu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We revisit our earlier work on the representation of quantum systems as Chu spaces, and investigate the use of coalgebra as an alternative framework. On the one hand, coalgebras allow the dynamics of repeated measurement to be captured, and provide mathematical tools such as final coalgebras, bisimulation and coalgebraic logic. However, the standard coalgebraic framework does not accommodate contravariance, and is too rigid to allow physical symmetries to be represented. We introduce a fibrational structure on coalgebras in which contravariance is represented by indexing. We use this structure to give a universal semantics for quantum systems based on a final coalgebra construction. We characterize equality in this semantics as projective equivalence. We also define an analogous indexed structure for Chu spaces, and use this to obtain a novel categorical description of the category of Chu spaces. We use the indexed structures of Chu spaces and coalgebras over a common base to define a truncation functor from coalgebras to Chu spaces. This truncation functor is used to lift the full and faithful representation of the groupoid of physical symmetries on Hilbert spaces into Chu spaces, obtained in our previous work, to the coalgebraic semantics.
AN EXTENDED VIEW OF THE CHUCONSTRUCTION
"... Abstract. The cyclic Chuconstruction for closed bicategories with pullbacks, which generalizes the original Chuconstruction for symmetric monoidal closed categories, turns out to have a noncyclic counterpart. Both use socalled Chuspans as new 1cells between 1cells of the underlying bicategory ..."
Abstract
 Add to MetaCart
Abstract. The cyclic Chuconstruction for closed bicategories with pullbacks, which generalizes the original Chuconstruction for symmetric monoidal closed categories, turns out to have a noncyclic counterpart. Both use socalled Chuspans as new 1cells between 1cells of the underlying bicategory, which form the new objects. Chuspans may be seen as a natural generalization of 2cellspans in the base bicategory that no longer are confined to a single homcategory. This view helps to clarify the composition of Chuspans. We consider various approaches of linking the underlying bicategory with the newly constructed ones, for example, by means of twodimensional generalizations of bifibrations. In the quest for
Negation and Involutive Adjunctions
, 2005
"... This note analyzes in terms of categorial proof theory some standard assumptions about negation in the absence of any other connective. It is shown that the assumptions for an involutive negation, like classical negation, make a kind of adjoint situation, which is named involutive adjunction. The no ..."
Abstract
 Add to MetaCart
(Show Context)
This note analyzes in terms of categorial proof theory some standard assumptions about negation in the absence of any other connective. It is shown that the assumptions for an involutive negation, like classical negation, make a kind of adjoint situation, which is named involutive adjunction. The notion of involutive adjunction amounts in a precise sense to adjunction where an endofunctor is adjoint to itself.