<bibliography>
 <citation type="inproceedings" key="Cao06">
  <author>Z. <surname>Cao</surname></author>
  <year>2006</year>
  <title>More on Bisimulations for Higher Order &#960;-Calculus</title>
  <editor>L. <surname>Aceto</surname></editor>
  <editor>A. <surname>In\'golfsd&#243;ttir</surname></editor>
  <booktitle>Proceedings of FOSSACS2006</booktitle>
  <series>LNCS</series>
  <volume>3921</volume>
  <pages>63&#8211;78</pages>
  <doi>10.1007/11690634_5</doi>
  <note>Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006.</note>
 </citation>
 <citation type="article" key="JR05">
  <author>A. <surname>Jeffrey</surname></author>
  <author>J. <surname>Rathke</surname></author>
  <year>2005</year>
  <title>Contextual equivalence for higher-order pi-calculus revisited</title>
  <journal>Logical Methods in Computer Science</journal>
  <volume>1(1:4)</volume>
  <doi>10.2168/LMCS-1(1:4)2005</doi>
 </citation>
 <citation type="inproceedings" key="LPSS10">
  <author>I. <surname>Lanese</surname></author>
  <author>J. A. <surname>P&#233;rez</surname></author>
  <author>D. <surname>Sangiorgi</surname></author>
  <author>A. <surname>Schmitt</surname></author>
  <year>2010</year>
  <title>On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi</title>
  <booktitle>Proceedings of ICALP 2010</booktitle>
  <series>LNCS</series>
  <publisher>Springer Verlag</publisher>
  <pages>442&#8211;453</pages>
  <doi>10.1007/978-3-642-14162-1_37</doi>
 </citation>
 <citation type="article" key="LPSS10a">
  <author>I. <surname>Lanese</surname></author>
  <author>J. A. <surname>P&#233;rez</surname></author>
  <author>D. <surname>Sangiorgi</surname></author>
  <author>A. <surname>Schmitt</surname></author>
  <year>2011</year>
  <title>On the Expressiveness and Decidability of Higher-Order Process Calculi</title>
  <journal>Information and Computation</journal>
  <volume>209(2)</volume>
  <pages>198&#8211;226</pages>
  <doi>10.1016/j.ic.2010.10.001</doi>
 </citation>
 <citation type="inproceedings" key="LPSS08">
  <author>I. <surname>Lanese</surname></author>
  <author>J.A. <surname>Perez</surname></author>
  <author>D. <surname>Sangiorgi</surname></author>
  <author>A. <surname>Schmitt</surname></author>
  <year>2008</year>
  <title>On the Expressiveness and Decidability of Higher-Order Process Calculi</title>
  <booktitle>Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008)</booktitle>
  <publisher>IEEE Computer Society</publisher>
  <pages>145&#8211;155</pages>
  <doi>10.1109/LICS.2008.8</doi>
  <note>Journal version in LPSS10a</note>
 </citation>
 <citation type="article" key="Mil92">
  <author>R. <surname>Milner</surname></author>
  <year>1992</year>
  <title>Functions as Processes</title>
  <journal>Mathematical Structures in Computer Science</journal>
  <volume>2(2)</volume>
  <pages>119&#8211;141</pages>
  <doi>10.1017/S0960129500001407</doi>
  <note>Research Report 1154, INRIA, Sofia Antipolis, 1990</note>
 </citation>
 <citation type="phdthesis" key="San92">
  <author>D. <surname>Sangiorgi</surname></author>
  <year>1992</year>
  <title>Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms</title>
  <type>Phd thesis</type>
  <school>University of Edinburgh</school>
 </citation>
 <citation type="inproceedings" key="San92a">
  <author>D. <surname>Sangiorgi</surname></author>
  <year>1992</year>
  <title>From &#960;-Calculus to Higher-Order &#960;-Calculus&#8212;and Back</title>
  <booktitle>Proceedings of TAPSOFT '93</booktitle>
  <series>LNCS</series>
  <volume>668</volume>
  <publisher>Springer Verlag</publisher>
  <pages>151&#8211;166</pages>
  <doi>10.1007/3-540-56610-4_62</doi>
 </citation>
 <citation type="article" key="San94">
  <author>D. <surname>Sangiorgi</surname></author>
  <year>1996</year>
  <title>Bisimulation for Higher-order Process Calculi</title>
  <journal>Information and Computation</journal>
  <volume>131(2)</volume>
  <pages>141&#8211;178</pages>
  <doi>10.1006/inco.1996.0096</doi>
  <note>Preliminary version in proceedings of PROCOMET'94 (IFIP Working Conference on Programming Concepts, Methods and Calculi), pages 207-224, North Holland, 1994</note>
 </citation>
 <citation type="article" key="San96">
  <author>D. <surname>Sangiorgi</surname></author>
  <year>1996</year>
  <title>Pi-calculus, Internal Mobility and Agent-Passing Calculi</title>
  <journal>Theoretical Computer Science</journal>
  <volume>167(2)</volume>
  <doi>10.1016/0304-3975(96)00075-8</doi>
  <note>Extracts of parts of the material contained in this paper can be found in the Proceedings of TAPSOFT'95 and ICALP'95</note>
 </citation>
 <citation type="article" key="San98">
  <author>D. <surname>Sangiorgi</surname></author>
  <year>1998</year>
  <title>On the Bisimulation Proof Method</title>
  <journal>Mathematical Structures in Computer Science</journal>
  <volume>8(6)</volume>
  <pages>447&#8211;479</pages>
  <doi>10.1017/S0960129598002527</doi>
  <note>An extended abstract in Proceedings of MFCS'95, LNCS 969, pp. 479-488, Springer Verlag</note>
 </citation>
 <citation type="article" key="SKS11">
  <author>D. <surname>Sangiorgi</surname></author>
  <author>N. <surname>Kobayashi</surname></author>
  <author>E. <surname>Sumii</surname></author>
  <year>2011</year>
  <title>Environmental bisimulations for higher-order languages</title>
  <journal>ACM Transactions on Programming Languages and Systems</journal>
  <volume>33(1)</volume>
  <pages>5</pages>
  <doi>10.1145/1889997.1890002</doi>
 </citation>
 <citation type="book" key="SW01a">
  <author>D. <surname>Sangiorgi</surname></author>
  <author>D. <surname>Walker</surname></author>
  <year>2001</year>
  <title>The Pi-calculus: a Theory of Mobile Processes</title>
  <publisher>Cambridge Universtity Press</publisher>
 </citation>
 <citation type="phdthesis" key="Tho90">
  <author>B. <surname>Thomsen</surname></author>
  <year>1990</year>
  <title>Calculi for Higher Order Communicating Systems</title>
  <type>Phd thesis</type>
  <school>Department of Computing, Imperial College</school>
 </citation>
 <citation type="article" key="Tho93">
  <author>B. <surname>Thomsen</surname></author>
  <year>1993</year>
  <title>Plain CHOCS, a Second Generation Calculus for Higher-Order Processes</title>
  <journal>Acta Informatica</journal>
  <volume>30(1)</volume>
  <pages>1&#8211;59</pages>
  <doi>10.1007/BF01200262</doi>
 </citation>
 <citation type="inproceedings" key="VD98">
  <author>J.-L. <surname>Vivas</surname></author>
  <author>M. <surname>Dam</surname></author>
  <year>1998</year>
  <title>From Higher-Order Pi-Calculus to Pi-Calculus in the Presence of Static Operators</title>
  <booktitle>Proceedings of the 9th International Conference on Concurrency Theory</booktitle>
  <series>LNCS</series>
  <volume>1466</volume>
  <pages>115&#8211;130</pages>
  <doi>10.1007/BFb0055619</doi>
  <note>Nice, France, September 8-11, 1998</note>
 </citation>
 <citation type="article" key="Xu12">
  <author>Xian <surname>Xu</surname></author>
  <year>2012</year>
  <title>Distinguishing and Relating Higher-order and First-order Processes by Expressiveness</title>
  <journal>Acta Informatica</journal>
  <volume>49(7-8)</volume>
  <pages>445&#8211;484</pages>
  <doi>10.1007/s00236-012-0168-9</doi>
 </citation>
</bibliography>
