Specialization of CML message-passing primitives
暂无分享,去创建一个
[1] Flemming Nielson,et al. Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.
[2] Manuel Serrano. Control flow analysis: a functional languages compilation paradigm , 1995, SAC '95.
[3] Suresh Jagannathan,et al. Analyzing stores and references in a parallel symbolic language , 1994, LFP '94.
[4] Robert Bruce Findler,et al. Kill-safe synchronization abstractions , 2004, PLDI '04.
[5] Keshav Pingali,et al. I-structures: data structures for parallel computing , 1986, Graph Reduction.
[6] John H. Reppy,et al. The design of a class mechanism for Moby , 1999, PLDI '99.
[7] Nicolas Mercouroff,et al. An Algorithm for Analyzing Communicating Processes , 1991, MFPS.
[8] John H. Reppy,et al. CML: A higher concurrent language , 1991, PLDI '91.
[9] John H. Reif,et al. Data flow analysis of communicating processes , 1979, POPL.
[10] John H. Reppy. Type-sensitive control-flow analysis , 2006, ML '06.
[11] Christopher Colby. Analyzing the communication topology of concurrent programs , 1995, PEPM '95.
[12] George Russell,et al. Events in Haskell, and how to implement them , 2001, ICFP '01.