Avanzini M.; Barthe G.; Dal Lago U., On continuation-passing transformations and expected cost analysis, «PROCEEDINGS OF ACM ON PROGRAMMING LANGUAGES», 2021, 5, Article number: 3473592 , pp. 1 - 30 [Scientific article]Open Access
Antonelli M.; Dal Lago U.; Pistone P., On Counting Propositional Logic and Wagner's Hierarchy, in: CEUR Workshop Proceedings, CEUR-WS, 2021, 3072, pp. 107 - 121 (atti di: 22nd Italian Conference on Theoretical Computer Science, ICTCS 2021, ita, 2021) [Contribution to conference proceedings]Open Access
Flavien Breuvart; Ugo Dal Lago; Agathe Herrou, On Higher-Order Probabilistic Subrecursion, «LOGICAL METHODS IN COMPUTER SCIENCE», 2021, 17, Article number: 25 , pp. 1 - 35 [Scientific article]Open Access
Antonelli M.; Dal Lago U.; Pistone P., On Measure Quantifiers in First-Order Arithmetic, in: Connecting with Computability. 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings, Cham, Springer, 2021, 12813, pp. 12 - 24 (atti di: 17th Conference on Computability in Europe, CiE 2021, Online, 2021) [Contribution to conference proceedings]Open Access
Dal Lago U.; Gavazzo F., Resource transition systems and full abstraction for linear higher-order effectful programs, in: 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021), Dagstuhl, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021, 195, pp. 1 - 19 (atti di: 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, arg, 2021) [Contribution to conference proceedings]Open Access
Dal Lago U.; Hoshino N., The geometry of Bayesian programming, «MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE», 2021, 31, pp. 633 - 681 [Scientific article]Open Access
Accattoli B.; Dal Lago U.; Vanoni G., The (In)Efficiency of interaction, «PROCEEDINGS OF ACM ON PROGRAMMING LANGUAGES», 2021, 5, Article number: 51 , pp. 1 - 33 [Scientific article]Open Access
Accattoli B.; Dal Lago U.; Vanoni G., The Space of Interaction, in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Institute of Electrical and Electronics Engineers Inc., 2021, 2021, pp. 1 - 13 (atti di: 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Online, 2021) [Contribution to conference proceedings]Open Access
Dal Lago U.; Guerrieri G.; Heijltjes W., Decomposing Probabilistic Lambda-Calculi, in: Foundations of Software Science and Computation Structures. 23rd International Conference, FOSSACS 2020., Cham, Springer, 2020, 12077, pp. 136 - 156 (atti di: 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, irl, 2020) [Contribution to conference proceedings]Open Access
Dal Lago U.; Gavazzo F.; Tanaka R., Effectful applicative similarity for call-by-name lambda calculi, «THEORETICAL COMPUTER SCIENCE», 2020, 813, pp. 234 - 247 [Scientific article]Open Access
Barak B.; Crubille R.; Dal Lago U., On higher-order cryptography, in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Dagstuhl, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020, 168, pp. 1 - 16 (atti di: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, deu, 2020) [Contribution to conference proceedings]Open Access
Avanzini M.; Dal Lago U.; Yamada A., On probabilistic term rewriting, «SCIENCE OF COMPUTER PROGRAMMING», 2020, 185, Article number: 102338 , pp. 1 - 19 [Scientific article]Open Access
Dal Lago U.; Vanoni G., On randomised strategies in the λ-calculus, «THEORETICAL COMPUTER SCIENCE», 2020, 813, pp. 100 - 116 [Scientific article]
Kobayashi N.; Dal Lago U.; Grellois C., On the termination problem for probabilistic higher-order recursive programs, «LOGICAL METHODS IN COMPUTER SCIENCE», 2020, 16, Article number: 2 , pp. 1 - 57 [Scientific article]Open Access
Barthe G.; Crubille R.; Dal Lago U.; Gavazzo F., On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem, in: Programming Languages and Systems. 29th European Symposium on Programming, ESOP 2020., Cham, Springer, 2020, 12075, pp. 56 - 83 (atti di: 29th European Symposium on Programming, ESOP 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, irl, 2020) [Contribution to conference proceedings]Open Access
