var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https://dblp.org/pid/44/3105.bib&jsonp=1&fullnames=1&hidemenu=true&commas=true&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://dblp.org/pid/44/3105.bib&jsonp=1&fullnames=1&hidemenu=true&commas=true\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://dblp.org/pid/44/3105.bib&jsonp=1&fullnames=1&hidemenu=true&commas=true\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On Model-Checking Higher-Order Effectful Programs.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Alexis Ghyselen.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 8(POPL): 2610–2638. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/LagoG24,\n  author       = {Ugo Dal Lago and\n                  Alexis Ghyselen},\n  title        = {On Model-Checking Higher-Order Effectful Programs},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {8},\n  number       = {{POPL}},\n  pages        = {2610--2638},\n  year         = {2024},\n  url          = {https://doi.org/10.1145/3632929},\n  doi          = {10.1145/3632929},\n  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/LagoG24.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, & Paolo Pistone.\n\n\n \n\n\n\n In Aniello Murano, & Alexandra Silva., editor(s), 32nd EACSL Annual Conference on Computer Science Logic, CSL 2024, February 19-23, 2024, Naples, Italy, volume 288, of LIPIcs, pages 10:1–10:19, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"EnumeratingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/csl/AntonelliLDOP24,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Davide Davoli and\n                  Isabel Oitavem and\n                  Paolo Pistone},\n  editor       = {Aniello Murano and\n                  Alexandra Silva},\n  title        = {Enumerating Error Bounded Polytime Algorithms Through Arithmetical\n                  Theories},\n  booktitle    = {32nd {EACSL} Annual Conference on Computer Science Logic, {CSL} 2024,\n                  February 19-23, 2024, Naples, Italy},\n  series       = {LIPIcs},\n  volume       = {288},\n  pages        = {10:1--10:19},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2024},\n  url          = {https://doi.org/10.4230/LIPIcs.CSL.2024.10},\n  doi          = {10.4230/LIPICS.CSL.2024.10},\n  timestamp    = {Wed, 07 Feb 2024 14:22:56 +0100},\n  biburl       = {https://dblp.org/rec/conf/csl/AntonelliLDOP24.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Circuit Width Estimation via Effect Typing and Linear Dependency.\n \n \n \n \n\n\n \n Andrea Colledan, & Ugo Dal Lago.\n\n\n \n\n\n\n In Stephanie Weirich., editor(s), Programming Languages and Systems - 33rd European Symposium on Programming, ESOP 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II, volume 14577, of Lecture Notes in Computer Science, pages 3–30, 2024. Springer\n \n\n\n\n
\n\n\n\n \n \n \"CircuitPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esop/ColledanL24,\n  author       = {Andrea Colledan and\n                  Ugo Dal Lago},\n  editor       = {Stephanie Weirich},\n  title        = {Circuit Width Estimation via Effect Typing and Linear Dependency},\n  booktitle    = {Programming Languages and Systems - 33rd European Symposium on Programming,\n                  {ESOP} 2024, Held as Part of the European Joint Conferences on Theory\n                  and Practice of Software, {ETAPS} 2024, Luxembourg City, Luxembourg,\n                  April 6-11, 2024, Proceedings, Part {II}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {14577},\n  pages        = {3--30},\n  publisher    = {Springer},\n  year         = {2024},\n  url          = {https://doi.org/10.1007/978-3-031-57267-8\\_1},\n  doi          = {10.1007/978-3-031-57267-8\\_1},\n  timestamp    = {Sun, 14 Apr 2024 18:32:18 +0200},\n  biburl       = {https://dblp.org/rec/conf/esop/ColledanL24.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Basic Feasible Functionals and the Interpretation Method.\n \n \n \n \n\n\n \n Patrick Baillot, Ugo Dal Lago, Cynthia Kop, & Deivid Vale.\n\n\n \n\n\n\n In Naoki Kobayashi, & James Worrell., editor(s), Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II, volume 14575, of Lecture Notes in Computer Science, pages 70–91, 2024. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fossacs/BaillotLKV24,\n  author       = {Patrick Baillot and\n                  Ugo Dal Lago and\n                  Cynthia Kop and\n                  Deivid Vale},\n  editor       = {Naoki Kobayashi and\n                  James Worrell},\n  title        = {On Basic Feasible Functionals and the Interpretation Method},\n  booktitle    = {Foundations of Software Science and Computation Structures - 27th\n                  International Conference, FoSSaCS 2024, Held as Part of the European\n                  Joint Conferences on Theory and Practice of Software, {ETAPS} 2024,\n                  Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part {II}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {14575},\n  pages        = {70--91},\n  publisher    = {Springer},\n  year         = {2024},\n  url          = {https://doi.org/10.1007/978-3-031-57231-9\\_4},\n  doi          = {10.1007/978-3-031-57231-9\\_4},\n  timestamp    = {Sun, 14 Apr 2024 18:32:17 +0200},\n  biburl       = {https://dblp.org/rec/conf/fossacs/BaillotLKV24.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Basic Feasible Functionals and the Interpretation Method.\n \n \n \n \n\n\n \n Patrick Baillot, Ugo Dal Lago, Cynthia Kop, & Deivid Vale.\n\n\n \n\n\n\n CoRR, abs/2401.12385. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2401-12385,\n  author       = {Patrick Baillot and\n                  Ugo Dal Lago and\n                  Cynthia Kop and\n                  Deivid Vale},\n  title        = {On Basic Feasible Functionals and the Interpretation Method},\n  journal      = {CoRR},\n  volume       = {abs/2401.12385},\n  year         = {2024},\n  url          = {https://doi.org/10.48550/arXiv.2401.12385},\n  doi          = {10.48550/ARXIV.2401.12385},\n  eprinttype    = {arXiv},\n  eprint       = {2401.12385},\n  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2401-12385.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (13)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Preface to the special issue on metric and differential semantics.\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Paolo Pistone.\n\n\n \n\n\n\n Math. Struct. Comput. Sci., 33(4-5): 180–181. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"PrefacePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mscs/LagoGP23,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Paolo Pistone},\n  title        = {Preface to the special issue on metric and differential semantics},\n  journal      = {Math. Struct. Comput. Sci.},\n  volume       = {33},\n  number       = {4-5},\n  pages        = {180--181},\n  year         = {2023},\n  url          = {https://doi.org/10.1017/s0960129523000270},\n  doi          = {10.1017/S0960129523000270},\n  timestamp    = {Fri, 22 Mar 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/mscs/LagoGP23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On counting propositional logic and Wagner's hierarchy.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, & Paolo Pistone.\n\n\n \n\n\n\n Theor. Comput. Sci., 966-967: 113928. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/AntonelliLP23,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Paolo Pistone},\n  title        = {On counting propositional logic and Wagner's hierarchy},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {966-967},\n  pages        = {113928},\n  year         = {2023},\n  url          = {https://doi.org/10.1016/j.tcs.2023.113928},\n  doi          = {10.1016/J.TCS.2023.113928},\n  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcs/AntonelliLP23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Contextual Behavioural Metrics.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Maurizio Murgia.\n\n\n \n\n\n\n In Guillermo A. Pérez, & Jean-François Raskin., editor(s), 34th International Conference on Concurrency Theory, CONCUR 2023, September 18-23, 2023, Antwerp, Belgium, volume 279, of LIPIcs, pages 38:1–38:17, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"ContextualPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/concur/Lago023,\n  author       = {Ugo Dal Lago and\n                  Maurizio Murgia},\n  editor       = {Guillermo A. P{\\'{e}}rez and\n                  Jean{-}Fran{\\c{c}}ois Raskin},\n  title        = {Contextual Behavioural Metrics},\n  booktitle    = {34th International Conference on Concurrency Theory, {CONCUR} 2023,\n                  September 18-23, 2023, Antwerp, Belgium},\n  series       = {LIPIcs},\n  volume       = {279},\n  pages        = {38:1--38:17},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2023},\n  url          = {https://doi.org/10.4230/LIPIcs.CONCUR.2023.38},\n  doi          = {10.4230/LIPICS.CONCUR.2023.38},\n  timestamp    = {Sat, 09 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/concur/Lago023.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Open Higher-Order Logic.\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Alexis Ghyselen.\n\n\n \n\n\n\n In Bartek Klin, & Elaine Pimentel., editor(s), 31st EACSL Annual Conference on Computer Science Logic, CSL 2023, February 13-16, 2023, Warsaw, Poland, volume 252, of LIPIcs, pages 17:1–17:17, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OpenPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/csl/LagoGG23,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Alexis Ghyselen},\n  editor       = {Bartek Klin and\n                  Elaine Pimentel},\n  title        = {Open Higher-Order Logic},\n  booktitle    = {31st {EACSL} Annual Conference on Computer Science Logic, {CSL} 2023,\n                  February 13-16, 2023, Warsaw, Poland},\n  series       = {LIPIcs},\n  volume       = {252},\n  pages        = {17:1--17:17},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2023},\n  url          = {https://doi.org/10.4230/LIPIcs.CSL.2023.17},\n  doi          = {10.4230/LIPICS.CSL.2023.17},\n  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/csl/LagoGG23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Lattice of Program Metrics.\n \n \n \n \n\n\n \n Ugo Dal Lago, Naohiko Hoshino, & Paolo Pistone.\n\n\n \n\n\n\n In Marco Gaboardi, & Femke Raamsdonk., editor(s), 8th International Conference on Formal Structures for Computation and Deduction, FSCD 2023, July 3-6, 2023, Rome, Italy, volume 260, of LIPIcs, pages 20:1–20:19, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fscd/LagoHP23,\n  author       = {Ugo Dal Lago and\n                  Naohiko Hoshino and\n                  Paolo Pistone},\n  editor       = {Marco Gaboardi and\n                  Femke van Raamsdonk},\n  title        = {On the Lattice of Program Metrics},\n  booktitle    = {8th International Conference on Formal Structures for Computation\n                  and Deduction, {FSCD} 2023, July 3-6, 2023, Rome, Italy},\n  series       = {LIPIcs},\n  volume       = {260},\n  pages        = {20:1--20:19},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2023},\n  url          = {https://doi.org/10.4230/LIPIcs.FSCD.2023.20},\n  doi          = {10.4230/LIPICS.FSCD.2023.20},\n  timestamp    = {Fri, 30 Jun 2023 14:36:11 +0200},\n  biburl       = {https://dblp.org/rec/conf/fscd/LagoHP23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n (Not So) Boring Abstract Machines.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n In Giuseppa Castiglione, & Marinella Sciortino., editor(s), Proceedings of the 24th Italian Conference on Theoretical Computer Science, Palermo, Italy, September 13-15, 2023, volume 3587, of CEUR Workshop Proceedings, pages 225–240, 2023. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"(NotPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ictcs/LagoV23,\n  author       = {Ugo Dal Lago and\n                  Gabriele Vanoni},\n  editor       = {Giuseppa Castiglione and\n                  Marinella Sciortino},\n  title        = {(Not So) Boring Abstract Machines},\n  booktitle    = {Proceedings of the 24th Italian Conference on Theoretical Computer\n                  Science, Palermo, Italy, September 13-15, 2023},\n  series       = {{CEUR} Workshop Proceedings},\n  volume       = {3587},\n  pages        = {225--240},\n  publisher    = {CEUR-WS.org},\n  year         = {2023},\n  url          = {https://ceur-ws.org/Vol-3587/9878.pdf},\n  timestamp    = {Mon, 18 Dec 2023 16:58:34 +0100},\n  biburl       = {https://dblp.org/rec/conf/ictcs/LagoV23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Arithmetic Theory for the Poly-Time Random Functions.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, & Paolo Pistone.\n\n\n \n\n\n\n CoRR, abs/2301.12028. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2301-12028,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Davide Davoli and\n                  Isabel Oitavem and\n                  Paolo Pistone},\n  title        = {An Arithmetic Theory for the Poly-Time Random Functions},\n  journal      = {CoRR},\n  volume       = {abs/2301.12028},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2301.12028},\n  doi          = {10.48550/ARXIV.2301.12028},\n  eprinttype    = {arXiv},\n  eprint       = {2301.12028},\n  timestamp    = {Mon, 06 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2301-12028.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Log-Sensitive Encoding of Turing Machines in the \\(λ\\)-Calculus.\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n CoRR, abs/2301.12556. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2301-12556,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {A Log-Sensitive Encoding of Turing Machines in the {\\(\\lambda\\)}-Calculus},\n  journal      = {CoRR},\n  volume       = {abs/2301.12556},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2301.12556},\n  doi          = {10.48550/ARXIV.2301.12556},\n  eprinttype    = {arXiv},\n  eprint       = {2301.12556},\n  timestamp    = {Wed, 01 Feb 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2301-12556.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Lattice of Program Metrics.\n \n \n \n \n\n\n \n Ugo Dal Lago, Naohiko Hoshino, & Paolo Pistone.\n\n\n \n\n\n\n CoRR, abs/2302.05022. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2302-05022,\n  author       = {Ugo Dal Lago and\n                  Naohiko Hoshino and\n                  Paolo Pistone},\n  title        = {On the Lattice of Program Metrics},\n  journal      = {CoRR},\n  volume       = {abs/2302.05022},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2302.05022},\n  doi          = {10.48550/ARXIV.2302.05022},\n  eprinttype    = {arXiv},\n  eprint       = {2302.05022},\n  timestamp    = {Mon, 13 Feb 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2302-05022.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Contextual Behavioural Metrics (Extended Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Maurizio Murgia.\n\n\n \n\n\n\n CoRR, abs/2307.07400. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ContextualPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2307-07400,\n  author       = {Ugo Dal Lago and\n                  Maurizio Murgia},\n  title        = {Contextual Behavioural Metrics (Extended Version)},\n  journal      = {CoRR},\n  volume       = {abs/2307.07400},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2307.07400},\n  doi          = {10.48550/ARXIV.2307.07400},\n  eprinttype    = {arXiv},\n  eprint       = {2307.07400},\n  timestamp    = {Mon, 06 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2307-07400.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Model-Checking Higher-Order Effectful Programs (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Alexis Ghyselen.\n\n\n \n\n\n\n CoRR, abs/2308.16542. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2308-16542,\n  author       = {Ugo Dal Lago and\n                  Alexis Ghyselen},\n  title        = {On Model-Checking Higher-Order Effectful Programs (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/2308.16542},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2308.16542},\n  doi          = {10.48550/ARXIV.2308.16542},\n  eprinttype    = {arXiv},\n  eprint       = {2308.16542},\n  timestamp    = {Mon, 04 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2308-16542.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Circuit Width Estimation via Effect Typing and Linear Dependency (Long Version).\n \n \n \n \n\n\n \n Andrea Colledan, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/2310.19096. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"CircuitPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2310-19096,\n  author       = {Andrea Colledan and\n                  Ugo Dal Lago},\n  title        = {Circuit Width Estimation via Effect Typing and Linear Dependency (Long\n                  Version)},\n  journal      = {CoRR},\n  volume       = {abs/2310.19096},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2310.19096},\n  doi          = {10.48550/ARXIV.2310.19096},\n  eprinttype    = {arXiv},\n  eprint       = {2310.19096},\n  timestamp    = {Thu, 02 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-19096.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, & Paolo Pistone.\n\n\n \n\n\n\n CoRR, abs/2311.15003. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"EnumeratingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2311-15003,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Davide Davoli and\n                  Isabel Oitavem and\n                  Paolo Pistone},\n  title        = {Enumerating Error Bounded Polytime Algorithms Through Arithmetical\n                  Theories},\n  journal      = {CoRR},\n  volume       = {abs/2311.15003},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2311.15003},\n  doi          = {10.48550/ARXIV.2311.15003},\n  eprinttype    = {arXiv},\n  eprint       = {2311.15003},\n  timestamp    = {Thu, 30 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2311-15003.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (22)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Implicit recursion-theoretic characterizations of counting classes.\n \n \n \n \n\n\n \n Ugo Dal Lago, Reinhard Kahle, & Isabel Oitavem.\n\n\n \n\n\n\n Arch. Math. Log., 61(7-8): 1129–1144. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ImplicitPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/aml/LagoKO22,\n  author       = {Ugo Dal Lago and\n                  Reinhard Kahle and\n                  Isabel Oitavem},\n  title        = {Implicit recursion-theoretic characterizations of counting classes},\n  journal      = {Arch. Math. Log.},\n  volume       = {61},\n  number       = {7-8},\n  pages        = {1129--1144},\n  year         = {2022},\n  url          = {https://doi.org/10.1007/s00153-022-00828-4},\n  doi          = {10.1007/S00153-022-00828-4},\n  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/aml/LagoKO22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Implicit computation complexity in higher-order programming languages: A Survey in Memory of Martin Hofmann.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n Math. Struct. Comput. Sci., 32(6): 760–776. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ImplicitPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mscs/Lago22,\n  author       = {Ugo Dal Lago},\n  title        = {Implicit computation complexity in higher-order programming languages:\n                  {A} Survey in Memory of Martin Hofmann},\n  journal      = {Math. Struct. Comput. Sci.},\n  volume       = {32},\n  number       = {6},\n  pages        = {760--776},\n  year         = {2022},\n  url          = {https://doi.org/10.1017/S0960129521000505},\n  doi          = {10.1017/S0960129521000505},\n  timestamp    = {Sat, 25 Feb 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/mscs/Lago22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multi types and reasonable space.\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 6(ICFP): 799–825. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"MultiPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/AccattoliLV22,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {Multi types and reasonable space},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {6},\n  number       = {{ICFP}},\n  pages        = {799--825},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3547650},\n  doi          = {10.1145/3547650},\n  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/AccattoliLV22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Feller continuity and full abstraction.\n \n \n \n \n\n\n \n Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 6(ICFP): 826–854. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/BartheCLG22,\n  author       = {Gilles Barthe and\n                  Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {On Feller continuity and full abstraction},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {6},\n  number       = {{ICFP}},\n  pages        = {826--854},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3547651},\n  doi          = {10.1145/3547651},\n  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/BartheCLG22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Effectful program distancing.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 6(POPL): 1–30. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"EffectfulPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/LagoG22,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {Effectful program distancing},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {6},\n  number       = {{POPL}},\n  pages        = {1--30},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3498680},\n  doi          = {10.1145/3498680},\n  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/LagoG22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A relational theory of effects and coeffects.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 6(POPL): 1–28. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/LagoG22a,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {A relational theory of effects and coeffects},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {6},\n  number       = {{POPL}},\n  pages        = {1--28},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3498692},\n  doi          = {10.1145/3498692},\n  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/LagoG22a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Tidy: Symbolic Verification of Timed Cryptographic Protocols.\n \n \n \n \n\n\n \n Gilles Barthe, Ugo Dal Lago, Giulio Malavolta, & Itsaka Rakotonirina.\n\n\n \n\n\n\n In Heng Yin, Angelos Stavrou, Cas Cremers, & Elaine Shi., editor(s), Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022, pages 263–276, 2022. ACM\n \n\n\n\n
\n\n\n\n \n \n \"Tidy:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ccs/BartheLMR22,\n  author       = {Gilles Barthe and\n                  Ugo Dal Lago and\n                  Giulio Malavolta and\n                  Itsaka Rakotonirina},\n  editor       = {Heng Yin and\n                  Angelos Stavrou and\n                  Cas Cremers and\n                  Elaine Shi},\n  title        = {Tidy: Symbolic Verification of Timed Cryptographic Protocols},\n  booktitle    = {Proceedings of the 2022 {ACM} {SIGSAC} Conference on Computer and\n                  Communications Security, {CCS} 2022, Los Angeles, CA, USA, November\n                  7-11, 2022},\n  pages        = {263--276},\n  publisher    = {{ACM}},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3548606.3559343},\n  doi          = {10.1145/3548606.3559343},\n  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/ccs/BartheLMR22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Giulia Giusti.\n\n\n \n\n\n\n In Bartek Klin, Slawomir Lasota, & Anca Muscholl., editor(s), 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, volume 243, of LIPIcs, pages 37:1–37:18, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/concur/LagoG22,\n  author       = {Ugo Dal Lago and\n                  Giulia Giusti},\n  editor       = {Bartek Klin and\n                  Slawomir Lasota and\n                  Anca Muscholl},\n  title        = {On Session Typing, Probabilistic Polynomial Time, and Cryptographic\n                  Experiments},\n  booktitle    = {33rd International Conference on Concurrency Theory, {CONCUR} 2022,\n                  September 12-16, 2022, Warsaw, Poland},\n  series       = {LIPIcs},\n  volume       = {243},\n  pages        = {37:1--37:18},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2022},\n  url          = {https://doi.org/10.4230/LIPIcs.CONCUR.2022.37},\n  doi          = {10.4230/LIPICS.CONCUR.2022.37},\n  timestamp    = {Mon, 26 Sep 2022 16:25:34 +0200},\n  biburl       = {https://dblp.org/rec/conf/concur/LagoG22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Quantitative Algebraic Higher-Order Theories.\n \n \n \n \n\n\n \n Ugo Dal Lago, Furio Honsell, Marina Lenisa, & Paolo Pistone.\n\n\n \n\n\n\n In Amy P. Felty., editor(s), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022, August 2-5, 2022, Haifa, Israel, volume 228, of LIPIcs, pages 4:1–4:18, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fscd/LagoHLP22,\n  author       = {Ugo Dal Lago and\n                  Furio Honsell and\n                  Marina Lenisa and\n                  Paolo Pistone},\n  editor       = {Amy P. Felty},\n  title        = {On Quantitative Algebraic Higher-Order Theories},\n  booktitle    = {7th International Conference on Formal Structures for Computation\n                  and Deduction, {FSCD} 2022, August 2-5, 2022, Haifa, Israel},\n  series       = {LIPIcs},\n  volume       = {228},\n  pages        = {4:1--4:18},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2022},\n  url          = {https://doi.org/10.4230/LIPIcs.FSCD.2022.4},\n  doi          = {10.4230/LIPICS.FSCD.2022.4},\n  timestamp    = {Tue, 28 Jun 2022 15:50:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/fscd/LagoHLP22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Curry and Howard Meet Borel.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, & Paolo Pistone.\n\n\n \n\n\n\n In Christel Baier, & Dana Fisman., editor(s), LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, pages 45:1–45:13, 2022. ACM\n \n\n\n\n
\n\n\n\n \n \n \"CurryPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/AntonelliLP22,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Paolo Pistone},\n  editor       = {Christel Baier and\n                  Dana Fisman},\n  title        = {Curry and Howard Meet Borel},\n  booktitle    = {{LICS} '22: 37th Annual {ACM/IEEE} Symposium on Logic in Computer\n                  Science, Haifa, Israel, August 2 - 5, 2022},\n  pages        = {45:1--45:13},\n  publisher    = {{ACM}},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3531130.3533361},\n  doi          = {10.1145/3531130.3533361},\n  timestamp    = {Tue, 09 Aug 2022 12:30:54 +0200},\n  biburl       = {https://dblp.org/rec/conf/lics/AntonelliLP22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasonable Space for the \\(λ\\)-Calculus, Logarithmically.\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n In Christel Baier, & Dana Fisman., editor(s), LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, pages 47:1–47:13, 2022. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ReasonablePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/AccattoliLV22,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  editor       = {Christel Baier and\n                  Dana Fisman},\n  title        = {Reasonable Space for the {\\(\\lambda\\)}-Calculus, Logarithmically},\n  booktitle    = {{LICS} '22: 37th Annual {ACM/IEEE} Symposium on Logic in Computer\n                  Science, Haifa, Israel, August 2 - 5, 2022},\n  pages        = {47:1--47:13},\n  publisher    = {{ACM}},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3531130.3533362},\n  doi          = {10.1145/3531130.3533362},\n  timestamp    = {Tue, 09 Aug 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/lics/AccattoliLV22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Dynamic Lifting and Effect Typing in Circuit Description Languages.\n \n \n \n \n\n\n \n Andrea Colledan, & Ugo Dal Lago.\n\n\n \n\n\n\n In Delia Kesner, & Pierre-Marie Pédrot., editor(s), 28th International Conference on Types for Proofs and Programs, TYPES 2022, June 20-25, 2022, LS2N, University of Nantes, France, volume 269, of LIPIcs, pages 3:1–3:21, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/types/ColledanL22,\n  author       = {Andrea Colledan and\n                  Ugo Dal Lago},\n  editor       = {Delia Kesner and\n                  Pierre{-}Marie P{\\'{e}}drot},\n  title        = {On Dynamic Lifting and Effect Typing in Circuit Description Languages},\n  booktitle    = {28th International Conference on Types for Proofs and Programs, {TYPES}\n                  2022, June 20-25, 2022, LS2N, University of Nantes, France},\n  series       = {LIPIcs},\n  volume       = {269},\n  pages        = {3:1--3:21},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2022},\n  url          = {https://doi.org/10.4230/LIPIcs.TYPES.2022.3},\n  doi          = {10.4230/LIPICS.TYPES.2022.3},\n  timestamp    = {Mon, 31 Jul 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/types/ColledanL22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings of the 23rd Italian Conference on Theoretical Computer Science, ICTCS 2022, Rome, Italy, September 7-9, 2022.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Daniele Gorla.,\n editors.\n \n\n\n \n\n\n\n Volume 3284, of CEUR Workshop Proceedings.CEUR-WS.org. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ProceedingsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{DBLP:conf/ictcs/2022,\n  editor       = {Ugo Dal Lago and\n                  Daniele Gorla},\n  title        = {Proceedings of the 23rd Italian Conference on Theoretical Computer\n                  Science, {ICTCS} 2022, Rome, Italy, September 7-9, 2022},\n  series       = {{CEUR} Workshop Proceedings},\n  volume       = {3284},\n  publisher    = {CEUR-WS.org},\n  year         = {2022},\n  url          = {https://ceur-ws.org/Vol-3284},\n  urn          = {urn:nbn:de:0074-3284-4},\n  timestamp    = {Fri, 10 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/ictcs/2022.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Dynamic Lifting and Effect Typing in Circuit Description Languages (Extended Version).\n \n \n \n \n\n\n \n Andrea Colledan, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/2202.07636. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2202-07636,\n  author       = {Andrea Colledan and\n                  Ugo Dal Lago},\n  title        = {On Dynamic Lifting and Effect Typing in Circuit Description Languages\n                  (Extended Version)},\n  journal      = {CoRR},\n  volume       = {abs/2202.07636},\n  year         = {2022},\n  url          = {https://arxiv.org/abs/2202.07636},\n  eprinttype    = {arXiv},\n  eprint       = {2202.07636},\n  timestamp    = {Fri, 18 Feb 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-07636.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Reasonable Space for the \\(λ\\)-Calculus, Logarithmically.\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n CoRR, abs/2203.00362. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ReasonablePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2203-00362,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {Reasonable Space for the {\\(\\lambda\\)}-Calculus, Logarithmically},\n  journal      = {CoRR},\n  volume       = {abs/2203.00362},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2203.00362},\n  doi          = {10.48550/ARXIV.2203.00362},\n  eprinttype    = {arXiv},\n  eprint       = {2203.00362},\n  timestamp    = {Wed, 16 Mar 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2203-00362.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Curry and Howard Meet Borel.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, & Paolo Pistone.\n\n\n \n\n\n\n CoRR, abs/2203.11265. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"CurryPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2203-11265,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Paolo Pistone},\n  title        = {Curry and Howard Meet Borel},\n  journal      = {CoRR},\n  volume       = {abs/2203.11265},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2203.11265},\n  doi          = {10.48550/ARXIV.2203.11265},\n  eprinttype    = {arXiv},\n  eprint       = {2203.11265},\n  timestamp    = {Tue, 29 Mar 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2203-11265.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Reinforcement Learning, Effect Handlers, and the State Monad.\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Alexis Ghyselen.\n\n\n \n\n\n\n CoRR, abs/2203.15426. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2203-15426,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Alexis Ghyselen},\n  title        = {On Reinforcement Learning, Effect Handlers, and the State Monad},\n  journal      = {CoRR},\n  volume       = {abs/2203.15426},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2203.15426},\n  doi          = {10.48550/ARXIV.2203.15426},\n  eprinttype    = {arXiv},\n  eprint       = {2203.15426},\n  timestamp    = {Mon, 04 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2203-15426.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Quantitative Algebraic Higher-Order Theories.\n \n \n \n \n\n\n \n Ugo Dal Lago, Furio Honsell, Marina Lenisa, & Paolo Pistone.\n\n\n \n\n\n\n CoRR, abs/2204.13654. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2204-13654,\n  author       = {Ugo Dal Lago and\n                  Furio Honsell and\n                  Marina Lenisa and\n                  Paolo Pistone},\n  title        = {On Quantitative Algebraic Higher-Order Theories},\n  journal      = {CoRR},\n  volume       = {abs/2204.13654},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2204.13654},\n  doi          = {10.48550/ARXIV.2204.13654},\n  eprinttype    = {arXiv},\n  eprint       = {2204.13654},\n  timestamp    = {Mon, 02 May 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-13654.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Giulia Giusti.\n\n\n \n\n\n\n CoRR, abs/2207.03360. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2207-03360,\n  author       = {Ugo Dal Lago and\n                  Giulia Giusti},\n  title        = {On Session Typing, Probabilistic Polynomial Time, and Cryptographic\n                  Experiments (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/2207.03360},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2207.03360},\n  doi          = {10.48550/ARXIV.2207.03360},\n  eprinttype    = {arXiv},\n  eprint       = {2207.03360},\n  timestamp    = {Wed, 13 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2207-03360.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Multi Types and Reasonable Space (Long Version).\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n CoRR, abs/2207.08795. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"MultiPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2207-08795,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {Multi Types and Reasonable Space (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/2207.08795},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2207.08795},\n  doi          = {10.48550/ARXIV.2207.08795},\n  eprinttype    = {arXiv},\n  eprint       = {2207.08795},\n  timestamp    = {Tue, 19 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2207-08795.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Feller Continuity and Full Abstraction (Long Version).\n \n \n \n \n\n\n \n Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n CoRR, abs/2207.10590. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2207-10590,\n  author       = {Gilles Barthe and\n                  Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {On Feller Continuity and Full Abstraction (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/2207.10590},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2207.10590},\n  doi          = {10.48550/ARXIV.2207.10590},\n  eprinttype    = {arXiv},\n  eprint       = {2207.10590},\n  timestamp    = {Mon, 25 Jul 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2207-10590.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Open Higher-Order Logic (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Alexis Ghyselen.\n\n\n \n\n\n\n CoRR, abs/2211.06671. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"OpenPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2211-06671,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Alexis Ghyselen},\n  title        = {Open Higher-Order Logic (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/2211.06671},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2211.06671},\n  doi          = {10.48550/ARXIV.2211.06671},\n  eprinttype    = {arXiv},\n  eprint       = {2211.06671},\n  timestamp    = {Tue, 15 Nov 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2211-06671.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (17)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On Higher-Order Probabilistic Subrecursion.\n \n \n \n \n\n\n \n Flavien Breuvart, Ugo Dal Lago, & Agathe Herrou.\n\n\n \n\n\n\n Log. Methods Comput. Sci., 17(4). 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/lmcs/BreuvartLH21,\n  author       = {Flavien Breuvart and\n                  Ugo Dal Lago and\n                  Agathe Herrou},\n  title        = {On Higher-Order Probabilistic Subrecursion},\n  journal      = {Log. Methods Comput. Sci.},\n  volume       = {17},\n  number       = {4},\n  year         = {2021},\n  url          = {https://doi.org/10.46298/lmcs-17(4:25)2021},\n  doi          = {10.46298/LMCS-17(4:25)2021},\n  timestamp    = {Tue, 31 Jan 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/lmcs/BreuvartLH21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The geometry of Bayesian programming.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Naohiko Hoshino.\n\n\n \n\n\n\n Math. Struct. Comput. Sci., 31(6): 633–681. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mscs/LagoH21,\n  author       = {Ugo Dal Lago and\n                  Naohiko Hoshino},\n  title        = {The geometry of Bayesian programming},\n  journal      = {Math. Struct. Comput. Sci.},\n  volume       = {31},\n  number       = {6},\n  pages        = {633--681},\n  year         = {2021},\n  url          = {https://doi.org/10.1017/S0960129521000396},\n  doi          = {10.1017/S0960129521000396},\n  timestamp    = {Wed, 23 Feb 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/mscs/LagoH21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On continuation-passing transformations and expected cost analysis.\n \n \n \n \n\n\n \n Martin Avanzini, Gilles Barthe, & Ugo Dal Lago.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 5(ICFP): 1–30. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/AvanziniBL21,\n  author       = {Martin Avanzini and\n                  Gilles Barthe and\n                  Ugo Dal Lago},\n  title        = {On continuation-passing transformations and expected cost analysis},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {5},\n  number       = {{ICFP}},\n  pages        = {1--30},\n  year         = {2021},\n  url          = {https://doi.org/10.1145/3473592},\n  doi          = {10.1145/3473592},\n  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/AvanziniBL21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The (In)Efficiency of interaction.\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 5(POPL): 1–33. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/AccattoliLV21,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {The (In)Efficiency of interaction},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {5},\n  number       = {{POPL}},\n  pages        = {1--33},\n  year         = {2021},\n  url          = {https://doi.org/10.1145/3434332},\n  doi          = {10.1145/3434332},\n  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/AccattoliLV21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Intersection types and (positive) almost-sure termination.\n \n \n \n \n\n\n \n Ugo Dal Lago, Claudia Faggian, & Simona Ronchi Della Rocca.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 5(POPL): 1–32. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"IntersectionPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/LagoFR21,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian and\n                  Simona Ronchi Della Rocca},\n  title        = {Intersection types and (positive) almost-sure termination},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {5},\n  number       = {{POPL}},\n  pages        = {1--32},\n  year         = {2021},\n  url          = {https://doi.org/10.1145/3434313},\n  doi          = {10.1145/3434313},\n  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/LagoFR21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Differential logical relations, part II increments and derivatives.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n Theor. Comput. Sci., 895: 34–47. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"DifferentialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoG21,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {Differential logical relations, part {II} increments and derivatives},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {895},\n  pages        = {34--47},\n  year         = {2021},\n  url          = {https://doi.org/10.1016/j.tcs.2021.09.027},\n  doi          = {10.1016/J.TCS.2021.09.027},\n  timestamp    = {Wed, 15 Dec 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoG21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Measure Quantifiers in First-Order Arithmetic.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, & Paolo Pistone.\n\n\n \n\n\n\n In Liesbeth De Mol, Andreas Weiermann, Florin Manea, & David Fernández-Duque., editor(s), Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings, volume 12813, of Lecture Notes in Computer Science, pages 12–24, 2021. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/cie/AntonelliLP21,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Paolo Pistone},\n  editor       = {Liesbeth De Mol and\n                  Andreas Weiermann and\n                  Florin Manea and\n                  David Fern{\\'{a}}ndez{-}Duque},\n  title        = {On Measure Quantifiers in First-Order Arithmetic},\n  booktitle    = {Connecting with Computability - 17th Conference on Computability in\n                  Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12813},\n  pages        = {12--24},\n  publisher    = {Springer},\n  year         = {2021},\n  url          = {https://doi.org/10.1007/978-3-030-80049-9\\_2},\n  doi          = {10.1007/978-3-030-80049-9\\_2},\n  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/cie/AntonelliLP21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Programs.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n In Naoki Kobayashi., editor(s), 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, July 17-24, 2021, Buenos Aires, Argentina (Virtual Conference), volume 195, of LIPIcs, pages 23:1–23:19, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"ResourcePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fscd/LagoG21,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  editor       = {Naoki Kobayashi},\n  title        = {Resource Transition Systems and Full Abstraction for Linear Higher-Order\n                  Effectful Programs},\n  booktitle    = {6th International Conference on Formal Structures for Computation\n                  and Deduction, {FSCD} 2021, July 17-24, 2021, Buenos Aires, Argentina\n                  (Virtual Conference)},\n  series       = {LIPIcs},\n  volume       = {195},\n  pages        = {23:1--23:19},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2021},\n  url          = {https://doi.org/10.4230/LIPIcs.FSCD.2021.23},\n  doi          = {10.4230/LIPICS.FSCD.2021.23},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/fscd/LagoG21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Counting Propositional Logic and Wagner's Hierarchy.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, & Paolo Pistone.\n\n\n \n\n\n\n In Claudio Sacerdoti Coen, & Ivano Salvo., editor(s), Proceedings of the 22nd Italian Conference on Theoretical Computer Science, Bologna, Italy, September 13-15, 2021, volume 3072, of CEUR Workshop Proceedings, pages 107–121, 2021. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ictcs/AntonelliLP21,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Paolo Pistone},\n  editor       = {Claudio Sacerdoti Coen and\n                  Ivano Salvo},\n  title        = {On Counting Propositional Logic and Wagner's Hierarchy},\n  booktitle    = {Proceedings of the 22nd Italian Conference on Theoretical Computer\n                  Science, Bologna, Italy, September 13-15, 2021},\n  series       = {{CEUR} Workshop Proceedings},\n  volume       = {3072},\n  pages        = {107--121},\n  publisher    = {CEUR-WS.org},\n  year         = {2021},\n  url          = {https://ceur-ws.org/Vol-3072/paper9.pdf},\n  timestamp    = {Fri, 10 Mar 2023 16:23:17 +0100},\n  biburl       = {https://dblp.org/rec/conf/ictcs/AntonelliLP21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Space of Interaction.\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pages 1–13, 2021. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/AccattoliLV21,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {The Space of Interaction},\n  booktitle    = {36th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n                  2021, Rome, Italy, June 29 - July 2, 2021},\n  pages        = {1--13},\n  publisher    = {{IEEE}},\n  year         = {2021},\n  url          = {https://doi.org/10.1109/LICS52264.2021.9470726},\n  doi          = {10.1109/LICS52264.2021.9470726},\n  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/lics/AccattoliLV21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Recursion-Theoretic Characterization of the Probabilistic Class PP.\n \n \n \n \n\n\n \n Ugo Dal Lago, Reinhard Kahle, & Isabel Oitavem.\n\n\n \n\n\n\n In Filippo Bonchi, & Simon J. Puglisi., editor(s), 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia, volume 202, of LIPIcs, pages 35:1–35:12, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/mfcs/LagoKO21,\n  author       = {Ugo Dal Lago and\n                  Reinhard Kahle and\n                  Isabel Oitavem},\n  editor       = {Filippo Bonchi and\n                  Simon J. Puglisi},\n  title        = {A Recursion-Theoretic Characterization of the Probabilistic Class\n                  {PP}},\n  booktitle    = {46th International Symposium on Mathematical Foundations of Computer\n                  Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},\n  series       = {LIPIcs},\n  volume       = {202},\n  pages        = {35:1--35:12},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2021},\n  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2021.35},\n  doi          = {10.4230/LIPICS.MFCS.2021.35},\n  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/mfcs/LagoKO21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings Second Joint International Workshop on Linearity & Trends in Linear Logic and Applications, Linearity&TLLA@IJCAR-FSCD 2020, Online, 29-30 June 2020.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Valeria Paiva.,\n editors.\n \n\n\n \n\n\n\n Volume 353, of EPTCS. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{DBLP:journals/corr/abs-2112-14305,\n  editor       = {Ugo Dal Lago and\n                  Valeria de Paiva},\n  title        = {Proceedings Second Joint International Workshop on Linearity {\\&}\n                  Trends in Linear Logic and Applications, Linearity{\\&}TLLA@IJCAR-FSCD\n                  2020, Online, 29-30 June 2020},\n  series       = {{EPTCS}},\n  volume       = {353},\n  year         = {2021},\n  url          = {https://doi.org/10.4204/EPTCS.353},\n  doi          = {10.4204/EPTCS.353},\n  timestamp    = {Thu, 17 Mar 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2112-14305.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Modal Reasoning = Metric Reasoning, via Lawvere.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n CoRR, abs/2103.03871. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ModalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2103-03871,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {Modal Reasoning = Metric Reasoning, via Lawvere},\n  journal      = {CoRR},\n  volume       = {abs/2103.03871},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2103.03871},\n  eprinttype    = {arXiv},\n  eprint       = {2103.03871},\n  timestamp    = {Mon, 15 Mar 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-03871.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Counting Propositional Logic.\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, & Paolo Pistone.\n\n\n \n\n\n\n CoRR, abs/2103.12862. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2103-12862,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Paolo Pistone},\n  title        = {On Counting Propositional Logic},\n  journal      = {CoRR},\n  volume       = {abs/2103.12862},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2103.12862},\n  eprinttype    = {arXiv},\n  eprint       = {2103.12862},\n  timestamp    = {Tue, 06 Apr 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-12862.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Measure Quantifiers in First-Order Arithmetic (Long Version).\n \n \n \n \n\n\n \n Melissa Antonelli, Ugo Dal Lago, & Paolo Pistone.\n\n\n \n\n\n\n CoRR, abs/2104.12124. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2104-12124,\n  author       = {Melissa Antonelli and\n                  Ugo Dal Lago and\n                  Paolo Pistone},\n  title        = {On Measure Quantifiers in First-Order Arithmetic (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/2104.12124},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2104.12124},\n  eprinttype    = {arXiv},\n  eprint       = {2104.12124},\n  timestamp    = {Mon, 03 May 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-12124.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Space of Interaction (long version).\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n CoRR, abs/2104.13795. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2104-13795,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {The Space of Interaction (long version)},\n  journal      = {CoRR},\n  volume       = {abs/2104.13795},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2104.13795},\n  eprinttype    = {arXiv},\n  eprint       = {2104.13795},\n  timestamp    = {Tue, 04 May 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-13795.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Systems.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n CoRR, abs/2106.12849. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ResourcePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2106-12849,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {Resource Transition Systems and Full Abstraction for Linear Higher-Order\n                  Effectful Systems},\n  journal      = {CoRR},\n  volume       = {abs/2106.12849},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2106.12849},\n  eprinttype    = {arXiv},\n  eprint       = {2106.12849},\n  timestamp    = {Wed, 30 Jun 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-12849.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (17)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the Termination Problem for Probabilistic Higher-Order Recursive Programs.\n \n \n \n \n\n\n \n Naoki Kobayashi, Ugo Dal Lago, & Charles Grellois.\n\n\n \n\n\n\n Log. Methods Comput. Sci., 16(4). 2020.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/lmcs/KobayashiLG20,\n  author       = {Naoki Kobayashi and\n                  Ugo Dal Lago and\n                  Charles Grellois},\n  title        = {On the Termination Problem for Probabilistic Higher-Order Recursive\n                  Programs},\n  journal      = {Log. Methods Comput. Sci.},\n  volume       = {16},\n  number       = {4},\n  year         = {2020},\n  url          = {https://lmcs.episciences.org/6817},\n  timestamp    = {Wed, 28 Oct 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/lmcs/KobayashiLG20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On probabilistic term rewriting.\n \n \n \n \n\n\n \n Martin Avanzini, Ugo Dal Lago, & Akihisa Yamada.\n\n\n \n\n\n\n Sci. Comput. Program., 185. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/scp/AvanziniLY20,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago and\n                  Akihisa Yamada},\n  title        = {On probabilistic term rewriting},\n  journal      = {Sci. Comput. Program.},\n  volume       = {185},\n  year         = {2020},\n  url          = {https://doi.org/10.1016/j.scico.2019.102338},\n  doi          = {10.1016/J.SCICO.2019.102338},\n  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/scp/AvanziniLY20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On randomised strategies in the \\emph\\(λ\\)-calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n Theor. Comput. Sci., 813: 100–116. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoV20,\n  author       = {Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {On randomised strategies in the \\emph{{\\(\\lambda\\)}}-calculus},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {813},\n  pages        = {100--116},\n  year         = {2020},\n  url          = {https://doi.org/10.1016/j.tcs.2019.09.033},\n  doi          = {10.1016/J.TCS.2019.09.033},\n  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoV20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Effectful applicative similarity for call-by-name lambda calculi.\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Ryo Tanaka.\n\n\n \n\n\n\n Theor. Comput. Sci., 813: 234–247. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"EffectfulPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoGT20,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Ryo Tanaka},\n  title        = {Effectful applicative similarity for call-by-name lambda calculi},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {813},\n  pages        = {234--247},\n  year         = {2020},\n  url          = {https://doi.org/10.1016/j.tcs.2019.12.025},\n  doi          = {10.1016/J.TCS.2019.12.025},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoGT20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Versatility of Open Logical Relations - Continuity, Automatic Differentiation, and a Containment Theorem.\n \n \n \n \n\n\n \n Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n In Peter Müller., editor(s), Programming Languages and Systems - 29th European Symposium on Programming, ESOP 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, volume 12075, of Lecture Notes in Computer Science, pages 56–83, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esop/BartheCLG20,\n  author       = {Gilles Barthe and\n                  Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago and\n                  Francesco Gavazzo},\n  editor       = {Peter M{\\"{u}}ller},\n  title        = {On the Versatility of Open Logical Relations - Continuity, Automatic\n                  Differentiation, and a Containment Theorem},\n  booktitle    = {Programming Languages and Systems - 29th European Symposium on Programming,\n                  {ESOP} 2020, Held as Part of the European Joint Conferences on Theory\n                  and Practice of Software, {ETAPS} 2020, Dublin, Ireland, April 25-30,\n                  2020, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12075},\n  pages        = {56--83},\n  publisher    = {Springer},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/978-3-030-44914-8\\_3},\n  doi          = {10.1007/978-3-030-44914-8\\_3},\n  timestamp    = {Fri, 14 May 2021 08:34:21 +0200},\n  biburl       = {https://dblp.org/rec/conf/esop/BartheCLG20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decomposing Probabilistic Lambda-Calculi.\n \n \n \n \n\n\n \n Ugo Dal Lago, Giulio Guerrieri, & Willem Heijltjes.\n\n\n \n\n\n\n In Jean Goubault-Larrecq, & Barbara König., editor(s), Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, volume 12077, of Lecture Notes in Computer Science, pages 136–156, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DecomposingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fossacs/LagoGH20,\n  author       = {Ugo Dal Lago and\n                  Giulio Guerrieri and\n                  Willem Heijltjes},\n  editor       = {Jean Goubault{-}Larrecq and\n                  Barbara K{\\"{o}}nig},\n  title        = {Decomposing Probabilistic Lambda-Calculi},\n  booktitle    = {Foundations of Software Science and Computation Structures - 23rd\n                  International Conference, {FOSSACS} 2020, Held as Part of the European\n                  Joint Conferences on Theory and Practice of Software, {ETAPS} 2020,\n                  Dublin, Ireland, April 25-30, 2020, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12077},\n  pages        = {136--156},\n  publisher    = {Springer},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/978-3-030-45231-5\\_8},\n  doi          = {10.1007/978-3-030-45231-5\\_8},\n  timestamp    = {Fri, 14 May 2021 08:34:11 +0200},\n  biburl       = {https://dblp.org/rec/conf/fossacs/LagoGH20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Solvability in a Probabilistic Setting (Invited Talk).\n \n \n \n \n\n\n \n Simona Ronchi Della Rocca, Ugo Dal Lago, & Claudia Faggian.\n\n\n \n\n\n\n In Zena M. Ariola., editor(s), 5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, June 29-July 6, 2020, Paris, France (Virtual Conference), volume 167, of LIPIcs, pages 1:1–1:17, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"SolvabilityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fscd/RoccaLF20,\n  author       = {Simona Ronchi Della Rocca and\n                  Ugo Dal Lago and\n                  Claudia Faggian},\n  editor       = {Zena M. Ariola},\n  title        = {Solvability in a Probabilistic Setting (Invited Talk)},\n  booktitle    = {5th International Conference on Formal Structures for Computation\n                  and Deduction, {FSCD} 2020, June 29-July 6, 2020, Paris, France (Virtual\n                  Conference)},\n  series       = {LIPIcs},\n  volume       = {167},\n  pages        = {1:1--1:17},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2020},\n  url          = {https://doi.org/10.4230/LIPIcs.FSCD.2020.1},\n  doi          = {10.4230/LIPICS.FSCD.2020.1},\n  timestamp    = {Mon, 29 Jun 2020 14:56:06 +0200},\n  biburl       = {https://dblp.org/rec/conf/fscd/RoccaLF20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Higher-Order Cryptography.\n \n \n \n \n\n\n \n Boaz Barak, Raphaëlle Crubillé, & Ugo Dal Lago.\n\n\n \n\n\n\n In Artur Czumaj, Anuj Dawar, & Emanuela Merelli., editor(s), 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), volume 168, of LIPIcs, pages 108:1–108:16, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 38 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icalp/BarakCL20,\n  author       = {Boaz Barak and\n                  Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago},\n  editor       = {Artur Czumaj and\n                  Anuj Dawar and\n                  Emanuela Merelli},\n  title        = {On Higher-Order Cryptography},\n  booktitle    = {47th International Colloquium on Automata, Languages, and Programming,\n                  {ICALP} 2020, July 8-11, 2020, Saarbr{\\"{u}}cken, Germany (Virtual\n                  Conference)},\n  series       = {LIPIcs},\n  volume       = {168},\n  pages        = {108:1--108:16},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2020},\n  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2020.108},\n  doi          = {10.4230/LIPICS.ICALP.2020.108},\n  timestamp    = {Mon, 21 Dec 2020 13:23:22 +0100},\n  biburl       = {https://dblp.org/rec/conf/icalp/BarakCL20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Differential Logical Relations Part II: Increments and Derivatives.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n In Gennaro Cordasco, Luisa Gargano, & Adele A. Rescigno., editor(s), Proceedings of the 21st Italian Conference on Theoretical Computer Science, Ischia, Italy, September 14-16, 2020, volume 2756, of CEUR Workshop Proceedings, pages 101–114, 2020. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"DifferentialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ictcs/LagoG20,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  editor       = {Gennaro Cordasco and\n                  Luisa Gargano and\n                  Adele A. Rescigno},\n  title        = {Differential Logical Relations Part {II:} Increments and Derivatives},\n  booktitle    = {Proceedings of the 21st Italian Conference on Theoretical Computer\n                  Science, Ischia, Italy, September 14-16, 2020},\n  series       = {{CEUR} Workshop Proceedings},\n  volume       = {2756},\n  pages        = {101--114},\n  publisher    = {CEUR-WS.org},\n  year         = {2020},\n  url          = {https://ceur-ws.org/Vol-2756/paper\\_10.pdf},\n  timestamp    = {Fri, 10 Mar 2023 16:23:17 +0100},\n  biburl       = {https://dblp.org/rec/conf/ictcs/LagoG20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Machinery of Interaction.\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n In PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, Bologna, Italy, 9-10 September, 2020, pages 4:1–4:15, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ppdp/AccattoliLV20,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {The Machinery of Interaction},\n  booktitle    = {{PPDP} '20: 22nd International Symposium on Principles and Practice\n                  of Declarative Programming, Bologna, Italy, 9-10 September, 2020},\n  pages        = {4:1--4:15},\n  publisher    = {{ACM}},\n  year         = {2020},\n  url          = {https://doi.org/10.1145/3414080.3414108},\n  doi          = {10.1145/3414080.3414108},\n  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ppdp/AccattoliLV20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Diagrammatic Calculus for Algebraic Effects.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n CoRR, abs/2001.01337. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2001-01337,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {A Diagrammatic Calculus for Algebraic Effects},\n  journal      = {CoRR},\n  volume       = {abs/2001.01337},\n  year         = {2020},\n  url          = {http://arxiv.org/abs/2001.01337},\n  eprinttype    = {arXiv},\n  eprint       = {2001.01337},\n  timestamp    = {Fri, 10 Jan 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2001-01337.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Abstract Machinery of Interaction (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, Beniamino Accattoli, & Gabriele Vanoni.\n\n\n \n\n\n\n CoRR, abs/2002.05649. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2002-05649,\n  author       = {Ugo Dal Lago and\n                  Beniamino Accattoli and\n                  Gabriele Vanoni},\n  title        = {The Abstract Machinery of Interaction (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/2002.05649},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2002.05649},\n  eprinttype    = {arXiv},\n  eprint       = {2002.05649},\n  timestamp    = {Fri, 14 Feb 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2002-05649.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Higher-Order Cryptography (Long Version).\n \n \n \n \n\n\n \n Boaz Barak, Raphaëlle Crubillé, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/2002.07218. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2002-07218,\n  author       = {Boaz Barak and\n                  Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago},\n  title        = {On Higher-Order Cryptography (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/2002.07218},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2002.07218},\n  eprinttype    = {arXiv},\n  eprint       = {2002.07218},\n  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2002-07218.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decomposing Probabilistic Lambda-calculi.\n \n \n \n \n\n\n \n Ugo Dal Lago, Giulio Guerrieri, & Willem Heijltjes.\n\n\n \n\n\n\n CoRR, abs/2002.08392. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"DecomposingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2002-08392,\n  author       = {Ugo Dal Lago and\n                  Giulio Guerrieri and\n                  Willem Heijltjes},\n  title        = {Decomposing Probabilistic Lambda-calculi},\n  journal      = {CoRR},\n  volume       = {abs/2002.08392},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2002.08392},\n  eprinttype    = {arXiv},\n  eprint       = {2002.08392},\n  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2002-08392.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem.\n \n \n \n \n\n\n \n Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n CoRR, abs/2002.08489. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2002-08489,\n  author       = {Gilles Barthe and\n                  Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago and\n                  Francesco Gavazzo},\n  title        = {On the Versatility of Open Logical Relations: Continuity, Automatic\n                  Differentiation, and a Containment Theorem},\n  journal      = {CoRR},\n  volume       = {abs/2002.08489},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2002.08489},\n  eprinttype    = {arXiv},\n  eprint       = {2002.08489},\n  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2002-08489.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Intersection Types and (Positive) Almost-Sure Termination.\n \n \n \n \n\n\n \n Ugo Dal Lago, Claudia Faggian, & Simona Ronchi Della Rocca.\n\n\n \n\n\n\n CoRR, abs/2010.12689. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"IntersectionPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2010-12689,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian and\n                  Simona Ronchi Della Rocca},\n  title        = {Intersection Types and (Positive) Almost-Sure Termination},\n  journal      = {CoRR},\n  volume       = {abs/2010.12689},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.12689},\n  eprinttype    = {arXiv},\n  eprint       = {2010.12689},\n  timestamp    = {Mon, 02 Nov 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-12689.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The (In)Efficiency of Interaction.\n \n \n \n \n\n\n \n Beniamino Accattoli, Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n CoRR, abs/2010.12988. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-2010-12988,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {The (In)Efficiency of Interaction},\n  journal      = {CoRR},\n  volume       = {abs/2010.12988},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.12988},\n  eprinttype    = {arXiv},\n  eprint       = {2010.12988},\n  timestamp    = {Mon, 02 Nov 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-12988.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (13)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.\n \n \n \n \n\n\n \n Patrick Baillot, Gilles Barthe, & Ugo Dal Lago.\n\n\n \n\n\n\n J. Autom. Reason., 63(4): 813–855. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ImplicitPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/jar/BaillotBL19,\n  author       = {Patrick Baillot and\n                  Gilles Barthe and\n                  Ugo Dal Lago},\n  title        = {Implicit Computational Complexity of Subrecursive Definitions and\n                  Applications to Cryptographic Proofs},\n  journal      = {J. Autom. Reason.},\n  volume       = {63},\n  number       = {4},\n  pages        = {813--855},\n  year         = {2019},\n  url          = {https://doi.org/10.1007/s10817-019-09530-2},\n  doi          = {10.1007/S10817-019-09530-2},\n  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/jar/BaillotBL19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Intersection types and runtime errors in the pi-calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, Marc Visme, Damiano Mazza, & Akira Yoshimizu.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 3(POPL): 7:1–7:29. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"IntersectionPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/LagoVMY19,\n  author       = {Ugo Dal Lago and\n                  Marc de Visme and\n                  Damiano Mazza and\n                  Akira Yoshimizu},\n  title        = {Intersection types and runtime errors in the pi-calculus},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {3},\n  number       = {{POPL}},\n  pages        = {7:1--7:29},\n  year         = {2019},\n  url          = {https://doi.org/10.1145/3290320},\n  doi          = {10.1145/3290320},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/LagoVMY19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Probabilistic Termination by Monadic Affine Sized Typing.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Charles Grellois.\n\n\n \n\n\n\n ACM Trans. Program. Lang. Syst., 41(2): 10:1–10:65. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/toplas/LagoG19,\n  author       = {Ugo Dal Lago and\n                  Charles Grellois},\n  title        = {Probabilistic Termination by Monadic Affine Sized Typing},\n  journal      = {{ACM} Trans. Program. Lang. Syst.},\n  volume       = {41},\n  number       = {2},\n  pages        = {10:1--10:65},\n  year         = {2019},\n  url          = {https://doi.org/10.1145/3293605},\n  doi          = {10.1145/3293605},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/toplas/LagoG19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Effectful Normal Form Bisimulation.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n In Luís Caires., editor(s), Programming Languages and Systems - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, volume 11423, of Lecture Notes in Computer Science, pages 263–292, 2019. Springer\n \n\n\n\n
\n\n\n\n \n \n \"EffectfulPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esop/LagoG19,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  editor       = {Lu{\\'{\\i}}s Caires},\n  title        = {Effectful Normal Form Bisimulation},\n  booktitle    = {Programming Languages and Systems - 28th European Symposium on Programming,\n                  {ESOP} 2019, Held as Part of the European Joint Conferences on Theory\n                  and Practice of Software, {ETAPS} 2019, Prague, Czech Republic, April\n                  6-11, 2019, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {11423},\n  pages        = {263--292},\n  publisher    = {Springer},\n  year         = {2019},\n  url          = {https://doi.org/10.1007/978-3-030-17184-1\\_10},\n  doi          = {10.1007/978-3-030-17184-1\\_10},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/esop/LagoG19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Differential Logical Relations, Part I: The Simply-Typed Case.\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Akira Yoshimizu.\n\n\n \n\n\n\n In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, & Stefano Leonardi., editor(s), 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, volume 132, of LIPIcs, pages 111:1–111:14, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"DifferentialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icalp/LagoGY19,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Akira Yoshimizu},\n  editor       = {Christel Baier and\n                  Ioannis Chatzigiannakis and\n                  Paola Flocchini and\n                  Stefano Leonardi},\n  title        = {Differential Logical Relations, Part {I:} The Simply-Typed Case},\n  booktitle    = {46th International Colloquium on Automata, Languages, and Programming,\n                  {ICALP} 2019, July 9-12, 2019, Patras, Greece},\n  series       = {LIPIcs},\n  volume       = {132},\n  pages        = {111:1--111:14},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2019},\n  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2019.111},\n  doi          = {10.4230/LIPICS.ICALP.2019.111},\n  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},\n  biburl       = {https://dblp.org/rec/conf/icalp/LagoGY19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Type-Based Complexity Analysis of Probabilistic Functional Programs.\n \n \n \n \n\n\n \n Martin Avanzini, Ugo Dal Lago, & Alexis Ghyselen.\n\n\n \n\n\n\n In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, pages 1–13, 2019. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"Type-BasedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/AvanziniLG19,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago and\n                  Alexis Ghyselen},\n  title        = {Type-Based Complexity Analysis of Probabilistic Functional Programs},\n  booktitle    = {34th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n                  2019, Vancouver, BC, Canada, June 24-27, 2019},\n  pages        = {1--13},\n  publisher    = {{IEEE}},\n  year         = {2019},\n  url          = {https://doi.org/10.1109/LICS.2019.8785725},\n  doi          = {10.1109/LICS.2019.8785725},\n  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/lics/AvanziniLG19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Termination Problem for Probabilistic Higher-Order Recursive Programs.\n \n \n \n \n\n\n \n Naoki Kobayashi, Ugo Dal Lago, & Charles Grellois.\n\n\n \n\n\n\n In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, pages 1–14, 2019. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/KobayashiLG19,\n  author       = {Naoki Kobayashi and\n                  Ugo Dal Lago and\n                  Charles Grellois},\n  title        = {On the Termination Problem for Probabilistic Higher-Order Recursive\n                  Programs},\n  booktitle    = {34th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n                  2019, Vancouver, BC, Canada, June 24-27, 2019},\n  pages        = {1--14},\n  publisher    = {{IEEE}},\n  year         = {2019},\n  url          = {https://doi.org/10.1109/LICS.2019.8785679},\n  doi          = {10.1109/LICS.2019.8785679},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/KobayashiLG19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Geometry of Bayesian Programming.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Naohiko Hoshino.\n\n\n \n\n\n\n In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, pages 1–13, 2019. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/LagoH19,\n  author       = {Ugo Dal Lago and\n                  Naohiko Hoshino},\n  title        = {The Geometry of Bayesian Programming},\n  booktitle    = {34th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n                  2019, Vancouver, BC, Canada, June 24-27, 2019},\n  pages        = {1--13},\n  publisher    = {{IEEE}},\n  year         = {2019},\n  url          = {https://doi.org/10.1109/LICS.2019.8785663},\n  doi          = {10.1109/LICS.2019.8785663},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/LagoH19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Taylor Expansion of Probabilistic lambda-terms.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Thomas Leventis.\n\n\n \n\n\n\n In Herman Geuvers., editor(s), 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany, volume 131, of LIPIcs, pages 13:1–13:16, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/rta/LagoL19,\n  author       = {Ugo Dal Lago and\n                  Thomas Leventis},\n  editor       = {Herman Geuvers},\n  title        = {On the Taylor Expansion of Probabilistic lambda-terms},\n  booktitle    = {4th International Conference on Formal Structures for Computation\n                  and Deduction, {FSCD} 2019, June 24-30, 2019, Dortmund, Germany},\n  series       = {LIPIcs},\n  volume       = {131},\n  pages        = {13:1--13:16},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2019},\n  url          = {https://doi.org/10.4230/LIPIcs.FSCD.2019.13},\n  doi          = {10.4230/LIPICS.FSCD.2019.13},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/rta/LagoL19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Bisimilarity in Lambda Calculi with Continuous Probabilistic Choice.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Francesco Gavazzo.\n\n\n \n\n\n\n In Barbara König., editor(s), Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, MFPS 2019, London, UK, June 4-7, 2019, volume 347, of Electronic Notes in Theoretical Computer Science, pages 121–141, 2019. Elsevier\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:journals/entcs/LagoG19,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo},\n  editor       = {Barbara K{\\"{o}}nig},\n  title        = {On Bisimilarity in Lambda Calculi with Continuous Probabilistic Choice},\n  booktitle    = {Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations\n                  of Programming Semantics, {MFPS} 2019, London, UK, June 4-7, 2019},\n  series       = {Electronic Notes in Theoretical Computer Science},\n  volume       = {347},\n  pages        = {121--141},\n  publisher    = {Elsevier},\n  year         = {2019},\n  url          = {https://doi.org/10.1016/j.entcs.2019.09.007},\n  doi          = {10.1016/J.ENTCS.2019.09.007},\n  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/entcs/LagoG19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Geometry of Bayesian Programming.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Naohiko Hoshino.\n\n\n \n\n\n\n CoRR, abs/1904.07425. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1904-07425,\n  author       = {Ugo Dal Lago and\n                  Naohiko Hoshino},\n  title        = {The Geometry of Bayesian Programming},\n  journal      = {CoRR},\n  volume       = {abs/1904.07425},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1904.07425},\n  eprinttype    = {arXiv},\n  eprint       = {1904.07425},\n  timestamp    = {Thu, 25 Apr 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-07425.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Taylor Expansion of Probabilistic \\(λ\\)-Terms (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Thomas Leventis.\n\n\n \n\n\n\n CoRR, abs/1904.09650. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1904-09650,\n  author       = {Ugo Dal Lago and\n                  Thomas Leventis},\n  title        = {On the Taylor Expansion of Probabilistic {\\(\\lambda\\)}-Terms (Long\n                  Version)},\n  journal      = {CoRR},\n  volume       = {abs/1904.09650},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1904.09650},\n  eprinttype    = {arXiv},\n  eprint       = {1904.09650},\n  timestamp    = {Fri, 26 Apr 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-09650.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Differential Logical Relations, Part I: The Simply-Typed Case (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Akira Yoshimizu.\n\n\n \n\n\n\n CoRR, abs/1904.12137. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"DifferentialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1904-12137,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Akira Yoshimizu},\n  title        = {Differential Logical Relations, Part {I:} The Simply-Typed Case (Long\n                  Version)},\n  journal      = {CoRR},\n  volume       = {abs/1904.12137},\n  year         = {2019},\n  url          = {http://arxiv.org/abs/1904.12137},\n  eprinttype    = {arXiv},\n  eprint       = {1904.12137},\n  timestamp    = {Thu, 02 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-12137.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On sharing, memoization, and polynomial time.\n \n \n \n \n\n\n \n Martin Avanzini, & Ugo Dal Lago.\n\n\n \n\n\n\n Inf. Comput., 261: 3–22. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/iandc/AvanziniL18,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago},\n  title        = {On sharing, memoization, and polynomial time},\n  journal      = {Inf. Comput.},\n  volume       = {261},\n  pages        = {3--22},\n  year         = {2018},\n  url          = {https://doi.org/10.1016/j.ic.2018.05.003},\n  doi          = {10.1016/J.IC.2018.05.003},\n  timestamp    = {Tue, 03 Nov 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/iandc/AvanziniL18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Probabilistic Term Rewriting.\n \n \n \n \n\n\n \n Martin Avanzini, Ugo Dal Lago, & Akihisa Yamada.\n\n\n \n\n\n\n In John P. Gallagher, & Martin Sulzmann., editor(s), Functional and Logic Programming - 14th International Symposium, FLOPS 2018, Nagoya, Japan, May 9-11, 2018, Proceedings, volume 10818, of Lecture Notes in Computer Science, pages 132–148, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/flops/AvanziniL018,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago and\n                  Akihisa Yamada},\n  editor       = {John P. Gallagher and\n                  Martin Sulzmann},\n  title        = {On Probabilistic Term Rewriting},\n  booktitle    = {Functional and Logic Programming - 14th International Symposium, {FLOPS}\n                  2018, Nagoya, Japan, May 9-11, 2018, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10818},\n  pages        = {132--148},\n  publisher    = {Springer},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/978-3-319-90686-7\\_9},\n  doi          = {10.1007/978-3-319-90686-7\\_9},\n  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/flops/AvanziniL018.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Randomised Strategies in the \\(λ\\)-calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n In Alessandro Aldini, & Marco Bernardo., editor(s), Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, September 18-20, 2018, volume 2243, of CEUR Workshop Proceedings, pages 92–103, 2018. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ictcs/LagoV18,\n  author       = {Ugo Dal Lago and\n                  Gabriele Vanoni},\n  editor       = {Alessandro Aldini and\n                  Marco Bernardo},\n  title        = {On Randomised Strategies in the {\\(\\lambda\\)}-calculus},\n  booktitle    = {Proceedings of the 19th Italian Conference on Theoretical Computer\n                  Science, Urbino, Italy, September 18-20, 2018},\n  series       = {{CEUR} Workshop Proceedings},\n  volume       = {2243},\n  pages        = {92--103},\n  publisher    = {CEUR-WS.org},\n  year         = {2018},\n  url          = {https://ceur-ws.org/Vol-2243/paper9.pdf},\n  timestamp    = {Fri, 10 Mar 2023 16:23:17 +0100},\n  biburl       = {https://dblp.org/rec/conf/ictcs/LagoV18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Intersection Types and Probabilistic Lambda Calculi.\n \n \n \n \n\n\n \n Flavien Breuvart, & Ugo Dal Lago.\n\n\n \n\n\n\n In David Sabel, & Peter Thiemann., editor(s), Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, PPDP 2018, Frankfurt am Main, Germany, September 03-05, 2018, pages 8:1–8:13, 2018. ACM\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ppdp/BreuvartL18,\n  author       = {Flavien Breuvart and\n                  Ugo Dal Lago},\n  editor       = {David Sabel and\n                  Peter Thiemann},\n  title        = {On Intersection Types and Probabilistic Lambda Calculi},\n  booktitle    = {Proceedings of the 20th International Symposium on Principles and\n                  Practice of Declarative Programming, {PPDP} 2018, Frankfurt am Main,\n                  Germany, September 03-05, 2018},\n  pages        = {8:1--8:13},\n  publisher    = {{ACM}},\n  year         = {2018},\n  url          = {https://doi.org/10.1145/3236950.3236968},\n  doi          = {10.1145/3236950.3236968},\n  timestamp    = {Mon, 23 Mar 2020 12:22:51 +0100},\n  biburl       = {https://dblp.org/rec/conf/ppdp/BreuvartL18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings.\n \n \n \n \n\n\n \n Christel Baier, & Ugo Dal Lago.,\n editors.\n \n\n\n \n\n\n\n Volume 10803, of Lecture Notes in Computer Science.Springer. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"FoundationsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{DBLP:conf/fossacs/2018,\n  editor       = {Christel Baier and\n                  Ugo Dal Lago},\n  title        = {Foundations of Software Science and Computation Structures - 21st\n                  International Conference, {FOSSACS} 2018, Held as Part of the European\n                  Joint Conferences on Theory and Practice of Software, {ETAPS} 2018,\n                  Thessaloniki, Greece, April 14-20, 2018, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10803},\n  publisher    = {Springer},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/978-3-319-89366-2},\n  doi          = {10.1007/978-3-319-89366-2},\n  isbn         = {978-3-319-89365-5},\n  timestamp    = {Fri, 31 Jan 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/fossacs/2018.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Probabilistic Term Rewriting.\n \n \n \n \n\n\n \n Martin Avanzini, Ugo Dal Lago, & Akihisa Yamada.\n\n\n \n\n\n\n CoRR, abs/1802.09774. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1802-09774,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago and\n                  Akihisa Yamada},\n  title        = {On Probabilistic Term Rewriting},\n  journal      = {CoRR},\n  volume       = {abs/1802.09774},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1802.09774},\n  eprinttype    = {arXiv},\n  eprint       = {1802.09774},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1802-09774.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Randomised Strategies in the \\(λ\\)-Calculus (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Gabriele Vanoni.\n\n\n \n\n\n\n CoRR, abs/1805.03934. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1805-03934,\n  author       = {Ugo Dal Lago and\n                  Gabriele Vanoni},\n  title        = {On Randomised Strategies in the {\\(\\lambda\\)}-Calculus (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1805.03934},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1805.03934},\n  eprinttype    = {arXiv},\n  eprint       = {1805.03934},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-03934.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Termination Problem for Probabilistic Higher-Order Recursive Programs.\n \n \n \n \n\n\n \n Naoki Kobayashi, Ugo Dal Lago, & Charles Grellois.\n\n\n \n\n\n\n CoRR, abs/1811.02133. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1811-02133,\n  author       = {Naoki Kobayashi and\n                  Ugo Dal Lago and\n                  Charles Grellois},\n  title        = {On the Termination Problem for Probabilistic Higher-Order Recursive\n                  Programs},\n  journal      = {CoRR},\n  volume       = {abs/1811.02133},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1811.02133},\n  eprinttype    = {arXiv},\n  eprint       = {1811.02133},\n  timestamp    = {Sun, 29 Sep 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-02133.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (16)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Automating sized-type inference for complexity analysis.\n \n \n \n \n\n\n \n Martin Avanzini, & Ugo Dal Lago.\n\n\n \n\n\n\n Proc. ACM Program. Lang., 1(ICFP): 43:1–43:29. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"AutomatingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/pacmpl/AvanziniL17,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago},\n  title        = {Automating sized-type inference for complexity analysis},\n  journal      = {Proc. {ACM} Program. Lang.},\n  volume       = {1},\n  number       = {{ICFP}},\n  pages        = {43:1--43:29},\n  year         = {2017},\n  url          = {https://doi.org/10.1145/3110287},\n  doi          = {10.1145/3110287},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/pacmpl/AvanziniL17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Metric Reasoning About \\lambda -Terms: The General Case.\n \n \n \n \n\n\n \n Raphaëlle Crubillé, & Ugo Dal Lago.\n\n\n \n\n\n\n In Hongseok Yang., editor(s), Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, volume 10201, of Lecture Notes in Computer Science, pages 341–367, 2017. Springer\n \n\n\n\n
\n\n\n\n \n \n \"MetricPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esop/CrubilleL17,\n  author       = {Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago},\n  editor       = {Hongseok Yang},\n  title        = {Metric Reasoning About {\\textbackslash}lambda -Terms: The General\n                  Case},\n  booktitle    = {Programming Languages and Systems - 26th European Symposium on Programming,\n                  {ESOP} 2017, Held as Part of the European Joint Conferences on Theory\n                  and Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April 22-29,\n                  2017, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10201},\n  pages        = {341--367},\n  publisher    = {Springer},\n  year         = {2017},\n  url          = {https://doi.org/10.1007/978-3-662-54434-1\\_13},\n  doi          = {10.1007/978-3-662-54434-1\\_13},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/esop/CrubilleL17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Probabilistic Termination by Monadic Affine Sized Typing.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Charles Grellois.\n\n\n \n\n\n\n In Hongseok Yang., editor(s), Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, volume 10201, of Lecture Notes in Computer Science, pages 393–419, 2017. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esop/LagoG17,\n  author       = {Ugo Dal Lago and\n                  Charles Grellois},\n  editor       = {Hongseok Yang},\n  title        = {Probabilistic Termination by Monadic Affine Sized Typing},\n  booktitle    = {Programming Languages and Systems - 26th European Symposium on Programming,\n                  {ESOP} 2017, Held as Part of the European Joint Conferences on Theory\n                  and Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April 22-29,\n                  2017, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10201},\n  pages        = {393--419},\n  publisher    = {Springer},\n  year         = {2017},\n  url          = {https://doi.org/10.1007/978-3-662-54434-1\\_15},\n  doi          = {10.1007/978-3-662-54434-1\\_15},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/esop/LagoG17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Higher-Order Probabilistic Subrecursion.\n \n \n \n \n\n\n \n Flavien Breuvart, Ugo Dal Lago, & Agathe Herrou.\n\n\n \n\n\n\n In Javier Esparza, & Andrzej S. Murawski., editor(s), Foundations of Software Science and Computation Structures - 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, volume 10203, of Lecture Notes in Computer Science, pages 370–386, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fossacs/BreuvartLH17,\n  author       = {Flavien Breuvart and\n                  Ugo Dal Lago and\n                  Agathe Herrou},\n  editor       = {Javier Esparza and\n                  Andrzej S. Murawski},\n  title        = {On Higher-Order Probabilistic Subrecursion},\n  booktitle    = {Foundations of Software Science and Computation Structures - 20th\n                  International Conference, {FOSSACS} 2017, Held as Part of the European\n                  Joint Conferences on Theory and Practice of Software, {ETAPS} 2017,\n                  Uppsala, Sweden, April 22-29, 2017, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10203},\n  pages        = {370--386},\n  year         = {2017},\n  url          = {https://doi.org/10.1007/978-3-662-54458-7\\_22},\n  doi          = {10.1007/978-3-662-54458-7\\_22},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/fossacs/BreuvartLH17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Effectful Applicative Similarity for Call-by-Name Lambda Calculi.\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Ryo Tanaka.\n\n\n \n\n\n\n In Dario Della Monica, Aniello Murano, Sasha Rubin, & Luigi Sauro., editor(s), Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), Naples, Italy, September 26-28, 2017, volume 1949, of CEUR Workshop Proceedings, pages 87–98, 2017. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"EffectfulPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ictcs/LagoGT17,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Ryo Tanaka},\n  editor       = {Dario Della Monica and\n                  Aniello Murano and\n                  Sasha Rubin and\n                  Luigi Sauro},\n  title        = {Effectful Applicative Similarity for Call-by-Name Lambda Calculi},\n  booktitle    = {Joint Proceedings of the 18th Italian Conference on Theoretical Computer\n                  Science and the 32nd Italian Conference on Computational Logic co-located\n                  with the 2017 {IEEE} International Workshop on Measurements and Networking\n                  {(2017} {IEEE} M{\\&}N), Naples, Italy, September 26-28, 2017},\n  series       = {{CEUR} Workshop Proceedings},\n  volume       = {1949},\n  pages        = {87--98},\n  publisher    = {CEUR-WS.org},\n  year         = {2017},\n  url          = {https://ceur-ws.org/Vol-1949/ICTCSpaper06.pdf},\n  timestamp    = {Fri, 10 Mar 2023 16:23:17 +0100},\n  biburl       = {https://dblp.org/rec/conf/ictcs/LagoGT17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Effectful applicative bisimilarity: Monads, relators, and Howe's method.\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Paul Blain Levy.\n\n\n \n\n\n\n In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pages 1–12, 2017. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"EffectfulPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/LagoGL17,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Paul Blain Levy},\n  title        = {Effectful applicative bisimilarity: Monads, relators, and Howe's method},\n  booktitle    = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n                  2017, Reykjavik, Iceland, June 20-23, 2017},\n  pages        = {1--12},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2017},\n  url          = {https://doi.org/10.1109/LICS.2017.8005117},\n  doi          = {10.1109/LICS.2017.8005117},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/LagoGL17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens.\n \n \n \n \n\n\n \n Ugo Dal Lago, Ryo Tanaka, & Akira Yoshimizu.\n\n\n \n\n\n\n In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pages 1–12, 2017. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/LagoTY17,\n  author       = {Ugo Dal Lago and\n                  Ryo Tanaka and\n                  Akira Yoshimizu},\n  title        = {The geometry of concurrent interaction: Handling multiple ports by\n                  way of multiple tokens},\n  booktitle    = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n                  2017, Reykjavik, Iceland, June 20-23, 2017},\n  pages        = {1--12},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2017},\n  url          = {https://doi.org/10.1109/LICS.2017.8005112},\n  doi          = {10.1109/LICS.2017.8005112},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/LagoTY17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The geometry of parallelism: classical, probabilistic, and quantum effects.\n \n \n \n \n\n\n \n Ugo Dal Lago, Claudia Faggian, Benoît Valiron, & Akira Yoshimizu.\n\n\n \n\n\n\n In Giuseppe Castagna, & Andrew D. Gordon., editor(s), Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, pages 833–845, 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/popl/LagoFVY17,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian and\n                  Beno{\\^{\\i}}t Valiron and\n                  Akira Yoshimizu},\n  editor       = {Giuseppe Castagna and\n                  Andrew D. Gordon},\n  title        = {The geometry of parallelism: classical, probabilistic, and quantum\n                  effects},\n  booktitle    = {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on Principles of\n                  Programming Languages, {POPL} 2017, Paris, France, January 18-20,\n                  2017},\n  pages        = {833--845},\n  publisher    = {{ACM}},\n  year         = {2017},\n  url          = {https://doi.org/10.1145/3009837.3009859},\n  doi          = {10.1145/3009837.3009859},\n  timestamp    = {Mon, 05 Feb 2024 20:33:37 +0100},\n  biburl       = {https://dblp.org/rec/conf/popl/LagoFVY17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automated Sized-Type Inference and Complexity Analysis.\n \n \n \n \n\n\n \n Martin Avanzini, & Ugo Dal Lago.\n\n\n \n\n\n\n In Guillaume Bonfante, & Georg Moser., editor(s), Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, DICE-FOPARA@ETAPS 2017, Uppsala, Sweden, April 22-23, 2017, volume 248, of EPTCS, pages 7–16, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"AutomatedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:journals/corr/AvanziniL17,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago},\n  editor       = {Guillaume Bonfante and\n                  Georg Moser},\n  title        = {Automated Sized-Type Inference and Complexity Analysis},\n  booktitle    = {Proceedings 8th Workshop on Developments in Implicit Computational\n                  Complexity and 5th Workshop on Foundational and Practical Aspects\n                  of Resource Analysis, DICE-FOPARA@ETAPS 2017, Uppsala, Sweden, April\n                  22-23, 2017},\n  series       = {{EPTCS}},\n  volume       = {248},\n  pages        = {7--16},\n  year         = {2017},\n  url          = {https://doi.org/10.4204/EPTCS.248.5},\n  doi          = {10.4204/EPTCS.248.5},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/AvanziniL17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Probabilistic Termination by Monadic Affine Sized Typing (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Charles Grellois.\n\n\n \n\n\n\n CoRR, abs/1701.04089. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoG17,\n  author       = {Ugo Dal Lago and\n                  Charles Grellois},\n  title        = {Probabilistic Termination by Monadic Affine Sized Typing (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1701.04089},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1701.04089},\n  eprinttype    = {arXiv},\n  eprint       = {1701.04089},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoG17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Higher-Order Probabilistic Subrecursion (Long Version).\n \n \n \n \n\n\n \n Flavien Breuvart, Ugo Dal Lago, & Agathe Herrou.\n\n\n \n\n\n\n CoRR, abs/1701.04786. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/BreuvartLH17,\n  author       = {Flavien Breuvart and\n                  Ugo Dal Lago and\n                  Agathe Herrou},\n  title        = {On Higher-Order Probabilistic Subrecursion (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1701.04786},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1701.04786},\n  eprinttype    = {arXiv},\n  eprint       = {1701.04786},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BreuvartLH17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Metric Reasoning About \\(λ\\)-Terms: The General Case (Long Version).\n \n \n \n \n\n\n \n Raphaëlle Crubillé, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1701.05521. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"MetricPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/CrubilleL17,\n  author       = {Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago},\n  title        = {Metric Reasoning About {\\(\\lambda\\)}-Terms: The General Case (Long\n                  Version)},\n  journal      = {CoRR},\n  volume       = {abs/1701.05521},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1701.05521},\n  eprinttype    = {arXiv},\n  eprint       = {1701.05521},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/CrubilleL17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, Ryo Tanaka, & Akira Yoshimizu.\n\n\n \n\n\n\n CoRR, abs/1704.04620. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoTY17,\n  author       = {Ugo Dal Lago and\n                  Ryo Tanaka and\n                  Akira Yoshimizu},\n  title        = {The Geometry of Concurrent Interaction: Handling Multiple Ports by\n                  Way of Multiple Tokens (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1704.04620},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1704.04620},\n  eprinttype    = {arXiv},\n  eprint       = {1704.04620},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoTY17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, Francesco Gavazzo, & Paul Blain Levy.\n\n\n \n\n\n\n CoRR, abs/1704.04647. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"EffectfulPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoGL17,\n  author       = {Ugo Dal Lago and\n                  Francesco Gavazzo and\n                  Paul Blain Levy},\n  title        = {Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method\n                  (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1704.04647},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1704.04647},\n  eprinttype    = {arXiv},\n  eprint       = {1704.04647},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoGL17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automating Sized Type Inference for Complexity Analysis (Technical Report).\n \n \n \n \n\n\n \n Martin Avanzini, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1706.09169. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"AutomatingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/AvanziniL17a,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago},\n  title        = {Automating Sized Type Inference for Complexity Analysis (Technical\n                  Report)},\n  journal      = {CoRR},\n  volume       = {abs/1706.09169},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1706.09169},\n  eprinttype    = {arXiv},\n  eprint       = {1706.09169},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/AvanziniL17a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Encoding Turing Machines into the Deterministic Lambda-Calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Beniamino Accattoli.\n\n\n \n\n\n\n CoRR, abs/1711.10078. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"EncodingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1711-10078,\n  author       = {Ugo Dal Lago and\n                  Beniamino Accattoli},\n  title        = {Encoding Turing Machines into the Deterministic Lambda-Calculus},\n  journal      = {CoRR},\n  volume       = {abs/1711.10078},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1711.10078},\n  eprinttype    = {arXiv},\n  eprint       = {1711.10078},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1711-10078.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n (Leftmost-Outermost) Beta Reduction is Invariant, Indeed.\n \n \n \n \n\n\n \n Beniamino Accattoli, & Ugo Dal Lago.\n\n\n \n\n\n\n Log. Methods Comput. Sci., 12(1). 2016.\n \n\n\n\n
\n\n\n\n \n \n \"(Leftmost-Outermost)Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/AccattoliL16,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago},\n  title        = {(Leftmost-Outermost) Beta Reduction is Invariant, Indeed},\n  journal      = {Log. Methods Comput. Sci.},\n  volume       = {12},\n  number       = {1},\n  year         = {2016},\n  url          = {https://doi.org/10.2168/LMCS-12(1:4)2016},\n  doi          = {10.2168/LMCS-12(1:4)2016},\n  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/AccattoliL16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Higher-order interpretations and program complexity.\n \n \n \n \n\n\n \n Patrick Baillot, & Ugo Dal Lago.\n\n\n \n\n\n\n Inf. Comput., 248: 56–81. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"Higher-orderPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/iandc/BaillotL16,\n  author       = {Patrick Baillot and\n                  Ugo Dal Lago},\n  title        = {Higher-order interpretations and program complexity},\n  journal      = {Inf. Comput.},\n  volume       = {248},\n  pages        = {56--81},\n  year         = {2016},\n  url          = {https://doi.org/10.1016/j.ic.2015.12.008},\n  doi          = {10.1016/J.IC.2015.12.008},\n  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/iandc/BaillotL16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computation by interaction for space-bounded functional programming.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Ulrich Schöpp.\n\n\n \n\n\n\n Inf. Comput., 248: 150–194. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"ComputationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/iandc/LagoS16,\n  author       = {Ugo Dal Lago and\n                  Ulrich Sch{\\"{o}}pp},\n  title        = {Computation by interaction for space-bounded functional programming},\n  journal      = {Inf. Comput.},\n  volume       = {248},\n  pages        = {150--194},\n  year         = {2016},\n  url          = {https://doi.org/10.1016/j.ic.2015.04.006},\n  doi          = {10.1016/J.IC.2015.04.006},\n  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/iandc/LagoS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Light logics and higher-order processes.\n \n \n \n \n\n\n \n Ugo Dal Lago, Simone Martini, & Davide Sangiorgi.\n\n\n \n\n\n\n Math. Struct. Comput. Sci., 26(6): 969–992. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"LightPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mscs/LagoMS16,\n  author       = {Ugo Dal Lago and\n                  Simone Martini and\n                  Davide Sangiorgi},\n  title        = {Light logics and higher-order processes},\n  journal      = {Math. Struct. Comput. Sci.},\n  volume       = {26},\n  number       = {6},\n  pages        = {969--992},\n  year         = {2016},\n  url          = {https://doi.org/10.1017/S0960129514000310},\n  doi          = {10.1017/S0960129514000310},\n  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/mscs/LagoMS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On session types and polynomial time.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Paolo Di Giamberardino.\n\n\n \n\n\n\n Math. Struct. Comput. Sci., 26(8): 1433–1458. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mscs/LagoG16,\n  author       = {Ugo Dal Lago and\n                  Paolo Di Giamberardino},\n  title        = {On session types and polynomial time},\n  journal      = {Math. Struct. Comput. Sci.},\n  volume       = {26},\n  number       = {8},\n  pages        = {1433--1458},\n  year         = {2016},\n  url          = {https://doi.org/10.1017/S0960129514000632},\n  doi          = {10.1017/S0960129514000632},\n  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/mscs/LagoG16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A lambda-calculus foundation for universal probabilistic programming.\n \n \n \n \n\n\n \n Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, & Marcin Szymczak.\n\n\n \n\n\n\n In Jacques Garrigue, Gabriele Keller, & Eijiro Sumii., editor(s), Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, September 18-22, 2016, pages 33–46, 2016. ACM\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icfp/BorgstromLGS16,\n  author       = {Johannes Borgstr{\\"{o}}m and\n                  Ugo Dal Lago and\n                  Andrew D. Gordon and\n                  Marcin Szymczak},\n  editor       = {Jacques Garrigue and\n                  Gabriele Keller and\n                  Eijiro Sumii},\n  title        = {A lambda-calculus foundation for universal probabilistic programming},\n  booktitle    = {Proceedings of the 21st {ACM} {SIGPLAN} International Conference on\n                  Functional Programming, {ICFP} 2016, Nara, Japan, September 18-22,\n                  2016},\n  pages        = {33--46},\n  publisher    = {{ACM}},\n  year         = {2016},\n  url          = {https://doi.org/10.1145/2951913.2951942},\n  doi          = {10.1145/2951913.2951942},\n  timestamp    = {Mon, 14 Feb 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/icfp/BorgstromLGS16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Infinitary Lambda Calculi from a Linear Perspective.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n In Martin Grohe, Eric Koskinen, & Natarajan Shankar., editor(s), Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, pages 447–456, 2016. ACM\n \n\n\n\n
\n\n\n\n \n \n \"InfinitaryPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/Lago16,\n  author       = {Ugo Dal Lago},\n  editor       = {Martin Grohe and\n                  Eric Koskinen and\n                  Natarajan Shankar},\n  title        = {Infinitary Lambda Calculi from a Linear Perspective},\n  booktitle    = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer\n                  Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},\n  pages        = {447--456},\n  publisher    = {{ACM}},\n  year         = {2016},\n  url          = {https://doi.org/10.1145/2933575.2934505},\n  doi          = {10.1145/2933575.2934505},\n  timestamp    = {Wed, 11 Aug 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/lics/Lago16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Foundational and Practical Aspects of Resource Analysis - 4th International Workshop, FOPARA 2015, London, UK, April 11, 2015, Revised Selected Papers.\n \n \n \n \n\n\n \n Marko C. J. D. Eekelen, & Ugo Dal Lago.,\n editors.\n \n\n\n \n\n\n\n Volume 9964, of Lecture Notes in Computer Science. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"FoundationalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{DBLP:conf/fopara/2015,\n  editor       = {Marko C. J. D. van Eekelen and\n                  Ugo Dal Lago},\n  title        = {Foundational and Practical Aspects of Resource Analysis - 4th International\n                  Workshop, {FOPARA} 2015, London, UK, April 11, 2015, Revised Selected\n                  Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9964},\n  year         = {2016},\n  url          = {https://doi.org/10.1007/978-3-319-46559-3},\n  doi          = {10.1007/978-3-319-46559-3},\n  isbn         = {978-3-319-46558-6},\n  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/fopara/2015.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Infinitary \\(λ\\)-Calculi from a Linear Perspective (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1604.08248. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"InfinitaryPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/Lago16,\n  author       = {Ugo Dal Lago},\n  title        = {Infinitary {\\(\\lambda\\)}-Calculi from a Linear Perspective (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1604.08248},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1604.08248},\n  eprinttype    = {arXiv},\n  eprint       = {1604.08248},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/Lago16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Geometry of Parallelism. Classical, Probabilistic, and Quantum Effects.\n \n \n \n \n\n\n \n Ugo Dal Lago, Claudia Faggian, Benoît Valiron, & Akira Yoshimizu.\n\n\n \n\n\n\n CoRR, abs/1610.09629. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoFVY16,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian and\n                  Beno{\\^{\\i}}t Valiron and\n                  Akira Yoshimizu},\n  title        = {The Geometry of Parallelism. Classical, Probabilistic, and Quantum\n                  Effects},\n  journal      = {CoRR},\n  volume       = {abs/1610.09629},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1610.09629},\n  eprinttype    = {arXiv},\n  eprint       = {1610.09629},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoFVY16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (19)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A higher-order characterization of probabilistic polynomial time.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Paolo Parisen Toldin.\n\n\n \n\n\n\n Inf. Comput., 241: 114–141. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/iandc/LagoT15,\n  author       = {Ugo Dal Lago and\n                  Paolo Parisen Toldin},\n  title        = {A higher-order characterization of probabilistic polynomial time},\n  journal      = {Inf. Comput.},\n  volume       = {241},\n  pages        = {114--141},\n  year         = {2015},\n  url          = {https://doi.org/10.1016/j.ic.2014.10.009},\n  doi          = {10.1016/J.IC.2014.10.009},\n  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/iandc/LagoT15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Developments in Implicit Complexity (DICE 2012).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Guillaume Bonfante.\n\n\n \n\n\n\n Theor. Comput. Sci., 585: 1–2. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"DevelopmentsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoB15,\n  author       = {Ugo Dal Lago and\n                  Guillaume Bonfante},\n  title        = {Developments in Implicit Complexity {(DICE} 2012)},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {585},\n  pages        = {1--2},\n  year         = {2015},\n  url          = {https://doi.org/10.1016/j.tcs.2015.03.001},\n  doi          = {10.1016/J.TCS.2015.03.001},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoB15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Applicative Similarity, Sequentiality, and Full Abstraction.\n \n \n \n \n\n\n \n Raphaëlle Crubillé, Ugo Dal Lago, Davide Sangiorgi, & Valeria Vignudelli.\n\n\n \n\n\n\n In Roland Meyer, André Platzer, & Heike Wehrheim., editor(s), Correct System Design - Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, volume 9360, of Lecture Notes in Computer Science, pages 65–82, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/birthday/CrubilleLSV15,\n  author       = {Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago and\n                  Davide Sangiorgi and\n                  Valeria Vignudelli},\n  editor       = {Roland Meyer and\n                  Andr{\\'{e}} Platzer and\n                  Heike Wehrheim},\n  title        = {On Applicative Similarity, Sequentiality, and Full Abstraction},\n  booktitle    = {Correct System Design - Symposium in Honor of Ernst-R{\\"{u}}diger\n                  Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany,\n                  September 8-9, 2015. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9360},\n  pages        = {65--82},\n  publisher    = {Springer},\n  year         = {2015},\n  url          = {https://doi.org/10.1007/978-3-319-23506-6\\_7},\n  doi          = {10.1007/978-3-319-23506-6\\_7},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/birthday/CrubilleLSV15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Coinduction and Quantum Lambda Calculi.\n \n \n \n \n\n\n \n Yuxin Deng, Yuan Feng, & Ugo Dal Lago.\n\n\n \n\n\n\n In Luca Aceto, & David Frutos-Escrig., editor(s), 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015, volume 42, of LIPIcs, pages 427–440, 2015. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/concur/DengFL15,\n  author       = {Yuxin Deng and\n                  Yuan Feng and\n                  Ugo Dal Lago},\n  editor       = {Luca Aceto and\n                  David de Frutos{-}Escrig},\n  title        = {On Coinduction and Quantum Lambda Calculi},\n  booktitle    = {26th International Conference on Concurrency Theory, {CONCUR} 2015,\n                  Madrid, Spain, September 1.4, 2015},\n  series       = {LIPIcs},\n  volume       = {42},\n  pages        = {427--440},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2015},\n  url          = {https://doi.org/10.4230/LIPIcs.CONCUR.2015.427},\n  doi          = {10.4230/LIPICS.CONCUR.2015.427},\n  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/concur/DengFL15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Equivalences, Metrics, and Polynomial Time.\n \n \n \n \n\n\n \n Alberto Cappai, & Ugo Dal Lago.\n\n\n \n\n\n\n In Adrian Kosowski, & Igor Walukiewicz., editor(s), Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, volume 9210, of Lecture Notes in Computer Science, pages 311–323, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fct/CappaiL15,\n  author       = {Alberto Cappai and\n                  Ugo Dal Lago},\n  editor       = {Adrian Kosowski and\n                  Igor Walukiewicz},\n  title        = {On Equivalences, Metrics, and Polynomial Time},\n  booktitle    = {Fundamentals of Computation Theory - 20th International Symposium,\n                  {FCT} 2015, Gda{\\'{n}}sk, Poland, August 17-19, 2015, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9210},\n  pages        = {311--323},\n  publisher    = {Springer},\n  year         = {2015},\n  url          = {https://doi.org/10.1007/978-3-319-22177-9\\_24},\n  doi          = {10.1007/978-3-319-22177-9\\_24},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/fct/CappaiL15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Applicative Bisimulation and Quantum \\(λ\\)-Calculi.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Alessandro Rioli.\n\n\n \n\n\n\n In Mehdi Dastani, & Marjan Sirjani., editor(s), Fundamentals of Software Engineering - 6th International Conference, FSEN 2015 Tehran, Iran, April 22-24, 2015, Revised Selected Papers, volume 9392, of Lecture Notes in Computer Science, pages 54–68, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ApplicativePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fsen/LagoR15,\n  author       = {Ugo Dal Lago and\n                  Alessandro Rioli},\n  editor       = {Mehdi Dastani and\n                  Marjan Sirjani},\n  title        = {Applicative Bisimulation and Quantum {\\(\\lambda\\)}-Calculi},\n  booktitle    = {Fundamentals of Software Engineering - 6th International Conference,\n                  {FSEN} 2015 Tehran, Iran, April 22-24, 2015, Revised Selected Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9392},\n  pages        = {54--68},\n  publisher    = {Springer},\n  year         = {2015},\n  url          = {https://doi.org/10.1007/978-3-319-24644-4\\_4},\n  doi          = {10.1007/978-3-319-24644-4\\_4},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/fsen/LagoR15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Analysing the complexity of functional programs: higher-order meets first-order.\n \n \n \n \n\n\n \n Martin Avanzini, Ugo Dal Lago, & Georg Moser.\n\n\n \n\n\n\n In Kathleen Fisher, & John H. Reppy., editor(s), Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, ICFP 2015, Vancouver, BC, Canada, September 1-3, 2015, pages 152–164, 2015. ACM\n \n\n\n\n
\n\n\n\n \n \n \"AnalysingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icfp/AvanziniLM15,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago and\n                  Georg Moser},\n  editor       = {Kathleen Fisher and\n                  John H. Reppy},\n  title        = {Analysing the complexity of functional programs: higher-order meets\n                  first-order},\n  booktitle    = {Proceedings of the 20th {ACM} {SIGPLAN} International Conference on\n                  Functional Programming, {ICFP} 2015, Vancouver, BC, Canada, September\n                  1-3, 2015},\n  pages        = {152--164},\n  publisher    = {{ACM}},\n  year         = {2015},\n  url          = {https://doi.org/10.1145/2784731.2784753},\n  doi          = {10.1145/2784731.2784753},\n  timestamp    = {Wed, 23 Jun 2021 16:58:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/icfp/AvanziniLM15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Parallelism and Synchronization in an Infinitary Context.\n \n \n \n \n\n\n \n Ugo Dal Lago, Claudia Faggian, Benoît Valiron, & Akira Yoshimizu.\n\n\n \n\n\n\n In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 559–572, 2015. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"ParallelismPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/LagoFVY15,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian and\n                  Beno{\\^{\\i}}t Valiron and\n                  Akira Yoshimizu},\n  title        = {Parallelism and Synchronization in an Infinitary Context},\n  booktitle    = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n                  2015, Kyoto, Japan, July 6-10, 2015},\n  pages        = {559--572},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2015},\n  url          = {https://doi.org/10.1109/LICS.2015.58},\n  doi          = {10.1109/LICS.2015.58},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/LagoFVY15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Metric Reasoning about \\(λ\\)-Terms: The Affine Case.\n \n \n \n \n\n\n \n Raphaëlle Crubillé, & Ugo Dal Lago.\n\n\n \n\n\n\n In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 633–644, 2015. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"MetricPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/CrubilleL15,\n  author       = {Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago},\n  title        = {Metric Reasoning about {\\(\\lambda\\)}-Terms: The Affine Case},\n  booktitle    = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}\n                  2015, Kyoto, Japan, July 6-10, 2015},\n  pages        = {633--644},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2015},\n  url          = {https://doi.org/10.1109/LICS.2015.64},\n  doi          = {10.1109/LICS.2015.64},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/CrubilleL15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.\n \n \n \n \n\n\n \n Patrick Baillot, Gilles Barthe, & Ugo Dal Lago.\n\n\n \n\n\n\n In Martin Davis, Ansgar Fehnker, Annabelle McIver, & Andrei Voronkov., editor(s), Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings, volume 9450, of Lecture Notes in Computer Science, pages 203–218, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ImplicitPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lpar/BaillotBL15,\n  author       = {Patrick Baillot and\n                  Gilles Barthe and\n                  Ugo Dal Lago},\n  editor       = {Martin Davis and\n                  Ansgar Fehnker and\n                  Annabelle McIver and\n                  Andrei Voronkov},\n  title        = {Implicit Computational Complexity of Subrecursive Definitions and\n                  Applications to Cryptographic Proofs},\n  booktitle    = {Logic for Programming, Artificial Intelligence, and Reasoning - 20th\n                  International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28,\n                  2015, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9450},\n  pages        = {203--218},\n  publisher    = {Springer},\n  year         = {2015},\n  url          = {https://doi.org/10.1007/978-3-662-48899-7\\_15},\n  doi          = {10.1007/978-3-662-48899-7\\_15},\n  timestamp    = {Mon, 03 Jan 2022 22:31:30 +0100},\n  biburl       = {https://dblp.org/rec/conf/lpar/BaillotBL15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Sharing, Memoization, and Polynomial Time.\n \n \n \n \n\n\n \n Martin Avanzini, & Ugo Dal Lago.\n\n\n \n\n\n\n In Ernst W. Mayr, & Nicolas Ollinger., editor(s), 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany, volume 30, of LIPIcs, pages 62–75, 2015. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/stacs/AvanziniL15,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago},\n  editor       = {Ernst W. Mayr and\n                  Nicolas Ollinger},\n  title        = {On Sharing, Memoization, and Polynomial Time},\n  booktitle    = {32nd International Symposium on Theoretical Aspects of Computer Science,\n                  {STACS} 2015, March 4-7, 2015, Garching, Germany},\n  series       = {LIPIcs},\n  volume       = {30},\n  pages        = {62--75},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2015},\n  url          = {https://doi.org/10.4230/LIPIcs.STACS.2015.62},\n  doi          = {10.4230/LIPICS.STACS.2015.62},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/stacs/AvanziniL15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings Tenth International Workshop on Developments in Computational Models, DCM 2014, Vienna, Austria, 13th July 2014.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Russ Harmer.,\n editors.\n \n\n\n \n\n\n\n Volume 179, of EPTCS. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{DBLP:journals/corr/LagoH15,\n  editor       = {Ugo Dal Lago and\n                  Russ Harmer},\n  title        = {Proceedings Tenth International Workshop on Developments in Computational\n                  Models, {DCM} 2014, Vienna, Austria, 13th July 2014},\n  series       = {{EPTCS}},\n  volume       = {179},\n  year         = {2015},\n  url          = {https://doi.org/10.4204/EPTCS.179},\n  doi          = {10.4204/EPTCS.179},\n  timestamp    = {Wed, 12 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoH15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Sharing, Memoization, and Polynomial Time (Long Version).\n \n \n \n \n\n\n \n Martin Avanzini, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1501.00894. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/AvanziniL15,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago},\n  title        = {On Sharing, Memoization, and Polynomial Time (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1501.00894},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1501.00894},\n  eprinttype    = {arXiv},\n  eprint       = {1501.00894},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/AvanziniL15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Parallelism and Synchronization in an Infinitary Context (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, Claudia Faggian, Benoît Valiron, & Akira Yoshimizu.\n\n\n \n\n\n\n CoRR, abs/1505.03635. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"ParallelismPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoFVY15,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian and\n                  Beno{\\^{\\i}}t Valiron and\n                  Akira Yoshimizu},\n  title        = {Parallelism and Synchronization in an Infinitary Context (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1505.03635},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1505.03635},\n  eprinttype    = {arXiv},\n  eprint       = {1505.03635},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoFVY15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Metric Reasoning about \\(λ\\)-Terms: the Affine Case (Long Version).\n \n \n \n \n\n\n \n Raphaëlle Crubillé, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1505.03638. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"MetricPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/CrubilleL15,\n  author       = {Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago},\n  title        = {Metric Reasoning about {\\(\\lambda\\)}-Terms: the Affine Case (Long\n                  Version)},\n  journal      = {CoRR},\n  volume       = {abs/1505.03638},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1505.03638},\n  eprinttype    = {arXiv},\n  eprint       = {1505.03638},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/CrubilleL15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Equivalences, Metrics, and Polynomial Time (Long Version).\n \n \n \n \n\n\n \n Alberto Cappai, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1506.03710. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/CappaiL15,\n  author       = {Alberto Cappai and\n                  Ugo Dal Lago},\n  title        = {On Equivalences, Metrics, and Polynomial Time (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1506.03710},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1506.03710},\n  eprinttype    = {arXiv},\n  eprint       = {1506.03710},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/CappaiL15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version).\n \n \n \n \n\n\n \n Martin Avanzini, Ugo Dal Lago, & Georg Moser.\n\n\n \n\n\n\n CoRR, abs/1506.05043. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"AnalysingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/AvanziniLM15,\n  author       = {Martin Avanzini and\n                  Ugo Dal Lago and\n                  Georg Moser},\n  title        = {Analysing the Complexity of Functional Programs: Higher-Order Meets\n                  First-Order (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1506.05043},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1506.05043},\n  eprinttype    = {arXiv},\n  eprint       = {1506.05043},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/AvanziniLM15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Applicative Bisimulation and Quantum \\(λ\\)-Calculi (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Alessandro Rioli.\n\n\n \n\n\n\n CoRR, abs/1506.06661. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"ApplicativePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoR15,\n  author       = {Ugo Dal Lago and\n                  Alessandro Rioli},\n  title        = {Applicative Bisimulation and Quantum {\\(\\lambda\\)}-Calculi (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1506.06661},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1506.06661},\n  eprinttype    = {arXiv},\n  eprint       = {1506.06661},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoR15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Lambda-Calculus Foundation for Universal Probabilistic Programming.\n \n \n \n \n\n\n \n Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, & Marcin Szymczak.\n\n\n \n\n\n\n CoRR, abs/1512.08990. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/BorgstromLGS15,\n  author       = {Johannes Borgstr{\\"{o}}m and\n                  Ugo Dal Lago and\n                  Andrew D. Gordon and\n                  Marcin Szymczak},\n  title        = {A Lambda-Calculus Foundation for Universal Probabilistic Programming},\n  journal      = {CoRR},\n  volume       = {abs/1512.08990},\n  year         = {2015},\n  url          = {http://arxiv.org/abs/1512.08990},\n  eprinttype    = {arXiv},\n  eprint       = {1512.08990},\n  timestamp    = {Mon, 14 Feb 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/BorgstromLGS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (14)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Probabilistic Recursion Theory and Implicit Computational Complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago, Sara Zuppiroli, & Maurizio Gabbrielli.\n\n\n \n\n\n\n Sci. Ann. Comput. Sci., 24(2): 177–216. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/cuza/LagoZG14,\n  author       = {Ugo Dal Lago and\n                  Sara Zuppiroli and\n                  Maurizio Gabbrielli},\n  title        = {Probabilistic Recursion Theory and Implicit Computational Complexity},\n  journal      = {Sci. Ann. Comput. Sci.},\n  volume       = {24},\n  number       = {2},\n  pages        = {177--216},\n  year         = {2014},\n  url          = {https://doi.org/10.7561/SACS.2014.2.177},\n  doi          = {10.7561/SACS.2014.2.177},\n  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/cuza/LagoZG14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Linear dependent types in a call-by-value scenario.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Barbara Petit.\n\n\n \n\n\n\n Sci. Comput. Program., 84: 77–100. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"LinearPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/scp/LagoP14,\n  author       = {Ugo Dal Lago and\n                  Barbara Petit},\n  title        = {Linear dependent types in a call-by-value scenario},\n  journal      = {Sci. Comput. Program.},\n  volume       = {84},\n  pages        = {77--100},\n  year         = {2014},\n  url          = {https://doi.org/10.1016/j.scico.2013.07.010},\n  doi          = {10.1016/J.SCICO.2013.07.010},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/scp/LagoP14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Beta reduction is invariant, indeed.\n \n \n \n \n\n\n \n Beniamino Accattoli, & Ugo Dal Lago.\n\n\n \n\n\n\n In Thomas A. Henzinger, & Dale Miller., editor(s), Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, pages 8:1–8:10, 2014. ACM\n \n\n\n\n
\n\n\n\n \n \n \"BetaPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/csl/AccattoliL14,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago},\n  editor       = {Thomas A. Henzinger and\n                  Dale Miller},\n  title        = {Beta reduction is invariant, indeed},\n  booktitle    = {Joint Meeting of the Twenty-Third {EACSL} Annual Conference on Computer\n                  Science Logic {(CSL)} and the Twenty-Ninth Annual {ACM/IEEE} Symposium\n                  on Logic in Computer Science (LICS), {CSL-LICS} '14, Vienna, Austria,\n                  July 14 - 18, 2014},\n  pages        = {8:1--8:10},\n  publisher    = {{ACM}},\n  year         = {2014},\n  url          = {https://doi.org/10.1145/2603088.2603105},\n  doi          = {10.1145/2603088.2603105},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/csl/AccattoliL14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The geometry of synchronization.\n \n \n \n \n\n\n \n Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, & Akira Yoshimizu.\n\n\n \n\n\n\n In Thomas A. Henzinger, & Dale Miller., editor(s), Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, pages 35:1–35:10, 2014. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/csl/LagoFHY14,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian and\n                  Ichiro Hasuo and\n                  Akira Yoshimizu},\n  editor       = {Thomas A. Henzinger and\n                  Dale Miller},\n  title        = {The geometry of synchronization},\n  booktitle    = {Joint Meeting of the Twenty-Third {EACSL} Annual Conference on Computer\n                  Science Logic {(CSL)} and the Twenty-Ninth Annual {ACM/IEEE} Symposium\n                  on Logic in Computer Science (LICS), {CSL-LICS} '14, Vienna, Austria,\n                  July 14 - 18, 2014},\n  pages        = {35:1--35:10},\n  publisher    = {{ACM}},\n  year         = {2014},\n  url          = {https://doi.org/10.1145/2603088.2603154},\n  doi          = {10.1145/2603088.2603154},\n  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/csl/LagoFHY14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Probabilistic Applicative Bisimulation and Call-by-Value \\(λ\\)-Calculi.\n \n \n \n \n\n\n \n Raphaëlle Crubillé, & Ugo Dal Lago.\n\n\n \n\n\n\n In Zhong Shao., editor(s), Programming Languages and Systems - 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, volume 8410, of Lecture Notes in Computer Science, pages 209–228, 2014. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esop/CrubilleL14,\n  author       = {Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago},\n  editor       = {Zhong Shao},\n  title        = {On Probabilistic Applicative Bisimulation and Call-by-Value {\\(\\lambda\\)}-Calculi},\n  booktitle    = {Programming Languages and Systems - 23rd European Symposium on Programming,\n                  {ESOP} 2014, Held as Part of the European Joint Conferences on Theory\n                  and Practice of Software, {ETAPS} 2014, Grenoble, France, April 5-13,\n                  2014, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {8410},\n  pages        = {209--228},\n  publisher    = {Springer},\n  year         = {2014},\n  url          = {https://doi.org/10.1007/978-3-642-54833-8\\_12},\n  doi          = {10.1007/978-3-642-54833-8\\_12},\n  timestamp    = {Thu, 14 Oct 2021 10:31:33 +0200},\n  biburl       = {https://dblp.org/rec/conf/esop/CrubilleL14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Measurements in Proof Nets as Higher-Order Quantum Circuits.\n \n \n \n \n\n\n \n Akira Yoshimizu, Ichiro Hasuo, Claudia Faggian, & Ugo Dal Lago.\n\n\n \n\n\n\n In Zhong Shao., editor(s), Programming Languages and Systems - 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, volume 8410, of Lecture Notes in Computer Science, pages 371–391, 2014. Springer\n \n\n\n\n
\n\n\n\n \n \n \"MeasurementsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esop/YoshimizuHFL14,\n  author       = {Akira Yoshimizu and\n                  Ichiro Hasuo and\n                  Claudia Faggian and\n                  Ugo Dal Lago},\n  editor       = {Zhong Shao},\n  title        = {Measurements in Proof Nets as Higher-Order Quantum Circuits},\n  booktitle    = {Programming Languages and Systems - 23rd European Symposium on Programming,\n                  {ESOP} 2014, Held as Part of the European Joint Conferences on Theory\n                  and Practice of Software, {ETAPS} 2014, Grenoble, France, April 5-13,\n                  2014, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {8410},\n  pages        = {371--391},\n  publisher    = {Springer},\n  year         = {2014},\n  url          = {https://doi.org/10.1007/978-3-642-54833-8\\_20},\n  doi          = {10.1007/978-3-642-54833-8\\_20},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/esop/YoshimizuHFL14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Probabilistic Recursion Theory and Implicit Computational Complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Sara Zuppiroli.\n\n\n \n\n\n\n In Gabriel Ciobanu, & Dominique Méry., editor(s), Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014. Proceedings, volume 8687, of Lecture Notes in Computer Science, pages 97–114, 2014. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ictac/LagoZ14,\n  author       = {Ugo Dal Lago and\n                  Sara Zuppiroli},\n  editor       = {Gabriel Ciobanu and\n                  Dominique M{\\'{e}}ry},\n  title        = {Probabilistic Recursion Theory and Implicit Computational Complexity},\n  booktitle    = {Theoretical Aspects of Computing - {ICTAC} 2014 - 11th International\n                  Colloquium, Bucharest, Romania, September 17-19, 2014. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {8687},\n  pages        = {97--114},\n  publisher    = {Springer},\n  year         = {2014},\n  url          = {https://doi.org/10.1007/978-3-319-10882-7\\_7},\n  doi          = {10.1007/978-3-319-10882-7\\_7},\n  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},\n  biburl       = {https://dblp.org/rec/conf/ictac/LagoZ14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On coinductive equivalences for higher-order probabilistic functional programs.\n \n \n \n \n\n\n \n Ugo Dal Lago, Davide Sangiorgi, & Michele Alberti.\n\n\n \n\n\n\n In Suresh Jagannathan, & Peter Sewell., editor(s), The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014, pages 297–308, 2014. ACM\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/popl/LagoSA14,\n  author       = {Ugo Dal Lago and\n                  Davide Sangiorgi and\n                  Michele Alberti},\n  editor       = {Suresh Jagannathan and\n                  Peter Sewell},\n  title        = {On coinductive equivalences for higher-order probabilistic functional\n                  programs},\n  booktitle    = {The 41st Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of\n                  Programming Languages, {POPL} '14, San Diego, CA, USA, January 20-21,\n                  2014},\n  pages        = {297--308},\n  publisher    = {{ACM}},\n  year         = {2014},\n  url          = {https://doi.org/10.1145/2535838.2535872},\n  doi          = {10.1145/2535838.2535872},\n  timestamp    = {Thu, 24 Jun 2021 16:19:31 +0200},\n  biburl       = {https://dblp.org/rec/conf/popl/LagoSA14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Wave-Style Token Machines and Quantum Lambda Calculi.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Margherita Zorzi.\n\n\n \n\n\n\n In Sandra Alves, & Iliano Cervesato., editor(s), Proceedings Third International Workshop on Linearity, LINEARITY 2014, Vienna, Austria, 13th July, 2014, volume 176, of EPTCS, pages 64–78, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"Wave-StylePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:journals/corr/LagoZ15,\n  author       = {Ugo Dal Lago and\n                  Margherita Zorzi},\n  editor       = {Sandra Alves and\n                  Iliano Cervesato},\n  title        = {Wave-Style Token Machines and Quantum Lambda Calculi},\n  booktitle    = {Proceedings Third International Workshop on Linearity, {LINEARITY}\n                  2014, Vienna, Austria, 13th July, 2014},\n  series       = {{EPTCS}},\n  volume       = {176},\n  pages        = {64--78},\n  year         = {2014},\n  url          = {https://doi.org/10.4204/EPTCS.176.6},\n  doi          = {10.4204/EPTCS.176.6},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoZ15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Foundational and Practical Aspects of Resource Analysis - Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Ricardo Peña.,\n editors.\n \n\n\n \n\n\n\n Volume 8552, of Lecture Notes in Computer Science.Springer. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"FoundationalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{DBLP:conf/fopara/2013,\n  editor       = {Ugo Dal Lago and\n                  Ricardo Pe{\\~{n}}a},\n  title        = {Foundational and Practical Aspects of Resource Analysis - Third International\n                  Workshop, {FOPARA} 2013, Bertinoro, Italy, August 29-31, 2013, Revised\n                  Selected Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {8552},\n  publisher    = {Springer},\n  year         = {2014},\n  url          = {https://doi.org/10.1007/978-3-319-12466-7},\n  doi          = {10.1007/978-3-319-12466-7},\n  isbn         = {978-3-319-12465-0},\n  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/fopara/2013.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Probabilistic Applicative Bisimulation and Call-by-Value \\(λ\\)-Calculi (Long Version).\n \n \n \n \n\n\n \n Raphaëlle Crubillé, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1401.3766. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/CrubilleL14,\n  author       = {Rapha{\\"{e}}lle Crubill{\\'{e}} and\n                  Ugo Dal Lago},\n  title        = {On Probabilistic Applicative Bisimulation and Call-by-Value {\\(\\lambda\\)}-Calculi\n                  (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1401.3766},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1401.3766},\n  eprinttype    = {arXiv},\n  eprint       = {1401.3766},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/CrubilleL14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Beta Reduction is Invariant, Indeed (Long Version).\n \n \n \n \n\n\n \n Beniamino Accattoli, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1405.3311. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"BetaPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/AccattoliL14,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago},\n  title        = {Beta Reduction is Invariant, Indeed (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1405.3311},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1405.3311},\n  eprinttype    = {arXiv},\n  eprint       = {1405.3311},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/AccattoliL14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Geometry of Synchronization (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, & Akira Yoshimizu.\n\n\n \n\n\n\n CoRR, abs/1405.3427. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoFHY14,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian and\n                  Ichiro Hasuo and\n                  Akira Yoshimizu},\n  title        = {The Geometry of Synchronization (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1405.3427},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1405.3427},\n  eprinttype    = {arXiv},\n  eprint       = {1405.3427},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoFHY14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Probabilistic Recursion Theory and Implicit Computational Complexity (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Sara Zuppiroli.\n\n\n \n\n\n\n CoRR, abs/1406.3378. 2014.\n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoZ14,\n  author       = {Ugo Dal Lago and\n                  Sara Zuppiroli},\n  title        = {Probabilistic Recursion Theory and Implicit Computational Complexity\n                  (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1406.3378},\n  year         = {2014},\n  url          = {http://arxiv.org/abs/1406.3378},\n  eprinttype    = {arXiv},\n  eprint       = {1406.3378},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoZ14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Complexity Analysis in Presence of Control Operators and Higher-Order Functions.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Giulio Pellitta.\n\n\n \n\n\n\n In Kenneth L. McMillan, Aart Middeldorp, & Andrei Voronkov., editor(s), Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings, volume 8312, of Lecture Notes in Computer Science, pages 258–273, 2013. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ComplexityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lpar/LagoP13,\n  author       = {Ugo Dal Lago and\n                  Giulio Pellitta},\n  editor       = {Kenneth L. McMillan and\n                  Aart Middeldorp and\n                  Andrei Voronkov},\n  title        = {Complexity Analysis in Presence of Control Operators and Higher-Order\n                  Functions},\n  booktitle    = {Logic for Programming, Artificial Intelligence, and Reasoning - 19th\n                  International Conference, LPAR-19, Stellenbosch, South Africa, December\n                  14-19, 2013. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {8312},\n  pages        = {258--273},\n  publisher    = {Springer},\n  year         = {2013},\n  url          = {https://doi.org/10.1007/978-3-642-45221-5\\_19},\n  doi          = {10.1007/978-3-642-45221-5\\_19},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lpar/LagoP13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The geometry of types.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Barbara Petit.\n\n\n \n\n\n\n In Roberto Giacobazzi, & Radhia Cousot., editor(s), The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '13, Rome, Italy - January 23 - 25, 2013, pages 167–178, 2013. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/popl/LagoP13,\n  author       = {Ugo Dal Lago and\n                  Barbara Petit},\n  editor       = {Roberto Giacobazzi and\n                  Radhia Cousot},\n  title        = {The geometry of types},\n  booktitle    = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of\n                  Programming Languages, {POPL} '13, Rome, Italy - January 23 - 25,\n                  2013},\n  pages        = {167--178},\n  publisher    = {{ACM}},\n  year         = {2013},\n  url          = {https://doi.org/10.1145/2429069.2429090},\n  doi          = {10.1145/2429069.2429090},\n  timestamp    = {Thu, 24 Jun 2021 16:19:31 +0200},\n  biburl       = {https://dblp.org/rec/conf/popl/LagoP13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Wave-Style Token Machines and Quantum Lambda Calculi.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Margherita Zorzi.\n\n\n \n\n\n\n CoRR, abs/1307.0550. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"Wave-StylePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoZ13,\n  author       = {Ugo Dal Lago and\n                  Margherita Zorzi},\n  title        = {Wave-Style Token Machines and Quantum Lambda Calculi},\n  journal      = {CoRR},\n  volume       = {abs/1307.0550},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1307.0550},\n  eprinttype    = {arXiv},\n  eprint       = {1307.0550},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoZ13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Complexity Analysis in Presence of Control Operators and Higher-Order Functions (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Giulio Pellitta.\n\n\n \n\n\n\n CoRR, abs/1310.1763. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"ComplexityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoP13,\n  author       = {Ugo Dal Lago and\n                  Giulio Pellitta},\n  title        = {Complexity Analysis in Presence of Control Operators and Higher-Order\n                  Functions (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1310.1763},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1310.1763},\n  eprinttype    = {arXiv},\n  eprint       = {1310.1763},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoP13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Coinductive Equivalences for Higher-Order Probabilistic Functional Programs (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, Davide Sangiorgi, & Michele Alberti.\n\n\n \n\n\n\n CoRR, abs/1311.1722. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/LagoSA13,\n  author       = {Ugo Dal Lago and\n                  Davide Sangiorgi and\n                  Michele Alberti},\n  title        = {On Coinductive Equivalences for Higher-Order Probabilistic Functional\n                  Programs (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1311.1722},\n  year         = {2013},\n  url          = {http://arxiv.org/abs/1311.1722},\n  eprinttype    = {arXiv},\n  eprint       = {1311.1722},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/LagoSA13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (11)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On Constructor Rewrite Systems and the Lambda Calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Simone Martini.\n\n\n \n\n\n\n Log. Methods Comput. Sci., 8(3). 2012.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1208-0515,\n  author       = {Ugo Dal Lago and\n                  Simone Martini},\n  title        = {On Constructor Rewrite Systems and the Lambda Calculus},\n  journal      = {Log. Methods Comput. Sci.},\n  volume       = {8},\n  number       = {3},\n  year         = {2012},\n  url          = {https://doi.org/10.2168/LMCS-8(3:12)2012},\n  doi          = {10.2168/LMCS-8(3:12)2012},\n  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1208-0515.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Probabilistic operational semantics for the lambda calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Margherita Zorzi.\n\n\n \n\n\n\n RAIRO Theor. Informatics Appl., 46(3): 413–450. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/ita/LagoZ12,\n  author       = {Ugo Dal Lago and\n                  Margherita Zorzi},\n  title        = {Probabilistic operational semantics for the lambda calculus},\n  journal      = {{RAIRO} Theor. Informatics Appl.},\n  volume       = {46},\n  number       = {3},\n  pages        = {413--450},\n  year         = {2012},\n  url          = {https://doi.org/10.1051/ita/2012012},\n  doi          = {10.1051/ITA/2012012},\n  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/ita/LagoZ12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On quasi-interpretations, blind abstractions and implicit complexity.\n \n \n \n \n\n\n \n Patrick Baillot, Ugo Dal Lago, & Jean-Yves Moyen.\n\n\n \n\n\n\n Math. Struct. Comput. Sci., 22(4): 549–580. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mscs/BaillotLM12,\n  author       = {Patrick Baillot and\n                  Ugo Dal Lago and\n                  Jean{-}Yves Moyen},\n  title        = {On quasi-interpretations, blind abstractions and implicit complexity},\n  journal      = {Math. Struct. Comput. Sci.},\n  volume       = {22},\n  number       = {4},\n  pages        = {549--580},\n  year         = {2012},\n  url          = {https://doi.org/10.1017/S0960129511000685},\n  doi          = {10.1017/S0960129511000685},\n  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/mscs/BaillotLM12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Higher-Order Interpretations and Program Complexity.\n \n \n \n \n\n\n \n Patrick Baillot, & Ugo Dal Lago.\n\n\n \n\n\n\n In Patrick Cégielski, & Arnaud Durand., editor(s), Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, volume 16, of LIPIcs, pages 62–76, 2012. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"Higher-OrderPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/csl/BaillotL12,\n  author       = {Patrick Baillot and\n                  Ugo Dal Lago},\n  editor       = {Patrick C{\\'{e}}gielski and\n                  Arnaud Durand},\n  title        = {Higher-Order Interpretations and Program Complexity},\n  booktitle    = {Computer Science Logic (CSL'12) - 26th International Workshop/21st\n                  Annual Conference of the EACSL, {CSL} 2012, September 3-6, 2012, Fontainebleau,\n                  France},\n  series       = {LIPIcs},\n  volume       = {16},\n  pages        = {62--76},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2012},\n  url          = {https://doi.org/10.4230/LIPIcs.CSL.2012.62},\n  doi          = {10.4230/LIPICS.CSL.2012.62},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/csl/BaillotL12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Linear dependent types in a call-by-value scenario.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Barbara Petit.\n\n\n \n\n\n\n In Danny De Schreye, Gerda Janssens, & Andy King., editor(s), Principles and Practice of Declarative Programming, PPDP'12, Leuven, Belgium - September 19 - 21, 2012, pages 115–126, 2012. ACM\n \n\n\n\n
\n\n\n\n \n \n \"LinearPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ppdp/LagoP12,\n  author       = {Ugo Dal Lago and\n                  Barbara Petit},\n  editor       = {Danny De Schreye and\n                  Gerda Janssens and\n                  Andy King},\n  title        = {Linear dependent types in a call-by-value scenario},\n  booktitle    = {Principles and Practice of Declarative Programming, PPDP'12, Leuven,\n                  Belgium - September 19 - 21, 2012},\n  pages        = {115--126},\n  publisher    = {{ACM}},\n  year         = {2012},\n  url          = {https://doi.org/10.1145/2370776.2370792},\n  doi          = {10.1145/2370776.2370792},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/ppdp/LagoP12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Invariance of the Unitary Cost Model for Head Reduction.\n \n \n \n \n\n\n \n Beniamino Accattoli, & Ugo Dal Lago.\n\n\n \n\n\n\n In Ashish Tiwari., editor(s), 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan, volume 15, of LIPIcs, pages 22–37, 2012. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/rta/AccattoliL12,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago},\n  editor       = {Ashish Tiwari},\n  title        = {On the Invariance of the Unitary Cost Model for Head Reduction},\n  booktitle    = {23rd International Conference on Rewriting Techniques and Applications\n                  (RTA'12) , {RTA} 2012, May 28 - June 2, 2012, Nagoya, Japan},\n  series       = {LIPIcs},\n  volume       = {15},\n  pages        = {22--37},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2012},\n  url          = {https://doi.org/10.4230/LIPIcs.RTA.2012.22},\n  doi          = {10.4230/LIPICS.RTA.2012.22},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/rta/AccattoliL12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Invariance of the Unitary Cost Model for Head Reduction (Long Version).\n \n \n \n \n\n\n \n Beniamino Accattoli, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/1202.1641. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1202-1641,\n  author       = {Beniamino Accattoli and\n                  Ugo Dal Lago},\n  title        = {On the Invariance of the Unitary Cost Model for Head Reduction (Long\n                  Version)},\n  journal      = {CoRR},\n  volume       = {abs/1202.1641},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1202.1641},\n  eprinttype    = {arXiv},\n  eprint       = {1202.1641},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-1641.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Higher-Order Characterization of Probabilistic Polynomial Time (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Paolo Parisen Toldin.\n\n\n \n\n\n\n CoRR, abs/1202.3317. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1202-3317,\n  author       = {Ugo Dal Lago and\n                  Paolo Parisen Toldin},\n  title        = {An Higher-Order Characterization of Probabilistic Polynomial Time\n                  (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1202.3317},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1202.3317},\n  eprinttype    = {arXiv},\n  eprint       = {1202.3317},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-3317.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Linear Dependent Types in a Call-by-Value Scenario (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Barbara Petit.\n\n\n \n\n\n\n CoRR, abs/1207.5592. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"LinearPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1207-5592,\n  author       = {Ugo Dal Lago and\n                  Barbara Petit},\n  title        = {Linear Dependent Types in a Call-by-Value Scenario (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1207.5592},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1207.5592},\n  eprinttype    = {arXiv},\n  eprint       = {1207.5592},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-5592.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Computational Complexity of Interactive Behaviors.\n \n \n \n \n\n\n \n Ugo Dal Lago, Tobias Heindel, Damiano Mazza, & Daniele Varacca.\n\n\n \n\n\n\n CoRR, abs/1209.0663. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ComputationalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1209-0663,\n  author       = {Ugo Dal Lago and\n                  Tobias Heindel and\n                  Damiano Mazza and\n                  Daniele Varacca},\n  title        = {Computational Complexity of Interactive Behaviors},\n  journal      = {CoRR},\n  volume       = {abs/1209.0663},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1209.0663},\n  eprinttype    = {arXiv},\n  eprint       = {1209.0663},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1209-0663.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Geometry of Types (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Barbara Petit.\n\n\n \n\n\n\n CoRR, abs/1210.6857. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1210-6857,\n  author       = {Ugo Dal Lago and\n                  Barbara Petit},\n  title        = {The Geometry of Types (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1210.6857},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1210.6857},\n  eprinttype    = {arXiv},\n  eprint       = {1210.6857},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1210-6857.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Linear Dependent Types and Relative Completeness.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Marco Gaboardi.\n\n\n \n\n\n\n Log. Methods Comput. Sci., 8(4). 2011.\n \n\n\n\n
\n\n\n\n \n \n \"LinearPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1104-0193,\n  author       = {Ugo Dal Lago and\n                  Marco Gaboardi},\n  title        = {Linear Dependent Types and Relative Completeness},\n  journal      = {Log. Methods Comput. Sci.},\n  volume       = {8},\n  number       = {4},\n  year         = {2011},\n  url          = {https://doi.org/10.2168/LMCS-8(4:11)2012},\n  doi          = {10.2168/LMCS-8(4:11)2012},\n  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-0193.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Light logics and optimal reduction: Completeness and complexity.\n \n \n \n \n\n\n \n Patrick Baillot, Paolo Coppola, & Ugo Dal Lago.\n\n\n \n\n\n\n Inf. Comput., 209(2): 118–142. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"LightPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/iandc/BaillotCL11,\n  author       = {Patrick Baillot and\n                  Paolo Coppola and\n                  Ugo Dal Lago},\n  title        = {Light logics and optimal reduction: Completeness and complexity},\n  journal      = {Inf. Comput.},\n  volume       = {209},\n  number       = {2},\n  pages        = {118--142},\n  year         = {2011},\n  url          = {https://doi.org/10.1016/j.ic.2010.10.002},\n  doi          = {10.1016/J.IC.2010.10.002},\n  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/iandc/BaillotCL11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Realizability models and implicit complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Martin Hofmann.\n\n\n \n\n\n\n Theor. Comput. Sci., 412(20): 2029–2047. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"RealizabilityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoH11,\n  author       = {Ugo Dal Lago and\n                  Martin Hofmann},\n  title        = {Realizability models and implicit complexity},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {412},\n  number       = {20},\n  pages        = {2029--2047},\n  year         = {2011},\n  url          = {https://doi.org/10.1016/j.tcs.2010.12.025},\n  doi          = {10.1016/J.TCS.2010.12.025},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoH11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Short Introduction to Implicit Computational Complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n In Nick Bezhanishvili, & Valentin Goranko., editor(s), Lectures on Logic and Computation - ESSLLI 2010 Copenhagen, Denmark, August 2010, ESSLLI 2011, Ljubljana, Slovenia, August 2011, Selected Lecture Notes, volume 7388, of Lecture Notes in Computer Science, pages 89–109, 2011. Springer\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esslli/Lago11,\n  author       = {Ugo Dal Lago},\n  editor       = {Nick Bezhanishvili and\n                  Valentin Goranko},\n  title        = {A Short Introduction to Implicit Computational Complexity},\n  booktitle    = {Lectures on Logic and Computation - {ESSLLI} 2010 Copenhagen, Denmark,\n                  August 2010, {ESSLLI} 2011, Ljubljana, Slovenia, August 2011, Selected\n                  Lecture Notes},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7388},\n  pages        = {89--109},\n  publisher    = {Springer},\n  year         = {2011},\n  url          = {https://doi.org/10.1007/978-3-642-31485-8\\_3},\n  doi          = {10.1007/978-3-642-31485-8\\_3},\n  timestamp    = {Mon, 01 May 2023 13:01:40 +0200},\n  biburl       = {https://dblp.org/rec/conf/esslli/Lago11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Higher-Order Characterization of Probabilistic Polynomial Time.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Paolo Parisen Toldin.\n\n\n \n\n\n\n In Ricardo Peña, Marko C. J. D. Eekelen, & Olha Shkaravska., editor(s), Foundational and Practical Aspects of Resource Analysis - Second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised Selected Papers, volume 7177, of Lecture Notes in Computer Science, pages 1–18, 2011. Springer\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fopara/LagoT11,\n  author       = {Ugo Dal Lago and\n                  Paolo Parisen Toldin},\n  editor       = {Ricardo Pe{\\~{n}}a and\n                  Marko C. J. D. van Eekelen and\n                  Olha Shkaravska},\n  title        = {A Higher-Order Characterization of Probabilistic Polynomial Time},\n  booktitle    = {Foundational and Practical Aspects of Resource Analysis - Second International\n                  Workshop, {FOPARA} 2011, Madrid, Spain, May 19, 2011, Revised Selected\n                  Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7177},\n  pages        = {1--18},\n  publisher    = {Springer},\n  year         = {2011},\n  url          = {https://doi.org/10.1007/978-3-642-32495-6\\_1},\n  doi          = {10.1007/978-3-642-32495-6\\_1},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/fopara/LagoT11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Linear Dependent Types and Relative Completeness.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Marco Gaboardi.\n\n\n \n\n\n\n In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada, pages 133–142, 2011. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"LinearPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/LagoG11,\n  author       = {Ugo Dal Lago and\n                  Marco Gaboardi},\n  title        = {Linear Dependent Types and Relative Completeness},\n  booktitle    = {Proceedings of the 26th Annual {IEEE} Symposium on Logic in Computer\n                  Science, {LICS} 2011, June 21-24, 2011, Toronto, Ontario, Canada},\n  pages        = {133--142},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2011},\n  url          = {https://doi.org/10.1109/LICS.2011.22},\n  doi          = {10.1109/LICS.2011.22},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/LagoG11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Multiplicative Linear Logic, Modality and Quantum Circuits.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Claudia Faggian.\n\n\n \n\n\n\n In Bart Jacobs, Peter Selinger, & Bas Spitters., editor(s), Proceedings 8th International Workshop on Quantum Physics and Logic, QPL 2011, Nijmegen, Netherlands, October 27-29, 2011, volume 95, of EPTCS, pages 55–66, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:journals/corr/abs-1210-0613,\n  author       = {Ugo Dal Lago and\n                  Claudia Faggian},\n  editor       = {Bart Jacobs and\n                  Peter Selinger and\n                  Bas Spitters},\n  title        = {On Multiplicative Linear Logic, Modality and Quantum Circuits},\n  booktitle    = {Proceedings 8th International Workshop on Quantum Physics and Logic,\n                  {QPL} 2011, Nijmegen, Netherlands, October 27-29, 2011},\n  series       = {{EPTCS}},\n  volume       = {95},\n  pages        = {55--66},\n  year         = {2011},\n  url          = {https://doi.org/10.4204/EPTCS.95.6},\n  doi          = {10.4204/EPTCS.95.6},\n  timestamp    = {Tue, 21 Mar 2023 21:05:19 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1210-0613.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Soft Session Types.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Paolo Di Giamberardino.\n\n\n \n\n\n\n In Bas Luttik, & Frank Valencia., editor(s), Proceedings 18th International Workshop on Expressiveness in Concurrency, EXPRESS 2011, Aachen, Germany, 5th September 2011, volume 64, of EPTCS, pages 59–73, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"SoftPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:journals/corr/abs-1108-4467,\n  author       = {Ugo Dal Lago and\n                  Paolo Di Giamberardino},\n  editor       = {Bas Luttik and\n                  Frank Valencia},\n  title        = {Soft Session Types},\n  booktitle    = {Proceedings 18th International Workshop on Expressiveness in Concurrency,\n                  {EXPRESS} 2011, Aachen, Germany, 5th September 2011},\n  series       = {{EPTCS}},\n  volume       = {64},\n  pages        = {59--73},\n  year         = {2011},\n  url          = {https://doi.org/10.4204/EPTCS.64.5},\n  doi          = {10.4204/EPTCS.64.5},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1108-4467.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Probabilistic Operational Semantics for the Lambda Calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Margherita Zorzi.\n\n\n \n\n\n\n CoRR, abs/1104.0195. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"ProbabilisticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1104-0195,\n  author       = {Ugo Dal Lago and\n                  Margherita Zorzi},\n  title        = {Probabilistic Operational Semantics for the Lambda Calculus},\n  journal      = {CoRR},\n  volume       = {abs/1104.0195},\n  year         = {2011},\n  url          = {http://arxiv.org/abs/1104.0195},\n  eprinttype    = {arXiv},\n  eprint       = {1104.0195},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-0195.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Soft Session Types (Long Version).\n \n \n \n \n\n\n \n Ugo Dal Lago, & Paolo Di Giamberardino.\n\n\n \n\n\n\n CoRR, abs/1107.4478. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"SoftPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-1107-4478,\n  author       = {Ugo Dal Lago and\n                  Paolo Di Giamberardino},\n  title        = {Soft Session Types (Long Version)},\n  journal      = {CoRR},\n  volume       = {abs/1107.4478},\n  year         = {2011},\n  url          = {http://arxiv.org/abs/1107.4478},\n  eprinttype    = {arXiv},\n  eprint       = {1107.4478},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-4478.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Bounded Linear Logic, Revisited.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Martin Hofmann.\n\n\n \n\n\n\n Log. Methods Comput. Sci., 6(4). 2010.\n \n\n\n\n
\n\n\n\n \n \n \"BoundedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-0904-2675,\n  author       = {Ugo Dal Lago and\n                  Martin Hofmann},\n  title        = {Bounded Linear Logic, Revisited},\n  journal      = {Log. Methods Comput. Sci.},\n  volume       = {6},\n  number       = {4},\n  year         = {2010},\n  url          = {https://doi.org/10.2168/LMCS-6(4:7)2010},\n  doi          = {10.2168/LMCS-6(4:7)2010},\n  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0904-2675.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Semantic Proof of Polytime Soundness of Light Affine Logic.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Martin Hofmann.\n\n\n \n\n\n\n Theory Comput. Syst., 46(4): 673–689. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mst/LagoH10,\n  author       = {Ugo Dal Lago and\n                  Martin Hofmann},\n  title        = {A Semantic Proof of Polytime Soundness of Light Affine Logic},\n  journal      = {Theory Comput. Syst.},\n  volume       = {46},\n  number       = {4},\n  pages        = {673--689},\n  year         = {2010},\n  url          = {https://doi.org/10.1007/s00224-009-9210-x},\n  doi          = {10.1007/S00224-009-9210-X},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/mst/LagoH10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Quantum implicit computational complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago, Andrea Masini, & Margherita Zorzi.\n\n\n \n\n\n\n Theor. Comput. Sci., 411(2): 377–409. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"QuantumPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoMZ10,\n  author       = {Ugo Dal Lago and\n                  Andrea Masini and\n                  Margherita Zorzi},\n  title        = {Quantum implicit computational complexity},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {411},\n  number       = {2},\n  pages        = {377--409},\n  year         = {2010},\n  url          = {https://doi.org/10.1016/j.tcs.2009.07.045},\n  doi          = {10.1016/J.TCS.2009.07.045},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoMZ10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Type Inference for Sublinear Space Functional Programming.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Ulrich Schöpp.\n\n\n \n\n\n\n In Kazunori Ueda., editor(s), Programming Languages and Systems - 8th Asian Symposium, APLAS 2010, Shanghai, China, November 28 - December 1, 2010. Proceedings, volume 6461, of Lecture Notes in Computer Science, pages 376–391, 2010. Springer\n \n\n\n\n
\n\n\n\n \n \n \"TypePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/aplas/LagoS10,\n  author       = {Ugo Dal Lago and\n                  Ulrich Sch{\\"{o}}pp},\n  editor       = {Kazunori Ueda},\n  title        = {Type Inference for Sublinear Space Functional Programming},\n  booktitle    = {Programming Languages and Systems - 8th Asian Symposium, {APLAS} 2010,\n                  Shanghai, China, November 28 - December 1, 2010. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {6461},\n  pages        = {376--391},\n  publisher    = {Springer},\n  year         = {2010},\n  url          = {https://doi.org/10.1007/978-3-642-17164-2\\_26},\n  doi          = {10.1007/978-3-642-17164-2\\_26},\n  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/aplas/LagoS10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Functional Programming in Sublinear Space.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Ulrich Schöpp.\n\n\n \n\n\n\n In Andrew D. Gordon., editor(s), Programming Languages and Systems, 19th European Symposium on Programming, ESOP 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings, volume 6012, of Lecture Notes in Computer Science, pages 205–225, 2010. Springer\n \n\n\n\n
\n\n\n\n \n \n \"FunctionalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/esop/LagoS10,\n  author       = {Ugo Dal Lago and\n                  Ulrich Sch{\\"{o}}pp},\n  editor       = {Andrew D. Gordon},\n  title        = {Functional Programming in Sublinear Space},\n  booktitle    = {Programming Languages and Systems, 19th European Symposium on Programming,\n                  {ESOP} 2010, Held as Part of the Joint European Conferences on Theory\n                  and Practice of Software, {ETAPS} 2010, Paphos, Cyprus, March 20-28,\n                  2010. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {6012},\n  pages        = {205--225},\n  publisher    = {Springer},\n  year         = {2010},\n  url          = {https://doi.org/10.1007/978-3-642-11957-6\\_12},\n  doi          = {10.1007/978-3-642-11957-6\\_12},\n  timestamp    = {Mon, 14 Feb 2022 09:20:30 +0100},\n  biburl       = {https://dblp.org/rec/conf/esop/LagoS10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Light Logics and Higher-Order Processes.\n \n \n \n \n\n\n \n Ugo Dal Lago, Simone Martini, & Davide Sangiorgi.\n\n\n \n\n\n\n In Sibylle B. Fröschle, & Frank D. Valencia., editor(s), Proceedings 17th International Workshop on Expressiveness in Concurrency, EXPRESS'10, Paris, France, August 30th, 2010, volume 41, of EPTCS, pages 46–60, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"LightPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:journals/corr/abs-1011-6431,\n  author       = {Ugo Dal Lago and\n                  Simone Martini and\n                  Davide Sangiorgi},\n  editor       = {Sibylle B. Fr{\\"{o}}schle and\n                  Frank D. Valencia},\n  title        = {Light Logics and Higher-Order Processes},\n  booktitle    = {Proceedings 17th International Workshop on Expressiveness in Concurrency,\n                  EXPRESS'10, Paris, France, August 30th, 2010},\n  series       = {{EPTCS}},\n  volume       = {41},\n  pages        = {46--60},\n  year         = {2010},\n  url          = {https://doi.org/10.4204/EPTCS.41.4},\n  doi          = {10.4204/EPTCS.41.4},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1011-6431.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n General Ramified Recurrence is Sound for Polynomial Time.\n \n \n \n \n\n\n \n Ugo Dal Lago, Simone Martini, & Margherita Zorzi.\n\n\n \n\n\n\n In Patrick Baillot., editor(s), Proceedings International Workshop on Developments in Implicit Computational complExity, DICE 2010, Paphos, Cyprus, 27-28th March 2010, volume 23, of EPTCS, pages 47–62, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"GeneralPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:journals/corr/abs-1005-0521,\n  author       = {Ugo Dal Lago and\n                  Simone Martini and\n                  Margherita Zorzi},\n  editor       = {Patrick Baillot},\n  title        = {General Ramified Recurrence is Sound for Polynomial Time},\n  booktitle    = {Proceedings International Workshop on Developments in Implicit Computational\n                  complExity, {DICE} 2010, Paphos, Cyprus, 27-28th March 2010},\n  series       = {{EPTCS}},\n  volume       = {23},\n  pages        = {47--62},\n  year         = {2010},\n  url          = {https://doi.org/10.4204/EPTCS.23.4},\n  doi          = {10.4204/EPTCS.23.4},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1005-0521.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On a measurement-free quantum lambda calculus with classical control.\n \n \n \n \n\n\n \n Ugo Dal Lago, Andrea Masini, & Margherita Zorzi.\n\n\n \n\n\n\n Math. Struct. Comput. Sci., 19(2): 297–335. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mscs/LagoMZ09,\n  author       = {Ugo Dal Lago and\n                  Andrea Masini and\n                  Margherita Zorzi},\n  title        = {On a measurement-free quantum lambda calculus with classical control},\n  journal      = {Math. Struct. Comput. Sci.},\n  volume       = {19},\n  number       = {2},\n  pages        = {297--335},\n  year         = {2009},\n  url          = {https://doi.org/10.1017/S096012950800741X},\n  doi          = {10.1017/S096012950800741X},\n  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/mscs/LagoMZ09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The geometry of linear higher-order recursion.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n ACM Trans. Comput. Log., 10(2): 8:1–8:38. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tocl/Lago09,\n  author       = {Ugo Dal Lago},\n  title        = {The geometry of linear higher-order recursion},\n  journal      = {{ACM} Trans. Comput. Log.},\n  volume       = {10},\n  number       = {2},\n  pages        = {8:1--8:38},\n  year         = {2009},\n  url          = {https://doi.org/10.1145/1462179.1462180},\n  doi          = {10.1145/1462179.1462180},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tocl/Lago09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Context semantics, linear logic, and computational complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n ACM Trans. Comput. Log., 10(4): 25:1–25:32. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"ContextPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tocl/Lago09a,\n  author       = {Ugo Dal Lago},\n  title        = {Context semantics, linear logic, and computational complexity},\n  journal      = {{ACM} Trans. Comput. Log.},\n  volume       = {10},\n  number       = {4},\n  pages        = {25:1--25:32},\n  year         = {2009},\n  url          = {https://doi.org/10.1145/1555746.1555749},\n  doi          = {10.1145/1555746.1555749},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tocl/Lago09a.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Derivational Complexity Is an Invariant Cost Model.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Simone Martini.\n\n\n \n\n\n\n In Marko C. J. D. Eekelen, & Olha Shkaravska., editor(s), Foundational and Practical Aspects of Resource Analysis - First International Workshop, FOPARA 2009, Eindhoven, The Netherlands, November 6, 2009, Revised Selected Papers, volume 6324, of Lecture Notes in Computer Science, pages 100–113, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DerivationalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fopara/LagoM09,\n  author       = {Ugo Dal Lago and\n                  Simone Martini},\n  editor       = {Marko C. J. D. van Eekelen and\n                  Olha Shkaravska},\n  title        = {Derivational Complexity Is an Invariant Cost Model},\n  booktitle    = {Foundational and Practical Aspects of Resource Analysis - First International\n                  Workshop, {FOPARA} 2009, Eindhoven, The Netherlands, November 6, 2009,\n                  Revised Selected Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {6324},\n  pages        = {100--113},\n  publisher    = {Springer},\n  year         = {2009},\n  url          = {https://doi.org/10.1007/978-3-642-15331-0\\_7},\n  doi          = {10.1007/978-3-642-15331-0\\_7},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/fopara/LagoM09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Constructor Rewrite Systems and the Lambda-Calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Simone Martini.\n\n\n \n\n\n\n In Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, & Wolfgang Thomas., editor(s), Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, volume 5556, of Lecture Notes in Computer Science, pages 163–174, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/icalp/LagoM09,\n  author       = {Ugo Dal Lago and\n                  Simone Martini},\n  editor       = {Susanne Albers and\n                  Alberto Marchetti{-}Spaccamela and\n                  Yossi Matias and\n                  Sotiris E. Nikoletseas and\n                  Wolfgang Thomas},\n  title        = {On Constructor Rewrite Systems and the Lambda-Calculus},\n  booktitle    = {Automata, Languages and Programming, 36th Internatilonal Colloquium,\n                  {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {II}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {5556},\n  pages        = {163--174},\n  publisher    = {Springer},\n  year         = {2009},\n  url          = {https://doi.org/10.1007/978-3-642-02930-1\\_14},\n  doi          = {10.1007/978-3-642-02930-1\\_14},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/icalp/LagoM09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Taming Modal Impredicativity: Superlazy Reduction.\n \n \n \n \n\n\n \n Ugo Dal Lago, Luca Roversi, & Luca Vercelli.\n\n\n \n\n\n\n In Sergei N. Artëmov, & Anil Nerode., editor(s), Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, volume 5407, of Lecture Notes in Computer Science, pages 137–151, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"TamingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lfcs/LagoRV09,\n  author       = {Ugo Dal Lago and\n                  Luca Roversi and\n                  Luca Vercelli},\n  editor       = {Sergei N. Art{\\"{e}}mov and\n                  Anil Nerode},\n  title        = {Taming Modal Impredicativity: Superlazy Reduction},\n  booktitle    = {Logical Foundations of Computer Science, International Symposium,\n                  {LFCS} 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {5407},\n  pages        = {137--151},\n  publisher    = {Springer},\n  year         = {2009},\n  url          = {https://doi.org/10.1007/978-3-540-92687-0\\_10},\n  doi          = {10.1007/978-3-540-92687-0\\_10},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lfcs/LagoRV09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Bounded Linear Logic, Revisited.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Martin Hofmann.\n\n\n \n\n\n\n In Pierre-Louis Curien., editor(s), Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings, volume 5608, of Lecture Notes in Computer Science, pages 80–94, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"BoundedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/tlca/LagoH09,\n  author       = {Ugo Dal Lago and\n                  Martin Hofmann},\n  editor       = {Pierre{-}Louis Curien},\n  title        = {Bounded Linear Logic, Revisited},\n  booktitle    = {Typed Lambda Calculi and Applications, 9th International Conference,\n                  {TLCA} 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {5608},\n  pages        = {80--94},\n  publisher    = {Springer},\n  year         = {2009},\n  url          = {https://doi.org/10.1007/978-3-642-02273-9\\_8},\n  doi          = {10.1007/978-3-642-02273-9\\_8},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/tlca/LagoH09.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Confluence Results for a Quantum Lambda Calculus with Measurements.\n \n \n \n \n\n\n \n Ugo Dal Lago, Andrea Masini, & Margherita Zorzi.\n\n\n \n\n\n\n In Bob Coecke, Prakash Panangaden, & Peter Selinger., editor(s), Proceedings of the 6th International Workshop on Quantum Physics and Logic, QPL@MFPS 2009, Oxford, UK, April 8-9, 2009, volume 270, of Electronic Notes in Theoretical Computer Science, pages 251–261, 2009. Elsevier\n \n\n\n\n
\n\n\n\n \n \n \"ConfluencePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:journals/entcs/LagoMZ11,\n  author       = {Ugo Dal Lago and\n                  Andrea Masini and\n                  Margherita Zorzi},\n  editor       = {Bob Coecke and\n                  Prakash Panangaden and\n                  Peter Selinger},\n  title        = {Confluence Results for a Quantum Lambda Calculus with Measurements},\n  booktitle    = {Proceedings of the 6th International Workshop on Quantum Physics and\n                  Logic, QPL@MFPS 2009, Oxford, UK, April 8-9, 2009},\n  series       = {Electronic Notes in Theoretical Computer Science},\n  volume       = {270},\n  number       = {2},\n  pages        = {251--261},\n  publisher    = {Elsevier},\n  year         = {2009},\n  url          = {https://doi.org/10.1016/j.entcs.2011.01.035},\n  doi          = {10.1016/J.ENTCS.2011.01.035},\n  timestamp    = {Fri, 10 Mar 2023 13:14:38 +0100},\n  biburl       = {https://dblp.org/rec/journals/entcs/LagoMZ11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Constructor Rewrite Systems and the Lambda-Calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Simone Martini.\n\n\n \n\n\n\n CoRR, abs/0904.4120. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-0904-4120,\n  author       = {Ugo Dal Lago and\n                  Simone Martini},\n  title        = {On Constructor Rewrite Systems and the Lambda-Calculus},\n  journal      = {CoRR},\n  volume       = {abs/0904.4120},\n  year         = {2009},\n  url          = {http://arxiv.org/abs/0904.4120},\n  eprinttype    = {arXiv},\n  eprint       = {0904.4120},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0904-4120.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Confluence Results for a Quantum Lambda Calculus with Measurements.\n \n \n \n \n\n\n \n Ugo Dal Lago, Andrea Masini, & Margherita Zorzi.\n\n\n \n\n\n\n CoRR, abs/0905.4567. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"ConfluencePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-0905-4567,\n  author       = {Ugo Dal Lago and\n                  Andrea Masini and\n                  Margherita Zorzi},\n  title        = {Confluence Results for a Quantum Lambda Calculus with Measurements},\n  journal      = {CoRR},\n  volume       = {abs/0905.4567},\n  year         = {2009},\n  url          = {http://arxiv.org/abs/0905.4567},\n  eprinttype    = {arXiv},\n  eprint       = {0905.4567},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0905-4567.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Light Logics and the Call-by-Value Lambda Calculus.\n \n \n \n \n\n\n \n Paolo Coppola, Ugo Dal Lago, & Simona Ronchi Della Rocca.\n\n\n \n\n\n\n Log. Methods Comput. Sci., 4(4). 2008.\n \n\n\n\n
\n\n\n\n \n \n \"LightPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/lmcs/CoppolaLR08,\n  author       = {Paolo Coppola and\n                  Ugo Dal Lago and\n                  Simona Ronchi Della Rocca},\n  title        = {Light Logics and the Call-by-Value Lambda Calculus},\n  journal      = {Log. Methods Comput. Sci.},\n  volume       = {4},\n  number       = {4},\n  year         = {2008},\n  url          = {https://doi.org/10.2168/LMCS-4(4:5)2008},\n  doi          = {10.2168/LMCS-4(4:5)2008},\n  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/lmcs/CoppolaLR08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The weak lambda calculus as a reasonable machine.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Simone Martini.\n\n\n \n\n\n\n Theor. Comput. Sci., 398(1-3): 32–50. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoM08,\n  author       = {Ugo Dal Lago and\n                  Simone Martini},\n  title        = {The weak lambda calculus as a reasonable machine},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {398},\n  number       = {1-3},\n  pages        = {32--50},\n  year         = {2008},\n  url          = {https://doi.org/10.1016/j.tcs.2008.01.044},\n  doi          = {10.1016/J.TCS.2008.01.044},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoM08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Quantitative Game Semantics for Linear Logic.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Olivier Laurent.\n\n\n \n\n\n\n In Michael Kaminski, & Simone Martini., editor(s), Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, volume 5213, of Lecture Notes in Computer Science, pages 230–245, 2008. Springer\n \n\n\n\n
\n\n\n\n \n \n \"QuantitativePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/csl/LagoL08,\n  author       = {Ugo Dal Lago and\n                  Olivier Laurent},\n  editor       = {Michael Kaminski and\n                  Simone Martini},\n  title        = {Quantitative Game Semantics for Linear Logic},\n  booktitle    = {Computer Science Logic, 22nd International Workshop, {CSL} 2008, 17th\n                  Annual Conference of the EACSL, Bertinoro, Italy, September 16-19,\n                  2008. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {5213},\n  pages        = {230--245},\n  publisher    = {Springer},\n  year         = {2008},\n  url          = {https://doi.org/10.1007/978-3-540-87531-4\\_18},\n  doi          = {10.1007/978-3-540-87531-4\\_18},\n  timestamp    = {Mon, 06 Nov 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/csl/LagoL08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Semantic Proof of Polytime Soundness of Light Affine Logic.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Martin Hofmann.\n\n\n \n\n\n\n In Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, & Anatol Slissenko., editor(s), Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, volume 5010, of Lecture Notes in Computer Science, pages 134–145, 2008. Springer\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/csr/LagoH08,\n  author       = {Ugo Dal Lago and\n                  Martin Hofmann},\n  editor       = {Edward A. Hirsch and\n                  Alexander A. Razborov and\n                  Alexei L. Semenov and\n                  Anatol Slissenko},\n  title        = {A Semantic Proof of Polytime Soundness of Light Affine Logic},\n  booktitle    = {Computer Science - Theory and Applications, Third International Computer\n                  Science Symposium in Russia, {CSR} 2008, Moscow, Russia, June 7-12,\n                  2008, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {5010},\n  pages        = {134--145},\n  publisher    = {Springer},\n  year         = {2008},\n  url          = {https://doi.org/10.1007/978-3-540-79709-8\\_16},\n  doi          = {10.1007/978-3-540-79709-8\\_16},\n  timestamp    = {Tue, 21 Mar 2023 21:00:47 +0100},\n  biburl       = {https://dblp.org/rec/conf/csr/LagoH08.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Light Logics and the Call-by-Value Lambda Calculus.\n \n \n \n \n\n\n \n Paolo Coppola, Ugo Dal Lago, & Simona Ronchi Della Rocca.\n\n\n \n\n\n\n CoRR, abs/0809.0195. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"LightPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-0809-0195,\n  author       = {Paolo Coppola and\n                  Ugo Dal Lago and\n                  Simona Ronchi Della Rocca},\n  title        = {Light Logics and the Call-by-Value Lambda Calculus},\n  journal      = {CoRR},\n  volume       = {abs/0809.0195},\n  year         = {2008},\n  url          = {http://arxiv.org/abs/0809.0195},\n  eprinttype    = {arXiv},\n  eprint       = {0809.0195},\n  timestamp    = {Thu, 14 May 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0809-0195.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Taming Modal Impredicativity: Superlazy Reduction.\n \n \n \n \n\n\n \n Ugo Dal Lago, Luca Roversi, & Luca Vercelli.\n\n\n \n\n\n\n CoRR, abs/0810.2891. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"TamingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-0810-2891,\n  author       = {Ugo Dal Lago and\n                  Luca Roversi and\n                  Luca Vercelli},\n  title        = {Taming Modal Impredicativity: Superlazy Reduction},\n  journal      = {CoRR},\n  volume       = {abs/0810.2891},\n  year         = {2008},\n  url          = {http://arxiv.org/abs/0810.2891},\n  eprinttype    = {arXiv},\n  eprint       = {0810.2891},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0810-2891.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Compact and tractable automaton-based representations of time granularities.\n \n \n \n \n\n\n \n Ugo Dal Lago, Angelo Montanari, & Gabriele Puppis.\n\n\n \n\n\n\n Theor. Comput. Sci., 373(1-2): 115–141. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"CompactPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoMP07,\n  author       = {Ugo Dal Lago and\n                  Angelo Montanari and\n                  Gabriele Puppis},\n  title        = {Compact and tractable automaton-based representations of time granularities},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {373},\n  number       = {1-2},\n  pages        = {115--141},\n  year         = {2007},\n  url          = {https://doi.org/10.1016/j.tcs.2006.12.014},\n  doi          = {10.1016/J.TCS.2006.12.014},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoMP07.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Light Logics and Optimal Reduction: Completeness and Complexity.\n \n \n \n \n\n\n \n Patrick Baillot, Paolo Coppola, & Ugo Dal Lago.\n\n\n \n\n\n\n In 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pages 421–430, 2007. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"LightPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/BaillotCL07,\n  author       = {Patrick Baillot and\n                  Paolo Coppola and\n                  Ugo Dal Lago},\n  title        = {Light Logics and Optimal Reduction: Completeness and Complexity},\n  booktitle    = {22nd {IEEE} Symposium on Logic in Computer Science {(LICS} 2007),\n                  10-12 July 2007, Wroclaw, Poland, Proceedings},\n  pages        = {421--430},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2007},\n  url          = {https://doi.org/10.1109/LICS.2007.27},\n  doi          = {10.1109/LICS.2007.27},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/BaillotCL07.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Equivalence of Automaton-Based Representations of Time Granularities.\n \n \n \n \n\n\n \n Ugo Dal Lago, Angelo Montanari, & Gabriele Puppis.\n\n\n \n\n\n\n In 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 28-30 June 2007, Alicante, Spain, pages 82–93, 2007. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/time/LagoMP07,\n  author       = {Ugo Dal Lago and\n                  Angelo Montanari and\n                  Gabriele Puppis},\n  title        = {On the Equivalence of Automaton-Based Representations of Time Granularities},\n  booktitle    = {14th International Symposium on Temporal Representation and Reasoning\n                  {(TIME} 2007), 28-30 June 2007, Alicante, Spain},\n  pages        = {82--93},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2007},\n  url          = {https://doi.org/10.1109/TIME.2007.56},\n  doi          = {10.1109/TIME.2007.56},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/time/LagoMP07.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Light Logics and Optimal Reduction: Completeness and Complexity.\n \n \n \n \n\n\n \n Patrick Baillot, Paolo Coppola, & Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/0704.2448. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"LightPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-0704-2448,\n  author       = {Patrick Baillot and\n                  Paolo Coppola and\n                  Ugo Dal Lago},\n  title        = {Light Logics and Optimal Reduction: Completeness and Complexity},\n  journal      = {CoRR},\n  volume       = {abs/0704.2448},\n  year         = {2007},\n  url          = {http://arxiv.org/abs/0704.2448},\n  eprinttype    = {arXiv},\n  eprint       = {0704.2448},\n  timestamp    = {Thu, 14 May 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-0704-2448.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power.\n \n \n \n \n\n\n \n Ugo Dal Lago, Andrea Masini, & Margherita Zorzi.\n\n\n \n\n\n\n CoRR, abs/cs/0703152. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"QuantumPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-cs-0703152,\n  author       = {Ugo Dal Lago and\n                  Andrea Masini and\n                  Margherita Zorzi},\n  title        = {Quantum Lambda Calculi with Classical Control: Syntax and Expressive\n                  Power},\n  journal      = {CoRR},\n  volume       = {abs/cs/0703152},\n  year         = {2007},\n  url          = {http://arxiv.org/abs/cs/0703152},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0703152},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0703152.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On light logics, uniform encodings and polynomial time.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Patrick Baillot.\n\n\n \n\n\n\n Math. Struct. Comput. Sci., 16(4): 713–733. 2006.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/mscs/LagoB06,\n  author       = {Ugo Dal Lago and\n                  Patrick Baillot},\n  title        = {On light logics, uniform encodings and polynomial time},\n  journal      = {Math. Struct. Comput. Sci.},\n  volume       = {16},\n  number       = {4},\n  pages        = {713--733},\n  year         = {2006},\n  url          = {https://doi.org/10.1017/S0960129506005421},\n  doi          = {10.1017/S0960129506005421},\n  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/mscs/LagoB06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Invariant Cost Model for the Lambda Calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Simone Martini.\n\n\n \n\n\n\n In Arnold Beckmann, Ulrich Berger, Benedikt Löwe, & John V. Tucker., editor(s), Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, volume 3988, of Lecture Notes in Computer Science, pages 105–114, 2006. Springer\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/cie/LagoM06,\n  author       = {Ugo Dal Lago and\n                  Simone Martini},\n  editor       = {Arnold Beckmann and\n                  Ulrich Berger and\n                  Benedikt L{\\"{o}}we and\n                  John V. Tucker},\n  title        = {An Invariant Cost Model for the Lambda Calculus},\n  booktitle    = {Logical Approaches to Computational Barriers, Second Conference on\n                  Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006,\n                  Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {3988},\n  pages        = {105--114},\n  publisher    = {Springer},\n  year         = {2006},\n  url          = {https://doi.org/10.1007/11780342\\_11},\n  doi          = {10.1007/11780342\\_11},\n  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cie/LagoM06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Context Semantics, Linear Logic and Computational Complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n In 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings, pages 169–178, 2006. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"ContextPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/Lago06,\n  author       = {Ugo Dal Lago},\n  title        = {Context Semantics, Linear Logic and Computational Complexity},\n  booktitle    = {21th {IEEE} Symposium on Logic in Computer Science {(LICS} 2006),\n                  12-15 August 2006, Seattle, WA, USA, Proceedings},\n  pages        = {169--178},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2006},\n  url          = {https://doi.org/10.1109/LICS.2006.21},\n  doi          = {10.1109/LICS.2006.21},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/Lago06.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Quasi-Interpretations, Blind Abstractions and Implicit Complexity.\n \n \n \n \n\n\n \n Patrick Baillot, Ugo Dal Lago, & Jean-Yves Moyen.\n\n\n \n\n\n\n CoRR, abs/cs/0608030. 2006.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-cs-0608030,\n  author       = {Patrick Baillot and\n                  Ugo Dal Lago and\n                  Jean{-}Yves Moyen},\n  title        = {On Quasi-Interpretations, Blind Abstractions and Implicit Complexity},\n  journal      = {CoRR},\n  volume       = {abs/cs/0608030},\n  year         = {2006},\n  url          = {http://arxiv.org/abs/cs/0608030},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0608030},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0608030.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Semantic frameworks for implicit computational complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n Ph.D. Thesis, University of Bologna, Italy, 2005.\n \n\n\n\n
\n\n\n\n \n \n \"SemanticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@phdthesis{DBLP:phd/it/DalLago05m,\n  author       = {Ugo Dal Lago},\n  title        = {Semantic frameworks for implicit computational complexity},\n  school       = {University of Bologna, Italy},\n  year         = {2005},\n  url          = {https://opac.bncf.firenze.sbn.it/bncf-prod/resource?uri=BNI0021484},\n  timestamp    = {Wed, 29 Mar 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/phd/it/DalLago05m.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Quantitative Models and Implicit Complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Martin Hofmann.\n\n\n \n\n\n\n In Ramaswamy Ramanujam, & Sandeep Sen., editor(s), FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings, volume 3821, of Lecture Notes in Computer Science, pages 189–200, 2005. Springer\n \n\n\n\n
\n\n\n\n \n \n \"QuantitativePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/fsttcs/LagoH05,\n  author       = {Ugo Dal Lago and\n                  Martin Hofmann},\n  editor       = {Ramaswamy Ramanujam and\n                  Sandeep Sen},\n  title        = {Quantitative Models and Implicit Complexity},\n  booktitle    = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical\n                  Computer Science, 25th International Conference, Hyderabad, India,\n                  December 15-18, 2005, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {3821},\n  pages        = {189--200},\n  publisher    = {Springer},\n  year         = {2005},\n  url          = {https://doi.org/10.1007/11590156\\_15},\n  doi          = {10.1007/11590156\\_15},\n  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/fsttcs/LagoH05.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Geometry of Linear Higher-Order Recursion.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n In 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pages 366–375, 2005. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/lics/Lago05,\n  author       = {Ugo Dal Lago},\n  title        = {The Geometry of Linear Higher-Order Recursion},\n  booktitle    = {20th {IEEE} Symposium on Logic in Computer Science {(LICS} 2005),\n                  26-29 June 2005, Chicago, IL, USA, Proceedings},\n  pages        = {366--375},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2005},\n  url          = {https://doi.org/10.1109/LICS.2005.52},\n  doi          = {10.1109/LICS.2005.52},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/lics/Lago05.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Elementary Affine Logic and the Call-by-Value Lambda Calculus.\n \n \n \n \n\n\n \n Paolo Coppola, Ugo Dal Lago, & Simona Ronchi Della Rocca.\n\n\n \n\n\n\n In Pawel Urzyczyn., editor(s), Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings, volume 3461, of Lecture Notes in Computer Science, pages 131–145, 2005. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ElementaryPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/tlca/CoppolaLR05,\n  author       = {Paolo Coppola and\n                  Ugo Dal Lago and\n                  Simona Ronchi Della Rocca},\n  editor       = {Pawel Urzyczyn},\n  title        = {Elementary Affine Logic and the Call-by-Value Lambda Calculus},\n  booktitle    = {Typed Lambda Calculi and Applications, 7th International Conference,\n                  {TLCA} 2005, Nara, Japan, April 21-23, 2005, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {3461},\n  pages        = {131--145},\n  publisher    = {Springer},\n  year         = {2005},\n  url          = {https://doi.org/10.1007/11417170\\_11},\n  doi          = {10.1007/11417170\\_11},\n  timestamp    = {Thu, 14 May 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/tlca/CoppolaLR05.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Quantitative Models and Implicit Complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Martin Hofmann.\n\n\n \n\n\n\n CoRR, abs/cs/0506079. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"QuantitativePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-cs-0506079,\n  author       = {Ugo Dal Lago and\n                  Martin Hofmann},\n  title        = {Quantitative Models and Implicit Complexity},\n  journal      = {CoRR},\n  volume       = {abs/cs/0506079},\n  year         = {2005},\n  url          = {http://arxiv.org/abs/cs/0506079},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0506079},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0506079.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Geometry of Linear Higher-Order Recursion.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/cs/0506080. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-cs-0506080,\n  author       = {Ugo Dal Lago},\n  title        = {The Geometry of Linear Higher-Order Recursion},\n  journal      = {CoRR},\n  volume       = {abs/cs/0506080},\n  year         = {2005},\n  url          = {http://arxiv.org/abs/cs/0506080},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0506080},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0506080.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Context Semantics, Linear Logic and Computational Complexity.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n CoRR, abs/cs/0510092. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"ContextPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-cs-0510092,\n  author       = {Ugo Dal Lago},\n  title        = {Context Semantics, Linear Logic and Computational Complexity},\n  journal      = {CoRR},\n  volume       = {abs/cs/0510092},\n  year         = {2005},\n  url          = {http://arxiv.org/abs/cs/0510092},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0510092},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0510092.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Invariant Cost Model for the Lambda Calculus.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Simone Martini.\n\n\n \n\n\n\n CoRR, abs/cs/0511045. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/corr/abs-cs-0511045,\n  author       = {Ugo Dal Lago and\n                  Simone Martini},\n  title        = {An Invariant Cost Model for the Lambda Calculus},\n  journal      = {CoRR},\n  volume       = {abs/cs/0511045},\n  year         = {2005},\n  url          = {http://arxiv.org/abs/cs/0511045},\n  eprinttype    = {arXiv},\n  eprint       = {cs/0511045},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0511045.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Phase semantics and decidability of elementary affine logic.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Simone Martini.\n\n\n \n\n\n\n Theor. Comput. Sci., 318(3): 409–433. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"PhasePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DBLP:journals/tcs/LagoM04,\n  author       = {Ugo Dal Lago and\n                  Simone Martini},\n  title        = {Phase semantics and decidability of elementary affine logic},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {318},\n  number       = {3},\n  pages        = {409--433},\n  year         = {2004},\n  url          = {https://doi.org/10.1016/j.tcs.2004.02.037},\n  doi          = {10.1016/J.TCS.2004.02.037},\n  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/tcs/LagoM04.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Towards Compact and Tractable Automaten-Based Representations of Time Granularities.\n \n \n \n \n\n\n \n Ugo Dal Lago, Angelo Montanari, & Gabriele Puppis.\n\n\n \n\n\n\n In Carlo Blundo, & Cosimo Laneve., editor(s), Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, volume 2841, of Lecture Notes in Computer Science, pages 72–85, 2003. Springer\n \n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ictcs/LagoMP03,\n  author       = {Ugo Dal Lago and\n                  Angelo Montanari and\n                  Gabriele Puppis},\n  editor       = {Carlo Blundo and\n                  Cosimo Laneve},\n  title        = {Towards Compact and Tractable Automaten-Based Representations of Time\n                  Granularities},\n  booktitle    = {Theoretical Computer Science, 8th Italian Conference, {ICTCS} 2003,\n                  Bertinoro, Italy, October 13-15, 2003, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {2841},\n  pages        = {72--85},\n  publisher    = {Springer},\n  year         = {2003},\n  url          = {https://doi.org/10.1007/978-3-540-45208-9\\_7},\n  doi          = {10.1007/978-3-540-45208-9\\_7},\n  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},\n  biburl       = {https://dblp.org/rec/conf/ictcs/LagoMP03.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Expressive Power of Light Affine Logic.\n \n \n \n \n\n\n \n Ugo Dal Lago.\n\n\n \n\n\n\n In Carlo Blundo, & Cosimo Laneve., editor(s), Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, volume 2841, of Lecture Notes in Computer Science, pages 216–227, 2003. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ictcs/Lago03,\n  author       = {Ugo Dal Lago},\n  editor       = {Carlo Blundo and\n                  Cosimo Laneve},\n  title        = {On the Expressive Power of Light Affine Logic},\n  booktitle    = {Theoretical Computer Science, 8th Italian Conference, {ICTCS} 2003,\n                  Bertinoro, Italy, October 13-15, 2003, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {2841},\n  pages        = {216--227},\n  publisher    = {Springer},\n  year         = {2003},\n  url          = {https://doi.org/10.1007/978-3-540-45208-9\\_18},\n  doi          = {10.1007/978-3-540-45208-9\\_18},\n  timestamp    = {Sun, 21 May 2017 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/ictcs/Lago03.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Higher-Order Linear Ramified Recurrence.\n \n \n \n \n\n\n \n Ugo Dal Lago, Simone Martini, & Luca Roversi.\n\n\n \n\n\n\n In Stefano Berardi, Mario Coppo, & Ferruccio Damiani., editor(s), Types for Proofs and Programs, International Workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers, volume 3085, of Lecture Notes in Computer Science, pages 178–193, 2003. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Higher-OrderPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/types/LagoMR03,\n  author       = {Ugo Dal Lago and\n                  Simone Martini and\n                  Luca Roversi},\n  editor       = {Stefano Berardi and\n                  Mario Coppo and\n                  Ferruccio Damiani},\n  title        = {Higher-Order Linear Ramified Recurrence},\n  booktitle    = {Types for Proofs and Programs, International Workshop, {TYPES} 2003,\n                  Torino, Italy, April 30 - May 4, 2003, Revised Selected Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {3085},\n  pages        = {178--193},\n  publisher    = {Springer},\n  year         = {2003},\n  url          = {https://doi.org/10.1007/978-3-540-24849-1\\_12},\n  doi          = {10.1007/978-3-540-24849-1\\_12},\n  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},\n  biburl       = {https://dblp.org/rec/conf/types/LagoMR03.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Planning with a Language for Extended Goals.\n \n \n \n \n\n\n \n Ugo Dal Lago, Marco Pistore, & Paolo Traverso.\n\n\n \n\n\n\n In Rina Dechter, Michael J. Kearns, & Richard S. Sutton., editor(s), Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada, pages 447–454, 2002. AAAI Press / The MIT Press\n \n\n\n\n
\n\n\n\n \n \n \"PlanningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/aaai/LagoPT02,\n  author       = {Ugo Dal Lago and\n                  Marco Pistore and\n                  Paolo Traverso},\n  editor       = {Rina Dechter and\n                  Michael J. Kearns and\n                  Richard S. Sutton},\n  title        = {Planning with a Language for Extended Goals},\n  booktitle    = {Proceedings of the Eighteenth National Conference on Artificial Intelligence\n                  and Fourteenth Conference on Innovative Applications of Artificial\n                  Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada},\n  pages        = {447--454},\n  publisher    = {{AAAI} Press / The {MIT} Press},\n  year         = {2002},\n  url          = {http://www.aaai.org/Library/AAAI/2002/aaai02-068.php},\n  timestamp    = {Tue, 05 Sep 2023 09:10:47 +0200},\n  biburl       = {https://dblp.org/rec/conf/aaai/LagoPT02.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2001\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Calendars, Time Granularities, and Automata.\n \n \n \n \n\n\n \n Ugo Dal Lago, & Angelo Montanari.\n\n\n \n\n\n\n In Christian S. Jensen, Markus Schneider, Bernhard Seeger, & Vassilis J. Tsotras., editor(s), Advances in Spatial and Temporal Databases, 7th International Symposium, SSTD 2001, Redondo Beach, CA, USA, July 12-15, 2001, Proceedings, volume 2121, of Lecture Notes in Computer Science, pages 279–298, 2001. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Calendars,Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/ssd/LagoM01,\n  author       = {Ugo Dal Lago and\n                  Angelo Montanari},\n  editor       = {Christian S. Jensen and\n                  Markus Schneider and\n                  Bernhard Seeger and\n                  Vassilis J. Tsotras},\n  title        = {Calendars, Time Granularities, and Automata},\n  booktitle    = {Advances in Spatial and Temporal Databases, 7th International Symposium,\n                  {SSTD} 2001, Redondo Beach, CA, USA, July 12-15, 2001, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {2121},\n  pages        = {279--298},\n  publisher    = {Springer},\n  year         = {2001},\n  url          = {https://doi.org/10.1007/3-540-47724-1\\_15},\n  doi          = {10.1007/3-540-47724-1\\_15},\n  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},\n  biburl       = {https://dblp.org/rec/conf/ssd/LagoM01.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);