Results 1 
9 of
9
On the representation of mccarthy’s amb in the picalculus
 Theor. Comput. Sci
, 2005
"... We study the encoding of λ[], the call by name λcalculus enriched with McCarthy’s amb operator, into the picalculus. Semantically, amb is a challenging operator, for the fairness constraints that it expresses. We prove that, under a certain interpretation of divergence in the λcalculus (weak div ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We study the encoding of λ[], the call by name λcalculus enriched with McCarthy’s amb operator, into the picalculus. Semantically, amb is a challenging operator, for the fairness constraints that it expresses. We prove that, under a certain interpretation of divergence in the λcalculus (weak divergence), a faithful encoding is impossible. However, with a different interpretation of divergence (strong divergence), the encoding is possible, and for this case we derive results and coinductive proof methods to reason about λ[] that are similar to those for the encoding of pure λcalculi. We then use these methods to derive the most important laws concerning amb. We take bisimilarity as behavioural equivalence on the picalculus, which sheds some light on the relationship between fairness and bisimilarity. As a spinoff result, we show that there is no smallstep operational semantics for λ[] that preserves the branching structure of terms and yields the correct predicates of convergence and (weak) divergence. 1
A relational semantics for parallelism and nondeterminism in . . .
, 2011
"... We recently introduced an extensional model of the pure λcalculus living in a canonical cartesian closed category of sets and relations [6]. In the present paper, we study the nondeterministic features of this model. Unlike most traditional approaches, our way of interpreting nondeterminism does ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We recently introduced an extensional model of the pure λcalculus living in a canonical cartesian closed category of sets and relations [6]. In the present paper, we study the nondeterministic features of this model. Unlike most traditional approaches, our way of interpreting nondeterminism does not require any additional powerdomain construction. We show that our model provides a straightforward semantics of nondeterminism (may convergence) by means of unions of interpretations, as well as of parallelism (must convergence) by means of a binary, nonidempotent operation available on the model, which is related to the mix rule of Linear Logic. More precisely, we introduce a λcalculus extended with nondeterministic choice and parallel composition, and we define its operational semantics (based on the may and must intuitions underlying our two additional operations). We describe the interpretation of this calculus in our model and show that this interpretation is ‘sensible’ with respect to our operational semantics: a term
Non determinism through type isomorphism
 LSFA
, 2012
"... We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known nondeterministic and algebraic lambdacalculi. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known nondeterministic and algebraic lambdacalculi.
A Fully Abstract Model for
"... Abstract. Aim of this paper is to develop a filter model for a calculus with mobility and higherorder value passing. We will define it for an extension of the Ambient Calculus in which processes can be passed as values. This model turns out to be fully abstract with respect to the notion of context ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Aim of this paper is to develop a filter model for a calculus with mobility and higherorder value passing. We will define it for an extension of the Ambient Calculus in which processes can be passed as values. This model turns out to be fully abstract with respect to the notion of contextual equivalence where the observables are ambients at top level. 1
On the representation of McCarthy’s ambin the πcalculus
, 2004
"... We study the encoding of λ [] , the call by name λcalculus enriched with McCarthy’s amb operator, into the πcalculus. Semantically, amb is a challenging operator, for the fairness constraints that it expresses. We prove that, under a certain interpretation of divergence in the λcalculus (weak div ..."
Abstract
 Add to MetaCart
We study the encoding of λ [] , the call by name λcalculus enriched with McCarthy’s amb operator, into the πcalculus. Semantically, amb is a challenging operator, for the fairness constraints that it expresses. We prove that, under a certain interpretation of divergence in the λcalculus (weak divergence), a faithful encoding is impossible. However, with a different interpretation of divergence (strong divergence), the encoding is possible, and for this case we derive results and coinductive proof methods to reason about λ [] that are similar to those for the encoding of pure λcalculi. We then use these methods to derive the most important laws concerning amb. We take bisimilarity as behavioural equivalence on the πcalculus, which sheds some light on the relationship between fairness and bisimilarity.
Intersection Types for λTrees
"... We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating λterms (Böhm trees, LévyLongo trees,...). Then we prove, in an (almost) uniform way, that each type assignment system fully describes the observational equivalences induced by th ..."
Abstract
 Add to MetaCart
(Show Context)
We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating λterms (Böhm trees, LévyLongo trees,...). Then we prove, in an (almost) uniform way, that each type assignment system fully describes the observational equivalences induced by the corresponding tree representation of terms. More precisely, for each family of trees, two terms have the same tree if and only if they get assigned the same types in the corresponding type assignment system.
SALT: Selfadaptive, Autonomic, Light Types
"... With the advent of web technologies and the proliferation of programmable and interconnectable devices, we are faced today with a powerful and heterogeneous computing environment. This environment is inherently parallel and distributed and, unlike previous computing environments, it heavily relies ..."
Abstract
 Add to MetaCart
(Show Context)
With the advent of web technologies and the proliferation of programmable and interconnectable devices, we are faced today with a powerful and heterogeneous computing environment. This environment is inherently parallel and distributed and, unlike previous computing environments, it heavily relies on communication. It therefore calls for a new programming paradigm which is sometimes called communicationcentered. Moreover, since computation takes place concurrently in all kinds of different devices, controlled by parties which possibly do not trust each other, security properties such as the confidentiality and integrity of data become of crucial importance. The issue is then to develop models, as well as programming abstractions and methodologies, to be able to exploit the rich potential of this new computing environment, while making sure that we can harness its complexity and resolve its security vulnerabilities. To this end, calculi and languages for communicationcentred programming must be securityminded from their very conception, and make use of specifications not only for data structures, but also for communication interfaces and for security properties. In addition, the need of programming and maintaining eternal, highly decentralised systems (e.g., those considered by the FP7FET initiative Forever Yours) is emphasising the requirement of reliable and dependable applications. However, the forms of verification, mainly static, we are used to tend not to be enough anymore. Therefore, there is a strong demand for designing forms of