Automatic Parallelization of Side-Effecting Higher-Order Scheme Programs
暂无分享,去创建一个
[1] FlanaganCormac,et al. The essence of compiling with continuations , 1993 .
[2] Amr Sabry,et al. The essence of compiling with continuations , 1993, PLDI '93.
[3] György E. Révész. Lambda-calculus, combinators, and functional programming , 1988, Cambridge tracts in theoretical computer science.
[4] Robert H. Halstead,et al. MULTILISP: a language for concurrent symbolic computation , 1985, TOPL.
[5] Olin Shivers,et al. Control flow analysis in scheme , 1988, PLDI '88.
[6] Doug Lea,et al. A Java fork/join framework , 2000, JAVA '00.
[7] Matthias Felleisen,et al. The semantics of future and its use in program optimization , 1995, POPL '95.
[8] David A. Padua,et al. Parcel: project for the automatic restructuring and concurrent evaluation of LISP , 1988, ICS '88.
[9] M. Might,et al. Interprocedural Dependence Analysis of Higher-Order Programs via Stack Reachability , 2009 .
[10] Edward A. Lee. The problem with threads , 2006, Computer.
[11] Zahira Ammarguellat,et al. Parcel and Miprac: Parallelizers for Symbolic and Numeric Programs , .
[12] P. Wegner. Lambda calculus , 2003 .
[13] Pascal Costanza,et al. Dynamic parallelization of recursive code: part 1: managing control flow interactions with the continuator , 2010, OOPSLA.
[14] Yannis Smaragdakis,et al. Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis , 2010, PLDI '10.