Readings from 2011:
- Dec 20 - What can the {GC} compute efficiently?: a language for heap assertions at {GC} time. Reichenbach, Immerman, Smaragdakis, et al. 2010.
- Dec 13 - A monad for deterministic parallelism. Marlow, Newton, and Jones. 2011.
- Dec 6 - Programming parallel algorithms. Guy E. Blelloch. 1996.
- Nov 29 - {LTL} types {FRP}: linear-time temporal logic propositions as types, proofs as functional reactive programs. Alan Jeffrey. 2012.
- Nov 15 - {Well-Typed} Programs Can't Be Blamed. Philip Wadler and Robert B. Findler. 2009.
- Nov 8 - Modal types as staging specifications for run-time code generation. Wickline, Lee, Pfenning, and Davies. 1998.
- Nov 1 - Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I. John McCarthy. 1960.
- Oct 25 - A temporal-logic approach to binding-time analysis. Rowan Davies. 1996.
- Oct 19 - A semantic model for graphical user interfaces. Neelakantan R. Krishnaswami and Nick Benton. 2011.
- Oct 11 - On the Meanings of the Logical Constants and the Justifications of the Logical Laws. Per Martin-Löf. 1996.
- Sep 27 - F-ing modules. Rossberg, Russo, and Dreyer. 2010.
- Sep 20 - Modular type classes. Dreyer, Harper, Chakravarty, and Keller. 2007.
- Sep 13 - A separate compilation extension to standard {ML}. Swasey, Tom Murphy, Crary, and Harper. 2006.
- Sep 6 - Church and Curry: Combining Intrinsic and Extrinsic Typing. Frank Pfenning. 2008.