Type-safe higher-order channels with channel locality1

作者: SUNGWOO PARK , HYEONSEUNG IM

DOI: 10.1017/S0956796808006989

关键词:

摘要: As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form task parallelism in parallel computations. In the presence mutable references, however, they pose safety problem because references may be transmitted to remote threads where are no longer valid. This paper presents ML-like language with type-safe channels. By type safety, we mean that value written channel contains or equivalently, reference escapes via from thread it is created. The system uses typing judgment capable deciding whether which term evaluates not. use such makes easy achieve another desirable feature channels, locality, associates every unique for serving all values addressed it. Our permits sequential computations and ensures never interfere Thus, provides both flexibility programming ease implementing

参考文章(37)
Frederick Colville Knabe, Karen Thorson, Brett Bates, Kevin Garvey, Language Support for Mobile Agents ,(2007)
B. Pierce, D. Sangiorgi, Typing and subtyping for mobile processes logic in computer science. pp. 376- 385 ,(1993) , 10.1109/LICS.1993.287570
Nobuko Yoshida, Matthew Hennessy, Suptyping and Locality in Distributed Higher Order Processes (extended abstract) international conference on concurrency theory. pp. 557- 572 ,(1999)
Tom Murphy VII, Karl Crary, Robert Harper, Type-Safe Distributed Programming with ML5 Trustworthy Global Computing. pp. 108- 123 ,(2007) , 10.1007/978-3-540-78663-4_9
Martin Odersky, Polarized Name Passing foundations of software technology and theoretical computer science. pp. 324- 337 ,(1995) , 10.1007/3-540-60692-0_58
Arvind, Rishiyur Nikhil, Implicit Parallel Programming in pH ,(2001)
Cédric Fournet, Georges Gonthier, Jean-Jacques Levy, Luc Maranget, Didier Rémy, A Calculus of Mobile Agents international conference on concurrency theory. pp. 406- 421 ,(1996) , 10.1007/3-540-61604-7_67
David Walker, Limin Jia, Modal Proofs as Distributed Programs (Extended Abstract). european symposium on programming. pp. 219- 233 ,(2004)
Alan Schmitt, Safe Dynamic Binding in the Join Calculus ifip international conference on theoretical computer science. pp. 563- 575 ,(2002) , 10.1007/978-0-387-35608-2_46
Henry C. Baker, Carl Hewitt, The incremental garbage collection of processes Intelligence\/sigart Bulletin. ,vol. 12, pp. 55- 59 ,(1977) , 10.1145/800228.806932