Results 1 
7 of
7
A Purely Logical Account of Sequentiality in Proof Search
, 2002
"... A strict correspondence between the proofsearch space of a logical formal system and computations in a simple process algebra is established. Sewuential ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
A strict correspondence between the proofsearch space of a logical formal system and computations in a simple process algebra is established. Sewuential
A Calculus of Order and Interaction
, 1999
"... System MV is a simple, propositional linear calculus that deals with the commutative as wel l as the noncommutative composition of structures. The mul tipl icative fragment of l near l gic is a special case of MV , and the tensor rul does not su#er from unnecessary nondeterminism in cont ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
System MV is a simple, propositional linear calculus that deals with the commutative as wel l as the noncommutative composition of structures. The mul tipl icative fragment of l near l gic is a special case of MV , and the tensor rul does not su#er from unnecessary nondeterminism in context partitioning as it does in the sequent calEE ofl ar l gic.
A Linear Logic View of Gamma Style Computations as Proof Searches
 Coordination Programming: Mechanisms, Models and Semantics. Imperial
"... Using the methodology of abstract logic programming in linear logic, we establish a correct and complete translation between the language Nabla and first order linear logic. Nabla is a modification of the coordination language Gamma with parallel and sequential composition. Nabla, without modifyin ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Using the methodology of abstract logic programming in linear logic, we establish a correct and complete translation between the language Nabla and first order linear logic. Nabla is a modification of the coordination language Gamma with parallel and sequential composition. Nabla, without modifying Gamma basic computational model, is amenable to this kind of analysis, at the price of a weaker expressive power. The translation is correct and complete in the sense that we establish a two way correspondence between computations in Nabla and the search for proofs in a suitable fragment of first order linear logic. Moreover, the translation is not an encoding, meaning that to the algebraic structure of Nabla programs is assigned logical meaning through a nontrivial use of linear logic connectives, as opposed to merely reflecting their operational behavior through a simulation into terms of the logic. In this way we hope that the connection established between the two formalisms can compe...
On Linear Logic Planning and Concurrency
"... We present an approach to linear logic planning where an explicit correspondence between partial order plans and multiplicative exponential linear logic proofs is established. This is performed by extracting partial order plans from sound and complete encodings of planning problems in multiplicativ ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present an approach to linear logic planning where an explicit correspondence between partial order plans and multiplicative exponential linear logic proofs is established. This is performed by extracting partial order plans from sound and complete encodings of planning problems in multiplicative exponential linear logic in a way that exhibits a noninterleaving behavioral concurrency semantics. Relying on this fact, we argue that this work is a crucial step for establishing a common language for concurrency and planning that will allow to carry techniques and methods between these two fields.
Sequent Calculus and the Specification of Computation
, 2001
"... These notes are being used with lectures for CSE 597 at Penn State in Fall 2001. These notes had been prepared to accompany lectures given at the Marktoberdorf Summer School, 29 July – 10 August 1997 for a course titled “Proof Theoretic Specification of Computation”. An earlier draft ..."
Abstract
 Add to MetaCart
These notes are being used with lectures for CSE 597 at Penn State in Fall 2001. These notes had been prepared to accompany lectures given at the Marktoberdorf Summer School, 29 July – 10 August 1997 for a course titled “Proof Theoretic Specification of Computation”. An earlier draft
APurely Logical Account of Sequentiality in Proof Search
"... Abstract Astrictcorrespondence between the proofsearch space of a logical formal system and computations in a simple process algebra is established. Sequential composition in the process algebra corresponds to a logical relation in the formal system—in this sense our approach is purely logical, no ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract Astrictcorrespondence between the proofsearch space of a logical formal system and computations in a simple process algebra is established. Sequential composition in the process algebra corresponds to a logical relation in the formal system—in this sense our approach is purely logical, no axioms or encodings are involved. The process algebra is a minimal restriction of CCS to parallel and sequential composition; the logical system is a minimal extension of multiplicative linear logic. This way we get the first purely logical account of sequentiality in proof search. Since we restrict attention to a small but meaningful fragment, which is then of very broad interest, our techniques should become a common basis for several possible extensions. In particular, we argue about this work being the first step in a twostep research for capturing most of CCS in a purely logical fashion. 1
ACalculus of Order and Interaction
, 2016
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.