期刊文献+

A functional presentation of Pi calculus

原文传递
导出
摘要 From the very beginning process algebra introduced the dichotomy between channels and processes. This dichotomy prevails in all present process calculi. The situation is in contrast to that withlambda calculus which has only one class of entities-the lambda terms. We introduce in this papera process calculus called Lamp in which channels are process names. The language is more uniform than existing process calculi in two aspects: First it has a unified treatment of channels and processes.There is only one class of syntactical entities-processes. Second it has a unified presentation ofboth first order and higher order process calculi. The language is functional in the sense that lambda calculus is functional. Two bisimulation equivalences, barbed and closed bisimilarities, are proved to coincide.A natural translation from Pi calculus to Lamp is shown to preserve both operational and algebraic semantics. The relationship between lazy lambda calculus and Lamp is discussed. From the very beginning process algebra introduced the dichotomy between channels and processes. This dichotomy prevails in all present process calculi. The situation is in contrast to that withlambda calculus which has only one class of entities-the lambda terms. We introduce in this papera process calculus called Lamp in which channels are process names. The language is more uniform than existing process calculi in two aspects: First it has a unified treatment of channels and processes.There is only one class of syntactical entities-processes. Second it has a unified presentation ofboth first order and higher order process calculi. The language is functional in the sense that lambda calculus is functional. Two bisimulation equivalences, barbed and closed bisimilarities, are proved to coincide.A natural translation from Pi calculus to Lamp is shown to preserve both operational and algebraic semantics. The relationship between lazy lambda calculus and Lamp is discussed.
作者 傅育熙
出处 《Science in China(Series F)》 2001年第1期20-32,共13页 中国科学(F辑英文版)
基金 the National Natural Science Foundation of China ( Grant No. 69873032) ,863 Hi-Tech Project (863-306-ZT06-02-2) Excellent Young Scholar Fund, and was also supported by BASICS, Center of Basic Studies in Computing Science, sponsored by Shanghai Educa
关键词 functional p resentation π calculus CCS process algebra. functional p resentation, π calculus, CCS, process algebra.
  • 相关文献

参考文献15

  • 1[1]Milner, R., Communication and Concurrency, New York: Prentice Hall, 1989.
  • 2[2]Milner, R., Parrow, J., Walker, D., A calculus of mobile processes, Information and Computation, 1992, 100(Part 1: 1—40, (Part Ⅱ): 44.
  • 3[3]Sangiorgi, D., Expressing mobility in process algebras: first-order and higher-order paradigms, PhD Thesis, Department of Computer Science, University of Edinburgh, 1993.
  • 4[4]Thomsen, B., A theory of higher order communicating systems, Information and Computation, 1995, 38.
  • 5[5]Sangiorgi, D., π-Calculus, internal mobility and agent-passing calculi, Theoretical Computer Science, 1996, 235—274.
  • 6[6]Boudol, G., Asynchrony and the π-calculus, Technical Report RR-1702, INRIA Sophia Antipolis, 1992.
  • 7[7]Merro, M., Sangiorgi, D., On asynchrony in name-passing calculi, ICALP'98, Lecture Notes in Computer Science, Berlin: Springer-Verlag, 1998, 1443.
  • 8[8]Milner, R., Sangiorgi, D. Barbed Bisimulation, ICALP'92, Lecture Notes in Computer Science, 1992, 623: 685.
  • 9[9]Fu, Y., A proof theoretical approach to communications, ICALP'97, July 7—11, Bologna, Italy, Lecture Notes in Computer Science, 1997, 1256: 325.
  • 10[10] Milner R., Functions as processes, Mathematical Structures in Computer Science, 1992, 2: 119.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部