My co-authors Aaron Turon, Neel Krishnaswami, Ryan Newton, and I are very happy to announce that our paper “Freeze After Writing: Quasi-Deterministic Parallel Programming with LVars” has been accepted for publication at POPL 2014!
In the writing and speaking I’ve done about LVars, I’ve done my best to show a lot of example code. For the most part, though, the examples have been written in a toy language created specifically for the purpose of discussing the LVars work.
For some people, this approach is fine. Others, however, find it less than satisfying. So, let’s see what it’s like to use LVars in a real language! If you’d like to run the examples yourself, all of the code from this post, plus some scaffolding for running it, is available on GitHub.
Also, an announcement: I’m going to be giving a talk about my work on LVars tomorrow, September 23, at FHPC. If you’re interested in this stuff and you’re here in Boston for ICFP and affiliated events, please come to my talk!
Lately I’ve been thinking about an analogy between properties that are and aren’t true of LVar operations, and presence or lack of structural rules in a logic.
This summer I’m part of the residency program at Hacker School, a three-month-long, self-directed, full-time school in New York for becoming a better programmer. This summer’s Hacker School batch will be wrapping up soon, and the application deadlines for the fall batch are already upon us. I’ve been talking with lots of programmers I know and encouraging them to apply.
During these conversations, I’ve encountered a few misconceptions about what Hacker School is and who it’s for. I’m not an official source of information; for that, I recommend the User’s Manual and this blog post. Having said that, here are a few things I’ve heard people say that attest to misconceptions about Hacker School, and my responses to them.