Results 1  10
of
2,726
Multiaction $\pi$calculus
"... We propose a new trulyconcurrent semantics for the $\pi \mathrm{c}\mathrm{a}\mathrm{l}\mathrm{C}\mathrm{u}\mathrm{l}\mathrm{u}\mathrm{s}[1] $. We extend the labelled transition system of the $\pi$calculus to use multisets of actions as labels. We call this extension multiaction $\pi$calculus. ..."
Abstract
 Add to MetaCart
We propose a new trulyconcurrent semantics for the $\pi \mathrm{c}\mathrm{a}\mathrm{l}\mathrm{C}\mathrm{u}\mathrm{l}\mathrm{u}\mathrm{s}[1] $. We extend the labelled transition system of the $\pi$calculus to use multisets of actions as labels. We call this extension multiaction $\pi$calculus
\PiCalculus with Type Similarity
, 1995
"... Motivated by the problems of the undecidablity of higherorder unification and hence the undecidability of \Piunification, Pym and Elliott give a weaker notion of typing for \Piobjects : type similarity. In this paper we present a new calculus giving a formal theory of type similarity that capture ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
that captures this weaker notion of typing. We then apply a variant of Hardin's interpretation method to show that welltyped terms of this new calculus are confluent and normalizing for fijreduction. This is done by defining two translations of the new calculus into the \Picalculus. We then use
On Differential Interaction Nets and the Picalculus
 Preuves, Programmes et Systèmes
, 2006
"... We propose a translation of a finitary (that is, replicationfree) version of the picalculus into promotionfree differential interaction net structures, a linear logic version of the differential lambdacalculus (or, more precisely, of a resource lambdacalculus). For the sake of simplicity only, w ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We propose a translation of a finitary (that is, replicationfree) version of the picalculus into promotionfree differential interaction net structures, a linear logic version of the differential lambdacalculus (or, more precisely, of a resource lambdacalculus). For the sake of simplicity only
A Rewriting Implementation of picalculus
, 1996
"... . We introduce a rewriting implementation of the reduction relation of ßcalculus and prove its correctness. The implementation is based on terms with De Bruijn indices and an explicit substitution operator. The resulting rewrite rules need to be applied modulo a large and complex equational theory, ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. We introduce a rewriting implementation of the reduction relation of ßcalculus and prove its correctness. The implementation is based on terms with De Bruijn indices and an explicit substitution operator. The resulting rewrite rules need to be applied modulo a large and complex equational theory
Investigating the Logical Aspects of the Picalculus
"... Abstract. The relations between the πcalculus and logic have been less extensively studied than for the λcalculus. We give an account on what can be found in the literature, in two distinct directions: modelchecking, and typing. We propose a CurryHoward correspondence taking into account the dyna ..."
Abstract
 Add to MetaCart
Abstract. The relations between the πcalculus and logic have been less extensively studied than for the λcalculus. We give an account on what can be found in the literature, in two distinct directions: modelchecking, and typing. We propose a CurryHoward correspondence taking into account
From a Concurrent lambdacalculus to the picalculus
"... . We explore the (dynamic) semantics of a simply typed  calculus enriched with parallel composition, dynamic channel generation, and inputoutput communication primitives. The calculus, called the k  calculus, can be regarded as the kernel of concurrentfunctional languages such as LCS, CML and ..."
Abstract
 Add to MetaCart
. We explore the (dynamic) semantics of a simply typed  calculus enriched with parallel composition, dynamic channel generation, and inputoutput communication primitives. The calculus, called the k  calculus, can be regarded as the kernel of concurrentfunctional languages such as LCS, CML
Embedding the finitary picalculus in differential interaction nets
 In Proceedings of the Higher Order Rewriting workshop (HOR 2006
, 2006
"... Abstract. We propose a translation of a finitary (that is, replicationfree) version of the monadic localised picalculus into the purely exponential part of promotionfree differential interaction nets. This embedding is a simulation of reduction. Since the introduction of Linear Logic by Girard in ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Abstract. We propose a translation of a finitary (that is, replicationfree) version of the monadic localised picalculus into the purely exponential part of promotionfree differential interaction nets. This embedding is a simulation of reduction. Since the introduction of Linear Logic by Girard
Results 1  10
of
2,726