Results 1 
8 of
8
Restriction Categories I
 Categories of Partial Maps, Theoret. Comput. Sci
, 2006
"... modality”) and a differential combinator, satisfying a number of coherence conditions. In ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
modality”) and a differential combinator, satisfying a number of coherence conditions. In
An algebraic process calculus
 In Proceedings of the twentythird annual IEEE symposium on logic in computer science (LICS
, 2008
"... We present an extension of the πIcalculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions about the behaviour of the environment of a process. Furthermore, the formal sum appears as a fundamental construct that can ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We present an extension of the πIcalculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions about the behaviour of the environment of a process. Furthermore, the formal sum appears as a fundamental construct that can be used to decompose both internal and external choice. From these observations, we derive an enriched calculus that enjoys a confluent reduction which preserves the testing semantics of processes. This system is shown to be strongly normalising for terms without replication, and the study of its normal forms provides a fully abstract trace semantics for testing of πI processes. 1.
Order algebras: a quantitative model of interaction
, 2010
"... Abstract. A quantitative model of concurrent interaction in introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential nondeterminism in synchronisation. This algebraic structure is shown to provide faithful inte ..."
Abstract
 Add to MetaCart
Abstract. A quantitative model of concurrent interaction in introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential nondeterminism in synchronisation. This algebraic structure is shown to provide faithful interpretations of finitary process algebras, for an extension of the standard notion of testing semantics, leading to a model that is both denotational (in the sense that the internal workings of processes are ignored) and noninterleaving. Constructions on algebras and their subspaces enjoy a good structure that make them (nearly) a model of differential linear logic, showing that the underlying approach to the representation of nondeterminism as linear
A convenient differential
, 2011
"... We show that the category of convenient vector spaces in the sense of Frölicher ..."
Abstract
 Add to MetaCart
We show that the category of convenient vector spaces in the sense of Frölicher
A Completeness Theorem for “Total Boolean Functions”
, 905
"... Abstract. In [3], Christine Tasson introduces an algebraic notion of totality for a denotational model of linear logic. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer to the question of completeness of the “boolean centroidal calculus ” w.r.t ..."
Abstract
 Add to MetaCart
Abstract. In [3], Christine Tasson introduces an algebraic notion of totality for a denotational model of linear logic. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer to the question of completeness of the “boolean centroidal calculus ” w.r.t. total boolean functions.
Finiteness spaces, graphs and “coherence”
, 905
"... Abstract. We look at a subcollection of finiteness spaces introduced in [2] based on the notion of coherence spaces from [4]. The original idea was to generalize the notion of stable functions between coherence spaces to interpret the algebraic lambdacalculus ([6]) or even the differential lambda ..."
Abstract
 Add to MetaCart
Abstract. We look at a subcollection of finiteness spaces introduced in [2] based on the notion of coherence spaces from [4]. The original idea was to generalize the notion of stable functions between coherence spaces to interpret the algebraic lambdacalculus ([6]) or even the differential lambdacalculus ([3]). An important tool for this analysis is the infinite Ramsey theorem. 0. Introduction. The category of coherence spaces was the first denotational model for linear logic (see [4]): the basic objects are reflexive, non oriented graphs; and we are more specifically interested by their cliques (complete subgraph). If C is such a graph, we write C(C) for the collection of its cliques. Coherence spaces enjoy a very rich algebraic structure where the most important
unknown title
, 2006
"... modality”) and a differential combinator, satisfying a number of coherence conditions. In ..."
Abstract
 Add to MetaCart
modality”) and a differential combinator, satisfying a number of coherence conditions. In
A Completeness Theorem for “Total Boolean Functions”
"... Abstract. In [3], Christine Tasson introduces an algebraic notion of totality for a denotational model of linear logic. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer to the question of completeness of the “boolean centroidal calculus ” w.r.t ..."
Abstract
 Add to MetaCart
Abstract. In [3], Christine Tasson introduces an algebraic notion of totality for a denotational model of linear logic. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer to the question of completeness of the “boolean centroidal calculus ” w.r.t. total boolean functions.