This is a (not limiting) list of future papers I’d like to read:

Synthesis: An Efficient Implementation of Fundamental Operating System Services (1992) (I already read this, but want to reread it. Maybe on a weekend if I’m feeling ambitious. Or a couple posts summarizing different parts)
 Fully Homomorphic Encryption over the Integers (I’ve tried this one a couple times, but never made it through.)
 The Homotopy Type Theory book (Thanks, mkaemmerer!)
 The GirardReynolds Isomorphism
 Cryptographic Obfuscation (blog post with good summary)

On the (Im)possibility of Obfuscating Programs (and shorter version?) Definitions and impossibility result from a while back.

Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits – One of two recent articles exploiting a loophole in the previous impossibility proof, written up rather sensationally by Wired.

How to Use Indistinguishability Obfuscation: Deniable Encryption, and More – Looks like a followup to the above.

 The Road to Parallelism Leads Through Sequential Programming
 Most of the rest of PLDI 2014
 PowerGraph: Distributed GraphParallel Computation on Natural Graphs
 GraphChi: LargeScale Graph Computation on Just a PC
 KLEE: Unassisted and Automatic Generation of HighCoverage Tests for Complex Systems Programs
 Approximating kMedian via PseudoApproximation
 Exposing Photo Manipulation with Inconsistent Shadows
Most of these are from trolling various recent conferences; in the process, I discovered Microsoft’s Academic Search, which among other things gives major journals and conferences by field. I’m not sure how I feel about the search itself, but it’s a great way to find the conferences I’d forgotten about and then troll their recent years for good papers.
I’ve been struggling to get through the HoTT book (http://homotopytypetheory.org/book/), and would love a more approachable explanation.
The premise of the book seems very interesting. If I understand correctly, the idea is that homotopy theory (whatever that is… I haven’t grokked it yet) could form a more general axiomatization of mathematics, and also describe better type systems that could be used by new programming languages.
I was thinking of focusing more shortform papers that could be read in an afternoon, but that does look intriguing.