[ Home | Research | Teaching ]
I shall be sorry if computer science ever
flies apart into two disciplines, one logical
and one technological. -- Robin Milner.
Currently, my research interests are the following: In the past, I also worked on: Papers and Publications

Journals
[TOCS2009] Ugo Dal Lago and Martin Hofmann. A semantic proof of polytime soundness for light affine logic. Theory of Computing Systems, 2009. to appear. [ doi ] [ bib ]
[TCS2009] Ugo Dal Lago, Andrea Masini, and Margherita Zorzi. Quantum implicit computational complexity. Theoretical Computer Science, 2009. to appear. [ doi ] [ bib ]
[TOCL2009a] Ugo Dal Lago. The geometry of linear higher-order recursion. ACM Transactions on Computational Logic, 10(2), 2009. [ doi ] [ arxiv ] [ bib ]
[TOCL2009b] Ugo Dal Lago. Context semantics, linear logic and computational complexity. ACM Transactions on Computational Logic, 10(4), 2009. [ doi ] [ arxiv ] [ bib ]
[MSCS2009] 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. [ doi ] [ arxiv ] [ bib ]
[LMCS2008] 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. [ doi ] [ arxiv ] [ bib ]
[TCS2008] Ugo Dal Lago and Simone Martini. The weak lambda-calculus as a reasonable machine. Theoretical Computer Science, 398(1-3):32-50, 2008. [ doi ] [ bib ]
[TCS2007] 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. [ doi ] [ bib ]
[MSCS2006] Ugo Dal Lago and Patrick Baillot. On light logics, uniform encodings and polynomial time. Mathematical Structures in Computer Science, 16(4):713-733, 2006.
[ doi ] [ bib ]
[TCS2004] Ugo Dal Lago and Simone Martini. Phase semantics and decidability of elementary affine logic. Theoretical Computer Science, 318(3):409-433, 2004.
[ doi ] [ bib ]
Conferences
[ICALP2009] Ugo Dal Lago and Simone Martini. On constructor rewrite systems and the lambda-calculus. In International Conference on Automata, Languages and Programming, Proceedings, volume 5556 of Lecture Notes in Computer Science, pages 163-174. Springer, 2009. [ doi ] [ arxiv ] [ bib ]
[TLCA2009] Ugo Dal Lago and Martin Hofmann. Bounded linear logic, revisited. In Typed Lambda Calculi and Applications, 9th International Conference, Proceedings, volume 5608 of Lecture Notes in Computer Science, pages 80-94. Springer, 2009. [ doi ] [ arxiv ] [ bib ]
[LFCS2009] Ugo Dal Lago, Luca Roversi, and Luca Vercelli. Taming modal impredicativity: Superlazy reduction. In Logical Foundations of Computer Science, International Symposium, Proceedings, volume 5407 of Lecture Notes in Computer Science, pages 137-151. Springer, 2009. [ doi ] [ arxiv ] [ bib ]
[CSL2008] Ugo Dal Lago and Olivier Laurent. Quantitative game semantics for linear logic. In Computer Science Logic, 22nd International Workshop, Proceedings, volume 5213 of Lecture Notes in Computer Science, pages 230-245. Springer, 2008. [ doi ] [ hal ] [ bib ]
[CSR2008] Ugo Dal Lago and Martin Hofmann. A semantic proof of polytime soundness of light affine logic. In Third International Computer Science Symposium in Russia, Proceedings, volume 5010 of Lecture Notes in Computer Science, pages 134-145. Springer, 2008. [ doi ] [ bib ]
[LICS2007] Patrick Baillot, Paolo Coppola, and Ugo Dal Lago. Light logics and optimal reduction: Completeness and complexity. In Logic in Computer Science, 22nd International Symposium, Proceedings, pages 421-430. IEEE Computer Society, 2007. [ doi ] [ arxiv ] [ bib ]
[TIME2007] Ugo Dal Lago, Angelo Montanari, and Gabriele Puppis. On the equivalence of automaton-based representations of time granularities. In 14th International Symposium on Temporal Representation and Reasoning, Proceedings, pages 82-93. IEEE Computer Society, 2007. [ doi ] [ bib ]
[LICS2006] Ugo Dal Lago. Context semantics, linear logic and computational complexity. In Logic in Computer Science, 20th International Symposium, Proceedings, pages 169-178. IEEE Computer Society, 2006.
[ doi ] [ arxiv ] [ bib ]
[CIE2006] Ugo Dal Lago and Simone Martini. An invariant cost model for the lambda calculus. In Arnold Beckmann, Ulrich Berger, Benedikt Löwe, and John V. Tucker, editors, Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Proceedings, volume 3988 of Lecture Notes in Computer Science, pages 105-114. Springer, 2006.
[ doi ] [ arxiv ] [ bib ]
[FSTTCS2005] Ugo Dal Lago and Martin Hofmann. Quantitative models and implicit complexity. In R. Ramanujam and Sandeep Sen, editors, Foundations of Software Technology and Theoretical Computer Science, Proceedings, volume 3821 of Lecture Notes in Computer Science, pages 189-200. Springer, 2005.
[ doi ] [ arxiv ] [ bib ]
[LICS2005] Ugo Dal Lago. The geometry of linear higher-order recursion. In Logic in Computer Science, 20th International Symposium, Proceedings, pages 366-375. IEEE Computer Society, 2005.
[ doi ] [ arxiv ] [ bib ]
[TLCA2005] Paolo Coppola, Ugo Dal Lago, and Simona Ronchi Della Rocca. Elementary affine logic and the call-by-value lambda calculus. In Pawel Urzyczyn, editor, Typed Lambda Calculi and Applications, 7th International Conference, Proceedings, volume 3461 of Lecture Notes in Computer Science, pages 131-145. Springer, 2005. [ doi ] [ bib ]
[TYPES2003] Ugo Dal Lago, Simone Martini, and Luca Roversi. Higher order linear ramified recurrence. In Types for Proofs and Programs, Post-Workshop Proceedings, volume 3085 of Lecture Notes in Computer Science, pages 178-193. Springer, 2003.
[ doi ] [ bib ]
[ICTCS2003a] Ugo Dal Lago. On the expressive power of light affine logic. In Carlo Blundo and Cosimo Laneve, editors, Eight Italian Conference on Theoretical Computer Science, Proceedings, volume 2841 of Lecture Notes in Computer Science, pages 216-227. Springer, 2003.
[ doi ] [ bib ]
[ICTCS2003b] Ugo Dal Lago, Angelo Montanari, and Gabriele Puppis. Towards a compact and tractable automaton-based representations of time granularities. In Carlo Blundo and Cosimo Laneve, editors, Eight Italian Conference on Theoretical Computer Science, Proceedings, volume 2841 of Lecture Notes in Computer Science, pages 72-85. Springer, 2003. [ doi ] [ bib ]
[AAAI2002] Ugo Dal Lago, Marco Pistore, and Paolo Traverso. Planning with a language for extended goals. In Eighteenth National Conference of Artificial Intelligence, Proceedings, pages 447-454. AAAI Press, 2002. [ bib ]
[SSTD2001] Ugo Dal Lago and Angelo Montanari. Calendars, time granularities and automata. In Christian S. Jensen, Markus Schneider, Bernhard Seeger, and Vassilis J. Tsotras, editors, Advances in Spatial and Temporal Databases, 7th International Symposium, Proceedings, volume 2121 of Lecture Notes in Computer Science, pages 279-298. Springer, 2001.
[ doi ] [ bib ]
Book Chapters
[DCE2008] Ugo Dal Lago and Simone Martini. Proofs as efficient programs. In Giovanna Corsi and Rossella Lupacchini, editors, Deduction, Computation, Experiment, pages 141-157. Springer, 2008. [ bib ]
Other
[PDDL2003] Piergiorgio Bertoli, Alessandro Cimatti, Ugo Dal Lago, and Marco Pistore. Extending PDDL to nondeterminism, limited sensing and iterative conditional plans. In ICAPS Workshop on PDDL, Informal Proceedings, pages 15-24, 2003.
[ bib ]