Remark on Some $$\pi $$ Variants

Xue, Jianxin; Long, Huan; Fu, Yuxi

doi:10.1007/978-3-319-69483-2_11

Cited by 2 publications

(6 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At the moment we know that π, π L , π R , π S , π M are complete. See [27] for a formal definition of completeness and [105] for additional discussions and proofs.…”

Section: Variantsmentioning

confidence: 99%

“…The external characterization of the absolute equality for a particular model is an important issue. It has been resolved for π L , π R in [105]. It is definitely a technically interesting but probably tricky exercise to remove the remaining question marks in Fig.…”

Section: P C I C Jmentioning

confidence: 99%

“…Proof systems for π-variants can be obtained by extending AS with additional laws. For example the following two axiom schemes are introduced in [105].…”

Section: N(x)s + N(x)t = N(x)s + N(x)t + N(x)([x=y]s + [X Y]t )mentioning

confidence: 99%

“…It is pointed out by Xue, Long and Fu [105] that AS ∪ {(36)} is complete for π L and that AS ∪ {(37)} is complete for π R .…”

Section: N(c)c[c(x)t ] = N(c)c[0] (37)mentioning

confidence: 99%

“…In [27] it is shown that π M is complete in the sense that it satisfies the Axiom of Completeness. In [105] the completeness of π L , π R and π S is established. So it makes sense to talk about problem solving in all these π-variants.…”

Section: Axiom Of Completenessmentioning

confidence: 99%

See 4 more Smart Citations

The Name-Passing Calculus

Fu,

Zhu

2015

Preprint

Self Cite

View full text Add to dashboard Cite

Name-passing calculi are foundational models for mobile computing. Research into these models has produced a wealth of results ranging from relative expressiveness to programming pragmatics. The diversity of these results call for clarification and reorganization. This paper applies a model independent approach to the study of the namepassing calculi, leading to a uniform treatment and simplification. The technical tools and the results presented in the paper form the foundation for a theory of name-passing calculus.

show abstract

“…At the moment we know that π, π L , π R , π S , π M are complete. See [27] for a formal definition of completeness and [105] for additional discussions and proofs.…”

Section: Variantsmentioning

confidence: 99%

Section: P C I C Jmentioning

confidence: 99%

“…Proof systems for π-variants can be obtained by extending AS with additional laws. For example the following two axiom schemes are introduced in [105].…”

Section: N(x)s + N(x)t = N(x)s + N(x)t + N(x)([x=y]s + [X Y]t )mentioning

confidence: 99%

“…It is pointed out by Xue, Long and Fu [105] that AS ∪ {(36)} is complete for π L and that AS ∪ {(37)} is complete for π R .…”

Section: N(c)c[c(x)t ] = N(c)c[0] (37)mentioning

confidence: 99%

Section: Axiom Of Completenessmentioning

confidence: 99%

See 3 more Smart Citations