1. Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97–110, 1992.
2. Stephen Bellantoni and Martin Hofmann. A New “Feasible” Arithmetic Journal of Symbolic Logic, to appear.
3. Stephen Bellantoni, Karl-Heinz Niggl, and Helmut Schwichtenberg. Higher type recursion,ramification and polynomial time. Annals of Pure and Applied Logic, 104:17–30, 2000.
4. Stephen A. Cook. Computability and complexity of higher type functions. In Y.N. Moschovakis, editor, Logic from Computer Science, Proceedings of a Workshop held November 13-17, 1989, number 21 in MSRI Publications, pages 51–72. Springer Verlag, Berlin, Heidelberg, New York, 1992.
5. Stephen A. Cook and Bruce M. Kapron. Characterizations of the basic feasible functionals of finite type. In S. Buss and P. Scott, editors, Feasible Mathematics, pages 71–96. Birkhäuser, 1990.