Results 1  10
of
221
Full abstraction for polymorphic picalculus. Online edition with proofs
 Theoretical Computer Science
, 2005
"... Abstract. The problem of finding a fully abstract model for the polymorphic πcalculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open since then. In this paper, we show that a slight variant of their language has a direct fully abstract model, which does not depend on type u ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. The problem of finding a fully abstract model for the polymorphic πcalculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open since then. In this paper, we show that a slight variant of their language has a direct fully abstract model, which does not depend on type
The Polymorphic Picalculus: Theory and Implementation
, 1995
"... We investigate whether the πcalculus is able to serve as a good foundation for the design and implementation of a stronglytyped concurrent programming language. The first half of the dissertation examines whether the πcalculus supports a simple type system which is flexible enough to provide a su ..."
Abstract

Cited by 109 (0 self)
 Add to MetaCart
. Higherorder polymorphism is important, since it gives us the ability to implement abstract datatypes in a typesafe manner, thereby providing a greater degree of modularity for πcalculus programs. The functional computational paradigm plays an important part in many programming languages. It is well
Behavioral Equivalence in the Polymorphic PiCalculus
 JOURNAL OF THE ACM
, 1997
"... We investigate parametric polymorphism in messagebased concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manip ..."
Abstract

Cited by 63 (8 self)
 Add to MetaCart
of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic picalculus and ML.
A Denotational Semantics for the piCalculus
 Fifth Irish Workshop in Formal Methods (IWFM’01
, 2001
"... In his categorical framework, Stark defines a domaintheoretic model for the #calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize St ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Stark's denotational model for the #calculus and provide a full definition of the semantic domains involved. We also include an example of how the model may be approximated in an abstract interpretation analysis. 1
PiCalculus, Dialogue Games and PCF
"... Game semantics is an unusual denotational semantics in that it captures the intentional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantical framework in which to seek to unify analyses of both the qualitative (correctness) as well as the quantitative (effic ..."
Abstract
 Add to MetaCart
with compiletime optimization. 1 PCF: observational preorder and full abstraction The functional language PCF [SC093, P1077] is essentially the simply typed Acalculus augmented by basic arithmetic, con
picalculus in (Co)Inductive Type Theory
 Theoretical Computer Science
, 2001
"... We present a large and we think also significant casestudy in computer assisted formal reasoning. We start by giving a higher order abstract syntax encoding of #calculus in the higherorder inductive/coinductive type theories CIC and CC (Co)Ind . This encoding gives rise to a fullfledged p ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
We present a large and we think also significant casestudy in computer assisted formal reasoning. We start by giving a higher order abstract syntax encoding of #calculus in the higherorder inductive/coinductive type theories CIC and CC (Co)Ind . This encoding gives rise to a full
PiLib: A hosted language for picalculus style concurrency
 In Dagstuhl proc.: DomainSpecific Program Generation
, 2003
"... Abstract. PiLib is a library written in Scala that implements the concurrency constructs of the πcalculus. Some discussed features of the programming language Scala make it possible to use almost the same syntax as in the πcalculus. The huge advantage of this library with respect to any simple πc ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. PiLib is a library written in Scala that implements the concurrency constructs of the πcalculus. Some discussed features of the programming language Scala make it possible to use almost the same syntax as in the πcalculus. The huge advantage of this library with respect to any simple πcalculus
PiLib: A Hosted Language for PiCalculus Style Concurrency
"... Abstract. PiLib is a library written in Scala that implements the concurrency constructs of the sscalculus. Some discussed features of the programming language Scala make it possible to use almost the same syntax as in the sscalculus. The huge advantage of this library with respect to any simple s ..."
Abstract
 Add to MetaCart
Abstract. PiLib is a library written in Scala that implements the concurrency constructs of the sscalculus. Some discussed features of the programming language Scala make it possible to use almost the same syntax as in the sscalculus. The huge advantage of this library with respect to any simple
A Distribution Law for CCS and a New Congruence Result for the Picalculus
 LMCS
"... Abstract. We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite πcalculus in absence of sum. To our knowledge, this is the only nontrivial subcalc ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite πcalculus in absence of sum. To our knowledge, this is the only nontrivial
Process Types as a Descriptive Tool for Interaction Control and the PiCalculus
"... Abstract. We demonstrate a tight relationship between linearly typed πcalculi and typed λcalculi by giving a typepreserving translation from the callbyvalue λµcalculus into a typed πcalculus. The λµcalculus has a particularly simple representation as typed mobile processes. The target calcu ..."
Abstract
 Add to MetaCart
calculus is a simple variant of the linear πcalculus. We establish full abstraction up to maximally consistent observational congruences in source and target calculi using techniques from games semantics and process calculi.
Results 1  10
of
221