1. Computability and Complexity – from a Programming Perspective;Jones,1997
2. The expressive power of higher-order types or, life without CONS;Jones;J. Funct. Program.,2001
3. A new recursion-theoretic characterization of the polytime functions (extended abstract);Bellantoni,1992
4. Predicative recurrence and computational complexity I: word recurrence and poly-time;Leivant,1994
5. Lambda calculus characterizations of poly-time;Leivant;Fundam. Inform.,1993