A brief interview in a fledgling webzine.
They love me not
My GPCE paper was rejected, and rather harshly. You can read the reviews below. My analysis is that I was rejected for not being incremental to prior work in the field. Continue reading “They love me not”
Modular Generation and Customization
The adventure in blogademics continues: I have posted a draft of my next paper. Comments are welcome – the deadline is 5/19. Thanks to everyone who supplied references in response to my last post – you are in the acknowledgments.
Update – the link above is to the final version, pusblished as a tech report. I should add for those familiar with my UI work that there is almost no UI in this paper. I am trying to motivate and explain the model underlying my last two papers. It’s not just about ease of use – it is also about expressive power.
Collections with stable iterators
Oh oracle of the interwebs –
I am writing a GPCE paper, and one of the contributions is a model of sequences (AKA collections) that has stable unshifting positions. Standard collections use an array abstraction where access is by integer ordinal position, which shifts under insertion and deletion. This manifests as the fact that iterators are broken by insertion and deletion operations. Linked list iterators also break under deletion.
Does anyone know of alternative proposals with stable positions/iterators? I don’t know of any, but I can’t be the first person to do this. Continue reading “Collections with stable iterators”
Sinners in the Hands of an Angry Programming Language
And now for something completely different. This post at the Jonathan Edwards Center at Yale compares my position on Beautiful Code with the theology of that other Jonathan Edwards. We are not related, as far as I know, but in a spooky coincidence we both went to college at the age of 13.