A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
D-Fusion: A Distinctive Fusion Calculus
[chapter]

2004
*
Lecture Notes in Computer Science
*

Actually, we prove that there is no uniform

doi:10.1007/978-3-540-30477-7_20
fatcat:3sub7t5czfcalab5sbqzdcn6ay
*fully**abstract*embedding*of**pi*-*calculus*into Fusion. This fact motivates*the*introduction*of**a*new*calculus*, D-Fusion,*with*two binders, λ and ν. ...*The*expressiveness gap is further clarified by*the*existence*of**a**fully**abstract**encoding**of*mixed guarded choice into*the*choice-free fragment*of*D-Fusion. ... For*the*time being, we just note that distributed implementations*of**pi*/fusion-like calculi do exist (e.g.,*the*fusion machine*of*[3] ) and may represent*a*good starting point for distributed implementations ...##
###
Priorities Without Priorities: Representing Preemption in Psi-Calculi

2014
*
Electronic Proceedings in Theoretical Computer Science
*

Psi-calculi is

doi:10.4204/eptcs.160.2
fatcat:ljnbyxyglreldan6v2oxhoozgq
*a*parametric framework for extensions*of**the**pi*-*calculus**with**data**terms*and arbitrary logics. ... To accomplish this we define an extension*of*psi-calculi*with*action priorities, and show that for every*calculus*in*the*extended framework there is*a*corresponding ordinary psi-*calculus*, without priorities ... An investigation*of*this is deferred to future work.*A*related question is whether*a**fully**abstract**encoding**of*P into some psi-*calculus*exists. ...##
###
A fully-abstract semantics of lambda-mu in the pi-calculus

2014
*
Electronic Proceedings in Theoretical Computer Science
*

We study

doi:10.4204/eptcs.164.3
fatcat:ho2ne6x2obaqzcivrykulohdqi
*the*lambda-mu-*calculus*, extended*with*explicit substitution, and define*a*compositional output-based interpretation into*a*variant*of**the**pi*-*calculus**with*pairing that preserves single-step explicit ... We will then show full*abstraction*results for our interpretation for*the*weak equivalences*with*respect to weak bisimilarity on processes. ... Conclusions and future work We have studied*the*output based, logic-inspired interpretation*of*untyped λµ*with*explicit substitution into*the*π-*calculus*and shown that this interpretation is*fully**abstract*...##
###
A Fully Abstract Encoding of the π-Calculus with Data Terms
[chapter]

2005
*
Lecture Notes in Computer Science
*

We present

doi:10.1007/11523468_97
fatcat:rigeajdx35andkidkvb6skzoiu
*a*new type*of**encoding*and prove it to be*fully**abstract**with*respect to may-testing equivalence. ... To our knowledge this is*the*first result*of*its kind, for any*calculus*enriched*with**data**terms*. ... In this paper we study*a*prototypical such formalism,*a*π-*calculus*enriched*with**data**terms*(πT), and show how it can be*encoded*in*the*more fundamental π-*calculus*[13] while preserving full*abstraction*...##
###
Pi-calculus, dialogue games and full abstraction PCF

1995
*
Proceedings of the seventh international conference on Functional programming languages and computer architecture - FPCA '95
*

'On leave from

doi:10.1145/224164.224189
dblp:conf/fpca/HylandO95
fatcat:wtbxr6b7c5dixhn2huts64hxde
*the*National University*of*Singapore. lo@comlab ox.ac.uk. ... nouce, lhe title o f*the*publication and its date appear. and notice is given that copyright is by pemussIon*of**the*. ... We thank Pierre-Louis Curien for numerous insightful email and fax messages on game interpretation*of*PcF, and David Walker for most helpful comments on*a*draft*of*this paper. ...##
###
The Fusion Machine
[chapter]

2002
*
Lecture Notes in Computer Science
*

We implement in

doi:10.1007/3-540-45694-5_28
fatcat:lnpanswwgnghtliwkbvaknegxe
*the*fusion machine*a*solos*calculus**with*explicit fusions. There are*encodings*into this*calculus*from*the**pi**calculus*and*the*explicit fusion*calculus*. ... In particular, we describe*a*distributed*abstract*machine called*the*fusion machine. In it, only channels exist at runtime. ... Introduction*The**pi**calculus*has become*a*dominant*calculus*in*the*field*of*concurrency,*with*many variants. ...##
###
πI: A symmetric calculus based on internal mobility
[chapter]

1995
*
Lecture Notes in Computer Science
*

For instance, in

