List of publications

[1] Roberto M. Amadio and Yann Régis-Gianas. Certifying and reasoning on cost annotations of functional programs. CoRR, abs/1110.2350, 2011. [ bib | http ]
[2] Patrick Baillot, Paolo Coppola, and Ugo Dal Lago. Light logics and optimal reduction: Completeness and complexity. Information and Computation, 209(2):118-142, 2011. [ bib | http ]
[3] The Coq Development Team. The coq proof assistant reference manual - version 8.3, 2010. [ bib ]
[4] Ugo Dal Lago and Marco Gaboardi. Linear dependent types and relative completeness. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, pages 133-142. IEEE Computer Society, 2011. [ bib | http ]
[5] Ugo Dal Lago and Paolo Di Giamberardino. Soft session types. In Proceedings 18th International Workshop on Expressiveness in Concurrency, volume 64 of EPTCS, pages 59-73, 2011. [ bib | http ]
[6] Andrew Gacek, Dale Miller, and Gopalan Nadathur. Nominal abstraction. Information and Computation, 209(1):48-73, 2011. [ bib | http ]
[7] Ugo Dal Lago and Martin Hofmann. Realizability models and implicit complexity. Theoretical Computer Science, 412(20):2029-2047, 2011. [ bib | http ]

This file was generated by bibtex2html 1.96.