Results 1  10
of
100,322
Themen und weitere Hinweise für das Seminar
"... 3.4 Subcalculi of the πcalculus........................... 6 3.5 Contextual equivalence for higherorder picalculus revisited......... 6 3.6 Typed πCalculi................................. 7 3.7 The Join Calculus: A Language for Distributed Mobile Programming.... 7 3.8 May and Must Testing in the ..."
Abstract
 Add to MetaCart
3.4 Subcalculi of the πcalculus........................... 6 3.5 Contextual equivalence for higherorder picalculus revisited......... 6 3.6 Typed πCalculi................................. 7 3.7 The Join Calculus: A Language for Distributed Mobile Programming.... 7 3.8 May and Must Testing
Execution Contexts For Determining Trust In A HigherOrder piCalculus
"... A type system for the higher order picalculus is presented, using boolean annotations to carry information about the integrity of data. This extends previous work by the authors for a first order calculus; we argue that in a higher order setting certain notions of trustedness depend on the potenti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A type system for the higher order picalculus is presented, using boolean annotations to carry information about the integrity of data. This extends previous work by the authors for a first order calculus; we argue that in a higher order setting certain notions of trustedness depend
Contextual Equivalence for the PiCalculus that can Stop
, 2014
"... Abstract. The picalculus is a wellanalyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higherorder concurrent and/or functional programming languages use a contextual semantics observing the termination behavior of ..."
Abstract
 Add to MetaCart
Abstract. The picalculus is a wellanalyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higherorder concurrent and/or functional programming languages use a contextual semantics observing the termination behavior
Contextual equivalence for higherorder πcalculus revisited
, 2004
"... The higherorder πcalculus is an extension of the πcalculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence for higherorder πcalculus is provided using lab ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The higherorder πcalculus is an extension of the πcalculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence for higherorder πcalculus is provided using
Contextual Equivalence for HigherOrder PCalculus Revisited
 Journal of Philosophy
, 1964
"... The higherorder pcalculus is an extension of the pcalculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence for higherorder pcalculus is provided using ..."
Abstract
 Add to MetaCart
The higherorder pcalculus is an extension of the pcalculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence for higherorder pcalculus is provided using
The picalculus
, 2013
"... We formalise the picalculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely followi ..."
Abstract
 Add to MetaCart
We formalise the picalculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely
Stochastic PiCalculus Revisited
"... We develop a version of stochastic Picalculus with replication and fresh name quantification, endowed with a structural operational semantics expressed in terms of measure theory. The paper relies on two observations: (i) the structural congruence organizes a measurable space of processes and (ii) ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We develop a version of stochastic Picalculus with replication and fresh name quantification, endowed with a structural operational semantics expressed in terms of measure theory. The paper relies on two observations: (i) the structural congruence organizes a measurable space of processes and (ii
Termination in a picalculus with Subtyping
"... We present a type system to guarantee termination of picalculus processes that exploits input/output capabilities and subtyping, as originally introduced by Pierce and Sangiorgi, in order to analyse the usage of channels. We show that our system improves over previously existing proposals by accept ..."
Abstract
 Add to MetaCart
We present a type system to guarantee termination of picalculus processes that exploits input/output capabilities and subtyping, as originally introduced by Pierce and Sangiorgi, in order to analyse the usage of channels. We show that our system improves over previously existing proposals
Expressiveness of the piCalculus and the $Calculus
"... Abstract: In this paper we investigate the expressiveness of two process algebras, the picalculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation. In ..."
Abstract
 Add to MetaCart
Abstract: In this paper we investigate the expressiveness of two process algebras, the picalculus of mobile processes and the $calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to superTuring models of computation
Results 1  10
of
100,322