doi:10.1007/3-540-59293-8_194
fatcat:rg7sgu7whbh7pa6lhwrdncbtse
*the*7r-*calculus*there are simple and intuitive*encodings*for:*Data*values [MPW92, Mi191], agent-passing process calculi [Tho90, San92] (i.e., calculi where*terms**of**the*language can be ...*The**encoding**of**the**A*-*calculus*into ~I is studied in Section 5: It is challenging because all known*encodings**of**the**A*-*calculus*into 7r-*calculus*exploit, in an important way,*the*free-output construct, ...*The**encodings*are*fully**abstract*w.r.t,*the*reduction relations*of**the*two calculi. ...##
###
A Fully Abstract Symbolic Semantics for Psi-Calculi

2010
*
Electronic Proceedings in Theoretical Computer Science
*

*A*psi-

*calculus*is an extension

*of*

*the*

*pi*-

*calculus*

*with*nominal

*data*types for

*data*structures and for logical assertions representing facts about

*data*. ... We present

*a*symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is

*fully*

*abstract*

*with*respect to bisimulation congruence in

*the*non-symbolic semantics. ...

*The*existing tools for calculi based on

*the*applied

*pi*-

*calculus*(e.g. [1, 7, 8] ), are not

*fully*

*abstract*wrt bisimulation. ...

##
###
Linear Forwarders
[chapter]

2003
*
Lecture Notes in Computer Science
*

We also design

doi:10.1007/978-3-540-45187-7_27
fatcat:drkt5xo3d5gqbhmqxlko4lzeu4
*a*distributed machine, demonstrating*the*ease*with*which we can implement*the**pi**calculus*using linear forwarders. ... We use linear forwarders to provide*a*distributed implementation*of*Milner's asynchronous*pi**calculus*. ... Acknowledgments We thank*the*anonymous referees for providing relevant comments on*the*submitted draft. In particular, one*of*them pointed out*a*significant flaw in*a*previous version*of*Lemma 32. ...##
###
Linear forwarders

2007
*
Information and Computation
*

We also design

doi:10.1016/j.ic.2007.01.006
fatcat:buczr2m6vbf37fwxwbkkjqtogi
*a*distributed machine, demonstrating*the*ease*with*which we can implement*the**pi**calculus*using linear forwarders. ... We use linear forwarders to provide*a*distributed implementation*of*Milner's asynchronous*pi**calculus*. ... Acknowledgments We thank*the*anonymous referees for providing relevant comments on*the*submitted draft. In particular, one*of*them pointed out*a*significant flaw in*a*previous version*of*Lemma 32. ...##
###
Functions as processes

1992
*
Mathematical Structures in Computer Science
*

For

doi:10.1017/s0960129500001407
fatcat:ppvj7yx5rrhypcfkvrlyqi6qlu
*the**encoding**of*lazy*A*-*calculus*, we compare Abramsky's precongruence over*A*-*terms*known as applicative simulation [1]*with*that which is induced by*the**encoding*; we also make*a*similar comparison for ... Another theme*of**the*present paper is*a*new way*of*formulating*the*r-*calculus*, or at least*the*fragment*of*r-*calculus*that we need for*encoding**A*-*calculus*, inspired by Berry's and Boudol's Chemical*Abstract*... For (2), one can adapt*a*counterexample*of*Ong [17] , which strengthens Abramsky's result that his canonical model*of**the*lazy*A*-*calculus*is not*fully**abstract*[1] . ...##
###
Secure implementations of typed channel abstractions

2007
*
SIGPLAN notices
*

Our implementation compiles high-level processes

doi:10.1145/1190215.1190253
fatcat:a6sx53gagzaorcghdr4vcpmyxa
*of**the**pi*-*calculus*into low-level principals*of**a*cryptographic process*calculus*based on*the*applied-*pi**calculus*[1] . ... We establish*the*adequacy and full*abstraction**of**the*implementation by contrasting*the*untyped equivalences*of**the*low-level cryptographic*calculus*,*with**the*typed equivalences*of**the*high-level source ... We would like to thank him for his insightful comments and constructive criticism on*a*previous draft*of**the*paper. ...##
###
Secure implementations of typed channel abstractions

2007
*
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '07
*

Our implementation compiles high-level processes

doi:10.1145/1190216.1190253
dblp:conf/popl/BugliesiG07
fatcat:vc7yqd66uze5rexdxfmsmjrl2q
*of**the**pi*-*calculus*into low-level principals*of**a*cryptographic process*calculus*based on*the*applied-*pi**calculus*[1] . ... We establish*the*adequacy and full*abstraction**of**the*implementation by contrasting*the*untyped equivalences*of**the*low-level cryptographic*calculus*,*with**the*typed equivalences*of**the*high-level source ... We would like to thank him for his insightful comments and constructive criticism on*a*previous draft*of**the*paper. ...##
###
From π-calculus to higher-order π-calculus — and back
[chapter]

1993
*
Lecture Notes in Computer Science
*

Nevertheless,

doi:10.1007/3-540-56610-4_62
fatcat:bt3wj3jvong4hjlx6gtm7scd3y
*the*study*of**the*),-*calculus**encodings*shows that*a*higher-order*calculus*can be very useful for reasoning at*a*more*abstract*level. higher-order paradigm mobility is achieved by allowing ... We give examples*of*its use, including*the**encoding**of*)~-*calculus*. ... This material was developed through*a*series*of*discussions*with*him. ...##
###
Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing

2018
*
Annual Conference for Computer Science Logic
*

enough to compile

doi:10.4230/lipics.csl.2018.21
dblp:conf/csl/DownenA18
fatcat:k2yzuzxlbnd7dk2c5aun662gb4
*a*Haskell-like functional language*with*user-defined types. ... We show how*the*notion*of*polarity can be extended beyond*the*value/name dichotomy to include call-by-need by only adding*a*mechanism for sharing and*the*extra polarity shifts to connect them, which is ... 2 Syntax*of**a*total, pure functional*calculus**with*(co-)*data*. ...
« Previous

*Showing results 1 — 15 out of 2,503 results*