[1] Ugo Dal Lago and Simone Martini. Phase semantics and decidability of elementary affine logic. Theoretical Computer Science, 318(3):409-433, 2004. [ bib ]
[2] Ugo Dal Lago and Patrick Baillot. Light affine logic, uniform encodings and polynomial time. Mathematical Structures in Computer Science, 16(4):713-733, 2006. [ bib ]
[3] Ugo Dal Lago, Angelo Montanari, and Gabriele Puppis. Compact and tractable automaton-based representations of time granularities. Theoretical Computer Science, 373(1-2):115-141, 2007. [ bib ]
[4] Ugo Dal Lago. The geometry of linear higher-order recursion. ACM Transactions on Computational Logic, 10(2), 2009. [ bib ]
[5] Ugo Dal Lago and Simone Martini. The weak lambda-calculus as a reasonable machine. Theoretical Computer Science, 398(1-3):32-50, 2008. [ bib ]
[6] Ugo Dal Lago. Context semantics, linear logic and computational complexity. ACM Transactions on Computational Logic, 10(4), 2009. [ bib ]
[7] Ugo Dal Lago, Andrea Masini, and Margherita Zorzi. On a measurement-free quantum lambda calculus with classical control. Mathematical Structures in Computer Science, 19(2):297-335, 2009. [ bib ]
[8] Paolo Coppola, Ugo Dal Lago, and Simonetta Ronchi Della Rocca. Light logics and the call-by-value lambda calculus. Logical Methods in Computer Science, 4(4), 2008. [ bib ]
[9] Ugo Dal Lago and Martin Hofmann. A semantic proof of polytime soundness for light affine logic. Theory of Computing Systems, 2009. to appear. [ bib ]
[10] Ugo Dal Lago, Andrea Masini, and Margherita Zorzi. Quantum implicit computational complexity. Theoretical Computer Science, 2009. to appear. [ bib ]

This file was generated by bibtex2html 1.94.