
projects.wizardlike.ca — this paper describes the type system of a functional style programming language called Pola which is complete with respect to polynomial time programming. This means, both that every welltyped Pola program is guaranteed to halt in time polynomial with respect to the size of its input, and that all such polynomial time functions can be written in Pola via nponeccop.livejournal.com