1. Asperti, A. (1998). Light affine logic. In Proceedings LICS’98. IEEE Computer Society Press.
2. Baillot, P. (2000). Stratified coherent spaces: a denotational semantics for light linear logic. LFCS Tech. report 0025, Univ. of Edinburgh. presented at ICC’00.
3. Baillot, P. (2001). Checking polynomial time complexity with types (extended version). Tech. report 2001–09, Laboratoire d’Informatique de Paris-Nord.
4. Bellantoni, S., Niggl, K.-H., and Schwichtenberg, H. (2000). Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic, 104 (1–3).
5. Coppola, P. and Martini, S. (2001). Typing lambda-terms in elementary logic with linear constraints. In Proceedings TLCA’01,volume 2044 of LNCS. Springer-Verlag.