On the Interactive Power of Higher-order Processes Extended with Parameterization

[1]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[2]  Rob van Glabbeek.  A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract) , 2018, FoSSaCS.

[3]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and asynchronous $pi$-calculi , 2003, Mathematical Structures in Computer Science.

[4]  Hans Hüttel,et al.  Decidable Fragments of a Higher Order Calculus with Locations , 2009, EXPRESS.

[5]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1996, CONCUR.

[6]  Elena Zucca,et al.  Parametric Channels via Label Expressions in CCS , 1984, Theor. Comput. Sci..

[7]  Davide Sangiorgi,et al.  Separability, expressiveness, and decidability in the ambient logic , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[8]  N. Cutland.  Computability: An Introduction to Recursive Function Theory , 1980 .

[9]  Xian Xu.  Distinguishing and relating higher-order and first-order processes by expressiveness , 2012, Acta Informatica.

[10]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[11]  Frank D. Valencia,et al.  On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi , 2004, FoSSaCS.

[12]  Gianluigi Zavattaro,et al.  On the Expressiveness of Forwarding in Higher-Order Communication , 2009, ICTAC.

[13]  Björn Victor,et al.  On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[14]  Yuxi Fu,et al.  On the expressiveness of interaction , 2010, Theor. Comput. Sci..

[15]  Ivan Lanese,et al.  Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA , 2008, LICS.

[16]  Qiang Yin,et al.  On the Computation Power of Name Parameterization in Higher-order Processes , 2015, ICE.

[17]  Ivan Lanese,et al.  On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi , 2010, ICALP.

[18]  Bent Thomsen,et al.  Plain CHOCS A second generation calculus for higher order processes , 2005, Acta Informatica.

[19]  Qiang Yin,et al.  On the Expressiveness of Parameterization in Process-Passing , 2013, WS-FM.

[20]  Yuxi Fu,et al.  Theory of interaction , 2016, Theor. Comput. Sci..

[21]  Rob J. van Glabbeek,et al.  Analysing and Comparing Encodability Criteria , 2015, EXPRESS/SOS.

[22]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[23]  Davide Sangiorgi,et al.  On asynchrony in name-passing calculi , 1998, Mathematical Structures in Computer Science.

[24]  Rob J. van Glabbeek,et al.  Analysing and Comparing Encodability Criteria for Process Calculi , 2015, Arch. Formal Proofs.

[25]  Uwe Nestmann.  What is a "Good" Encoding of Guarded Choice? , 2000, Inf. Comput..

[26]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[27]  Daniele Gorla,et al.  Full abstraction for expressiveness: history, myths and facts † , 2014, Mathematical Structures in Computer Science.

[28]  Michele Boreale.  On the Expressiveness of Internal Mobility in Name-Passing Calculi , 1998, Theor. Comput. Sci..

[29]  Daniele Gorla,et al.  Towards a unified approach to encodability and separation results for process calculi , 2008, Inf. Comput..