- I finished Mass Effect last night. I definitely need to play thru that one again, though I’ll probably wait until the new Bring Down the Sky DLC ships next month.
- Caps won again last night, improving to 20-10-4 since changing coaches at Thanksgiving. They’re now at 57 points, taking the lead in the SE division with a full game on Carolina, Atlanta and Florida. Still a ways to go – 27 games left in the regular season – and things are far from “sewn up” but we’re a damn sight better off than we were in November.
- Speaking of a horserace, looks like Clinton and Obama are in one after Super Tuesday. Their estimated delegate counts are basically tied. On the other side of the aisle, McCain opened up what is probably insurmountable lead – even though he has the right-wing media stars and Christian leaders against him. Money quote of the day:
“The real story of the night, when you look at their rallies and their turn-out numbers, is that the Dems have two strong candidates either of whom could lead a united party to victory. Forget the gaseous platitudes: in Dem terms, their choice on Super Duper Tuesday was deciding which candidate was Super Duper and which was merely Super. Over on the GOP side, it was a choice between Weak & Divisive or Weaker & Unacceptable. Doesn’t bode well for November.”\
- Charlie Calvert is starting a new series on the future of C#. First up: Dynamic Lookup. Probably most interesting is the news that the DLR “will be the infrastructure on which the C# team implements dynamic lookup”. Does this mean C# will target the DLR? Sure sounds like it. I think it’s a good addition, but I’m not a fan of the proposed syntax. (via Bitter Coder)
- Brian McNamara saw me present @ LangNET and sent me a link to his blog. He’s building up a monadic parser combinator library in C# 3.0. This is basically the same concept that FParsec implements, though C#’s syntax is much less attractive than F#’s for this kind of code. However, Brian does a very good job explaining why monadic parser combinators are useful and making the idea accessible to the C# programmer (i.e. you don’t have to learn F# or Haskell to understand what he’s talking about). He also points to Luke Hoban’s C# 3.0 monadic parser implementation.