October 31, 2009 in Personal,Research | Comments (0)
Tags: conference, family, holiday, Jasna, peeks, Pola
I’m currently hanging out at my gate in Pearson airport. In a couple hours I’ll be on my way to Paris and tomorrow morning I’ll catch my connecting flight to Amsterdam and then I take the train to Utrecht to see Jasna’s sister, Ana, and her husband, Andre.
Jasna and I aren’t very good with separation, though I think this time went better than most. It could be that it’s a shorter separation this time — five days, in contrast to Jasna’s recent two-month trip — or that we’re too tired from last night’s Hallowe’en party to get as worked up. Maybe we’re just getting better at it, though. It’s not like no tears were shed, but I think we did relatively well.
Unfortunately today my camera battery decided to crap out on me. The upside to this is Jasna lent me her (very awesome) DSLR camera for the trip. I’ll try to keep pictures of blondes down to a minimum. Mostly I’m excited to see Ana and Andre, but I think they’ll be busy most of the time, so I’ll probably venture into Amsterdam at least once to entertain myself. I brought the camera cable with me, so watch my photo gallery in the next day or two for pictures to start appearing.
The conference — and my presentation there — I haven’t thought a whole lot about yet. I’ll have to disappear to Eindhoven, which I think is only about half an hour from Utrecht — but then again maybe everything’s half an hour away from everything in the Netherlands, who knows — and see what’s going on there. I’m fairly excited to see what FOPARA ends up being like since this is the first year the workshop’s being done. I’m especially excited to see the Hume project people, like Kevin Hammond, since I’ve never met any.
I should say there’s still a lot of work that’s going on behind the scenes, work even on what I’m going to present to FOPARA. While I was in Calgary we decided to put in a new typing system based on bunched logics which deals elegantly with a lot of the problems with peeks that we’ve been sorting out in Pola, plus some new features.
October 26, 2009 in Personal | Comments (2)
Tags: writing
I finally got persuaded into doing a NaNoWriMo. For those who don’t speak Internet hipster, this is just a fancy way of saying I got persuaded into writing my own novel, specifically a 50000-word novel within the month of November.
It may seem like a silly idea considering I have a lot of work to do, not to mention a conference to go to at the end of this week. Doing 1667 words a day isn’t really that bad, though, considering writing comes pretty easily for me. I probably write more than that each day just in emails. Whether I can write anything good seems to be entirely beside the point: NaNoWriMo is about nothing if not quantity over quality.
Anyway I’m suddenly realizing how seriously people take this NaNoWriMo business. (more…)
October 7, 2009 in Research | Comments (0)
Tags: algebra, bounds, peeks, Pola
My visit this week to Calgary to work with Brian and Robin is coming to an end and has definitely paid off again. We have another day at least of work ahead of us, but probably not much more real work will get done by then since we still have the FOPARA paper to finish up and get camera ready. But, just in the past couple of days we’ve already made tremendous progress in improving and stabilizing the language. It won’t be too much longer before “core Pola” is finalized.
I should say there was one interesting result that Brian told me about. The peek construct is a unique construct to the language, which allows one to, under some restrictions, break affineness, i.e., allows one to reference a variable multiple times to give the programmer more expressiveness. It’s a delicate business since affineness is what keeps Pola programs polynomial-time, particularly in the context of recursion. As it turns out, if you remove the recursion-symbol restrictions on peeks — allowing recursion within the condition of a peek—but keep the other restrictions on peeks, you exactly capture PSPACE! We demonstrated this by changing just a couple lines of code, allowing recursion, and coding up QSAT to play with. (more…)