1. Baillot, P., Terui, K.: Light types for polynomial time computation in lambda-calculus. In: Proceedings of LICS’04, pp. 266–275. IEEE Computer Society Press, Los Alamitos (2004)
2. Lecture Notes in Computer Science;V. Atassi,2006
3. Baillot, P., Coppola, P., Dal Lago, U.: Light logics and optimal reduction: Completeness and complexity. In: Proceedings of LICS’07, IEEE Computer Society Press, Los Alamitos (to appear, 2007)
4. Leivant, D.: Predicative recurrence and computational complexity I: word recurrence and poly-time. In: Feasible Mathematics II, Birkhauser, pp. 320–343 (1994)
5. Bellantoni, S., Cook, S.: New recursion-theoretic characterization of the polytime functions. Computational Complexity 2, 97–110 (1992)