期刊文献+

Combinator演算族的π演算语义

π-Calculus Semantics for Combinator Calculi
下载PDF
导出
摘要 以SKI演算作为Combinator演算族的代表,通过形式化的手段给出了SKI演算的π演算语义;通过一个实例验证了所论方法的正确性.所给出的转换方法证明了π演算的表达能力:π演算为图灵完备的.由于高阶函数式语言与Combinator演算族之间存在着自然的转换,所给的转换思想不仅为在π演算的理论框架下研究Combinator演算族提供了基础,也为探讨高阶函数式语言的表示和实现问题提供了新途径. π-Calculus is used to encode the semantics for the SKI-calculus which is a representative of combinator calculi. SKI-calculus is Turing complete, and this work shows the expressiveness of ,π-calculus. Furthermore, this work provides a pre-condition for uniting and comparing combinator calculi, lambda- calculus as well as higher-order functions with other concurrent models under the theory of π-calculus.
作者 张红 刘磊
出处 《吉林大学学报(理学版)》 CAS CSCD 北大核心 2006年第3期391-396,共6页 Journal of Jilin University:Science Edition
基金 吉林省科技发展计划项目基金(批准号:20050527).
关键词 Π演算 Combinator演算族 SKI演算 语义 π-calculus Combinator calculi SKI-calculus semantics
  • 相关文献

参考文献11

  • 1Curry H B, Hindley J R, Seldin J P. Combinatory Logic [M]. Volume Ⅱ. Amsterdam: North Holland Publishing Company, 1989.
  • 2Phlip J, Koopman Jr. An Architecture for Combinator Graph Reduction [M]. Carolina: Academic Press, 1990.
  • 3Milner R. Communication and Concurrency [M]. UK: Prentice Hall, 1989.
  • 4Milner R, Parrow J, Walkwer D. A Calculus of Mobile Processes (Part Ⅰ and PartⅡ) [J]. Information and Computation, 1992, 100: 1-77.
  • 5Parrow J. Handbook of Process Algebra [M]. North-Holland: Elsevier, 2001.
  • 6Gabbay M J. The π-Calculus in FM [J]. Thirty-five Years of Automathe, 2003, IV: 80-149.
  • 7Frank Pfenninf. Lecture Notes on the π-Calculus and Concurrent ML [J]. Foundations of Programming Languages, 2004, 7: 14-312.
  • 8Honsell F, Miculan M, Scagretto I. π-Calculus in (Co)Inductive Type Theory [J]. Theoretical Computer Science, 2001, 253(2): 239-285.
  • 9Milner R. Communicating and Mobile Systems: the π-Calculus [M]. UK: Cambridge University Press, 1999.
  • 10Palamidessi C. Comparing the Expressive Power of the Synchronous and the Asynchronous π-Calculus [C]// Proceedings of POPL'97 (24th ACM Symposium on Principles of Programming Languages). Paris: ACM, 1997: 256-265.

二级参考文献8

  • 1[1]Milner R. Action Calculi, or Concrete Action Structures [C]. In: Borzyszkowski A M, Sokolowski S. eds. Proc MFCS Conference, Gdansk, Poland, LNCS, Vol 711. Berlin/New York: Springer-Verlag, 1993. 105~121.
  • 2[2]Milner R. Calculi for Interaction [J]. Acta Inform, 1996, 33(8): 707~737.
  • 3[3]Milner R. High-order Action Calculi [C]. CSL'93, LNCS, Vol. 832. Berlin/New York: Springer-Verlag, 1994.238~260.
  • 4[4]Gardner P, Hasegawa M. Higher-order and Reflexive Action Calculi: Their Type Theory and Models [C]. Japan:Theoretical Aspects of Computer Software, 1997.
  • 5[5]Barber A, Gardner P, Hasegawa M, et al. From Action Calculi to Linear Logic [C]. Proceedings Computer Science Logic (LICS'97), Lecture Notes in Computer Science. Berlin/New York: Springer-Verlag, 1998. 78~ 97.
  • 6[6]America P, Rutten J. A Layered Semantics for a Parallel Object-oriented Language [C]. Foundations of ObjectOriented Languages, LNCS, Vol. 489. Berlin/New York: Springer-Verlag, 1991. 91~123.
  • 7[7]Milner R. Action Structures [R]. Research Report LFCS-92-249, Laboratory for Foundations of Computer Science. Edinburgh: Department of Computer Science, Edinburgh University, 1992.
  • 8[8]David Walker. Objects in the π-Calculus [J]. Information and Computation, 1995, 116: 253~271.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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