The Internet Archive has a preservation copy of this work in our general collections.
The file type is
The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable (ATR types are confined to levels 0, 1, and 2). A limitation of the original version of ATR is that the only directly expressible recursions are tail-recursions. Here we extend ATR so that a broad range of affine recursions are directly expressible. InarXiv:cs/0701076v2 fatcat:zvc3qmbf2zeo3floespuh2feuq