Documents
Theory details
Pola: a language for PTIME programming
A paper by Robin, Brian and I had accepted to "LCC":http://www.cs.indiana.edu/lcc/ (note: LCC has no published proceedings). It covers the logic of safety, going through each of the language constructs, and also provides a sketch of a proof for po...
06/24/2009 10:57 am
Peripatetic seminar talk on QSAT
Notes from a seminar talk given on October 7, 2009. We discuss how removing restriction on peeks (allowing recursive function symbols in the subject of a peek) allows PSPACE. We show how to write QSAT, which is PSPACE-complete, in a modified versi...
10/15/2009 10:54 am
Safe Recursion Revisited.
In this technical report we collect together some of the theoretical facts about the programming language Pola.
01/25/2010 05:04 pm
A categorical setting for lower complexity
Presented at MFPS 2010.
04/05/2010 12:45 pm
Implementation details
Literate source code
Documentation is automatically generated from the Pola source code, since the source code is "literate":http://en.wikipedia.org/wiki/Literate_programming. This document will be of use to few people since it is, in essence, the source code, but som...
06/18/2009 06:27 am
Implementing a practical polynomial programming language
A paper which has been presented at FOPARA in 2009, but ultimately rejected for publication. It covers the syntax of Pola, the type inference (with bunched player contexts), the operational semantics and touches on inferring bounds.
10/15/2009 11:10 am