Calendars, Time Granularities, and Automata. - Ugo Dal Lago; Angelo Montanari (SSTD, 2001)

Planning with a Language for Extended Goals. - Ugo Dal Lago; Marco Pistore; Paolo Traverso (AAAI/IAAI, 2002)

On the Expressive Power of Light Affine Logic. - Ugo Dal Lago (ICTCS, 2003)

Towards Compact and Tractable Automaten-Based Representations of Time Granularities. - Ugo Dal Lago; Angelo Montanari; Gabriele Puppis (ICTCS, 2003)

Higher-Order Linear Ramified Recurrence. - Ugo Dal Lago; Simone Martini 001; Luca Roversi (TYPES, 2003)

Phase semantics and decidability of elementary affine logic. - Ugo Dal Lago; Simone Martini 001 (Theor. Comput. Sci., 2004)

Quantitative Models and Implicit Complexity. - Ugo Dal Lago; Martin Hofmann 001 (FSTTCS, 2005)

Elementary Affine Logic and the Call-by-Value Lambda Calculus. - Paolo Coppola 001; Ugo Dal Lago; Simona Ronchi Della Rocca (TLCA, 2005)

Semantic frameworks for implicit computational complexity. - Ugo Dal Lago (2005)

An Invariant Cost Model for the Lambda Calculus. - Ugo Dal Lago; Simone Martini 001 (CiE, 2006)

On light logics, uniform encodings and polynomial time. - Ugo Dal Lago; Patrick Baillot (Math. Struct. Comput. Sci., 2006)

On the Equivalence of Automaton-Based Representations of Time Granularities. - Ugo Dal Lago; Angelo Montanari; Gabriele Puppis (TIME, 2007)

Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power - Ugo Dal Lago; Andrea Masini; Margherita Zorzi (CoRR, 2007)

Compact and tractable automaton-based representations of time granularities. - Ugo Dal Lago; Angelo Montanari; Gabriele Puppis (Theor. Comput. Sci., 2007)

Quantitative Game Semantics for Linear Logic. - Ugo Dal Lago; Olivier Laurent 001 (CSL, 2008)

Light Logics and the Call-by-Value Lambda Calculus. - Paolo Coppola 001; Ugo Dal Lago; Simona Ronchi Della Rocca (Log. Methods Comput. Sci., 2008)

The weak lambda calculus as a reasonable machine. - Ugo Dal Lago; Simone Martini 001 (Theor. Comput. Sci., 2008)

Derivational Complexity Is an Invariant Cost Model. - Ugo Dal Lago; Simone Martini 001 (FOPARA, 2009)

Taming Modal Impredicativity: Superlazy Reduction. - Ugo Dal Lago; Luca Roversi; Luca Vercelli (LFCS, 2009)

Confluence Results for a Quantum Lambda Calculus with Measurements. - Ugo Dal Lago; Andrea Masini; Margherita Zorzi (QPL@MFPS, 2009)

On a measurement-free quantum lambda calculus with classical control. - Ugo Dal Lago; Andrea Masini; Margherita Zorzi (Math. Struct. Comput. Sci., 2009)

The geometry of linear higher-order recursion. - Ugo Dal Lago (ACM Trans. Comput. Log., 2009)

Context semantics, linear logic, and computational complexity. - Ugo Dal Lago (ACM Trans. Comput. Log., 2009)

Type Inference for Sublinear Space Functional Programming. - Ugo Dal Lago; Ulrich Schöpp (APLAS, 2010)

Functional Programming in Sublinear Space. - Ugo Dal Lago; Ulrich Schöpp (ESOP, 2010)

Bounded Linear Logic, Revisited - Ugo Dal Lago; Martin Hofmann 001 (Log. Methods Comput. Sci., 2010)

General Ramified Recurrence is Sound for Polynomial Time - Ugo Dal Lago; Simone Martini 001; Margherita Zorzi (DICE, 2010)

Light Logics and Higher-Order Processes - Ugo Dal Lago; Simone Martini 001; Davide Sangiorgi (EXPRESS, 2010)

A Semantic Proof of Polytime Soundness of Light Affine Logic. - Ugo Dal Lago; Martin Hofmann 001 (Theory Comput. Syst., 2010)

Quantum implicit computational complexity. - Ugo Dal Lago; Andrea Masini; Margherita Zorzi (Theor. Comput. Sci., 2010)

A Short Introduction to Implicit Computational Complexity. - Ugo Dal Lago (ESSLLI, 2011)

Linear Dependent Types and Relative Completeness - Ugo Dal Lago; Marco Gaboardi (Log. Methods Comput. Sci., 2011)

Soft Session Types (Long Version) - Ugo Dal Lago; Paolo Di Giamberardino (CoRR, 2011)

Soft Session Types - Ugo Dal Lago; Paolo Di Giamberardino (EXPRESS, 2011)

On Multiplicative Linear Logic, Modality and Quantum Circuits - Ugo Dal Lago; Claudia Faggian (QPL, 2011)

Light logics and optimal reduction: Completeness and complexity. - Patrick Baillot; Paolo Coppola 001; Ugo Dal Lago (Inf. Comput., 2011)

Realizability models and implicit complexity. - Ugo Dal Lago; Martin Hofmann 001 (Theor. Comput. Sci., 2011)

On the Invariance of the Unitary Cost Model for Head Reduction. - Beniamino Accattoli; Ugo Dal Lago (RTA, 2012)

On the Invariance of the Unitary Cost Model for Head Reduction (Long Version) - Beniamino Accattoli; Ugo Dal Lago (CoRR, 2012)

An Higher-Order Characterization of Probabilistic Polynomial Time (Long Version) - Ugo Dal Lago; Paolo Parisen Toldin (CoRR, 2012)

Linear Dependent Types in a Call-by-Value Scenario (Long Version) - Ugo Dal Lago; Barbara Petit (CoRR, 2012)

On Constructor Rewrite Systems and the Lambda Calculus - Ugo Dal Lago; Simone Martini 001 (Log. Methods Comput. Sci., 2012)

Computational Complexity of Interactive Behaviors - Ugo Dal Lago; Tobias Heindel; Damiano Mazza; Daniele Varacca (CoRR, 2012)

The Geometry of Types (Long Version) - Ugo Dal Lago; Barbara Petit (CoRR, 2012)

Probabilistic operational semantics for the lambda calculus. - Ugo Dal Lago; Margherita Zorzi (RAIRO Theor. Informatics Appl., 2012)

On quasi-interpretations, blind abstractions and implicit complexity. - Patrick Baillot; Ugo Dal Lago; Jean-Yves Moyen (Math. Struct. Comput. Sci., 2012)

Complexity Analysis in Presence of Control Operators and Higher-Order Functions. - Ugo Dal Lago; Giulio Pellitta (LPAR, 2013)

The geometry of types. - Ugo Dal Lago; Barbara Petit (POPL, 2013)

Complexity Analysis in Presence of Control Operators and Higher-Order Functions (Long Version). - Ugo Dal Lago; Giulio Pellitta (CoRR, 2013)

On Coinductive Equivalences for Higher-Order Probabilistic Functional Programs (Long Version). - Ugo Dal Lago; Davide Sangiorgi; Michele Alberti (CoRR, 2013)

Beta reduction is invariant, indeed. - Beniamino Accattoli; Ugo Dal Lago (CSL-LICS, 2014)

The geometry of synchronization. - Ugo Dal Lago; Claudia Faggian; Ichiro Hasuo; Akira Yoshimizu (CSL-LICS, 2014)

On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi. - Raphaëlle Crubillé; Ugo Dal Lago (ESOP, 2014)

Measurements in Proof Nets as Higher-Order Quantum Circuits. - Akira Yoshimizu; Ichiro Hasuo; Claudia Faggian; Ugo Dal Lago (ESOP, 2014)

Probabilistic Recursion Theory and Implicit Computational Complexity. - Ugo Dal Lago; Sara Zuppiroli (ICTAC, 2014)

On coinductive equivalences for higher-order probabilistic functional programs. - Ugo Dal Lago; Davide Sangiorgi; Michele Alberti (POPL, 2014)

Beta Reduction is Invariant, Indeed (Long Version). - Beniamino Accattoli; Ugo Dal Lago (CoRR, 2014)

On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (Long Version). - Raphaëlle Crubillé; Ugo Dal Lago (CoRR, 2014)

The Geometry of Synchronization (Long Version). - Ugo Dal Lago; Claudia Faggian; Ichiro Hasuo; Akira Yoshimizu (CoRR, 2014)

Probabilistic Recursion Theory and Implicit Computational Complexity (Long Version). - Ugo Dal Lago; Sara Zuppiroli (CoRR, 2014)

Wave-Style Token Machines and Quantum Lambda Calculi. - Ugo Dal Lago; Margherita Zorzi (LINEARITY, 2014)

Probabilistic Recursion Theory and Implicit Computational Complexity. - Ugo Dal Lago; Sara Zuppiroli; Maurizio Gabbrielli (Sci. Ann. Comput. Sci., 2014)

Linear dependent types in a call-by-value scenario. - Ugo Dal Lago; Barbara Petit (Sci. Comput. Program., 2014)

On Applicative Similarity, Sequentiality, and Full Abstraction. - Raphaëlle Crubillé; Ugo Dal Lago; Davide Sangiorgi; Valeria Vignudelli (Correct System Design, 2015)

On Coinduction and Quantum Lambda Calculi. - Yuxin Deng; Yuan Feng 001; Ugo Dal Lago (CONCUR, 2015)

On Equivalences, Metrics, and Polynomial Time. - Alberto Cappai; Ugo Dal Lago (FCT, 2015)

Applicative Bisimulation and Quantum λ-Calculi. - Ugo Dal Lago; Alessandro Rioli (FSEN, 2015)

Analysing the complexity of functional programs: higher-order meets first-order. - Martin Avanzini; Ugo Dal Lago; Georg Moser (ICFP, 2015)

Metric Reasoning about λ-Terms: The Affine Case. - Raphaëlle Crubillé; Ugo Dal Lago (LICS, 2015)

Parallelism and Synchronization in an Infinitary Context. - Ugo Dal Lago; Claudia Faggian; Benoît Valiron; Akira Yoshimizu (LICS, 2015)

On Sharing, Memoization, and Polynomial Time (Long Version). - Martin Avanzini; Ugo Dal Lago (CoRR, 2015)

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). - Martin Avanzini; Ugo Dal Lago; Georg Moser (CoRR, 2015)

On Equivalences, Metrics, and Polynomial Time (Long Version). - Alberto Cappai; Ugo Dal Lago (CoRR, 2015)

Metric Reasoning about λ-Terms: the Affine Case (Long Version). - Raphaëlle Crubillé; Ugo Dal Lago (CoRR, 2015)

Parallelism and Synchronization in an Infinitary Context (Long Version). - Ugo Dal Lago; Claudia Faggian; Benoît Valiron; Akira Yoshimizu (CoRR, 2015)

Applicative Bisimulation and Quantum λ-Calculi (Long Version). - Ugo Dal Lago; Alessandro Rioli (CoRR, 2015)

A higher-order characterization of probabilistic polynomial time. - Ugo Dal Lago; Paolo Parisen Toldin (Inf. Comput., 2015)

Developments in Implicit Complexity (DICE 2012). - Ugo Dal Lago; Guillaume Bonfante (Theor. Comput. Sci., 2015)

A lambda-calculus foundation for universal probabilistic programming. - Johannes Borgström; Ugo Dal Lago; Andrew D. Gordon 001; Marcin Szymczak 002 (ICFP, 2016)

Infinitary Lambda Calculi from a Linear Perspective. - Ugo Dal Lago (LICS, 2016)

(Leftmost-Outermost) Beta Reduction is Invariant, Indeed. - Beniamino Accattoli; Ugo Dal Lago (Log. Methods Comput. Sci., 2016)

Infinitary λ-Calculi from a Linear Perspective (Long Version). - Ugo Dal Lago (CoRR, 2016)

Higher-order interpretations and program complexity. - Patrick Baillot; Ugo Dal Lago (Inf. Comput., 2016)

Computation by interaction for space-bounded functional programming. - Ugo Dal Lago; Ulrich Schöpp (Inf. Comput., 2016)

On session types and polynomial time. - Ugo Dal Lago; Paolo Di Giamberardino (Math. Struct. Comput. Sci., 2016)

Metric Reasoning About lambda -Terms: The General Case. - Raphaëlle Crubillé; Ugo Dal Lago (ESOP, 2017)

Effectful applicative bisimilarity: Monads, relators, and Howe's method. - Ugo Dal Lago; Francesco Gavazzo; Paul Blain Levy (LICS, 2017)

The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens. - Ugo Dal Lago; Ryo Tanaka; Akira Yoshimizu (LICS, 2017)

The geometry of parallelism: classical, probabilistic, and quantum effects. - Ugo Dal Lago; Claudia Faggian; Benoît Valiron; Akira Yoshimizu (POPL, 2017)

Automated Sized-Type Inference and Complexity Analysis. - Martin Avanzini; Ugo Dal Lago (DICE-FOPARA@ETAPS, 2017)

Automating Sized Type Inference for Complexity Analysis (Technical Report). - Martin Avanzini; Ugo Dal Lago (CoRR, 2017)

On Higher-Order Probabilistic Subrecursion (Long Version). - Flavien Breuvart; Ugo Dal Lago; Agathe Herrou (CoRR, 2017)

Metric Reasoning About λ-Terms: The General Case (Long Version). - Raphaëlle Crubillé; Ugo Dal Lago (CoRR, 2017)

Probabilistic Termination by Monadic Affine Sized Typing (Long Version). - Ugo Dal Lago; Charles Grellois (CoRR, 2017)

Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method (Long Version). - Ugo Dal Lago; Francesco Gavazzo; Paul Blain Levy (CoRR, 2017)

The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens (Long Version). - Ugo Dal Lago; Ryo Tanaka; Akira Yoshimizu (CoRR, 2017)

Encoding Turing Machines into the Deterministic Lambda-Calculus. - Ugo Dal Lago; Beniamino Accattoli (CoRR, 2017)

Automating sized-type inference for complexity analysis. - Martin Avanzini; Ugo Dal Lago (Proc. ACM Program. Lang., 2017)

On Randomised Strategies in the λ-calculus. - Ugo Dal Lago; Gabriele Vanoni (ICTCS, 2018)

On Intersection Types and Probabilistic Lambda Calculi. - Flavien Breuvart; Ugo Dal Lago (PPDP, 2018)

On Randomised Strategies in the λ-Calculus (Long Version). - Ugo Dal Lago; Gabriele Vanoni (CoRR, 2018)

On sharing, memoization, and polynomial time. - Martin Avanzini; Ugo Dal Lago (Inf. Comput., 2018)

Effectful Normal Form Bisimulation. - Ugo Dal Lago; Francesco Gavazzo (ESOP, 2019)

Differential Logical Relations, Part I: The Simply-Typed Case. - Ugo Dal Lago; Francesco Gavazzo; Akira Yoshimizu (ICALP, 2019)

Type-Based Complexity Analysis of Probabilistic Functional Programs. - Martin Avanzini; Ugo Dal Lago; Alexis Ghyselen (LICS, 2019)

On the Taylor Expansion of Probabilistic lambda-terms. - Ugo Dal Lago; Thomas Leventis (FSCD, 2019)

On the Taylor Expansion of Probabilistic λ-Terms (Long Version). - Ugo Dal Lago; Thomas Leventis (CoRR, 2019)

Differential Logical Relations, Part I: The Simply-Typed Case (Long Version). - Ugo Dal Lago; Francesco Gavazzo; Akira Yoshimizu (CoRR, 2019)

On Bisimilarity in Lambda Calculi with Continuous Probabilistic Choice. - Ugo Dal Lago; Francesco Gavazzo (MFPS, 2019)

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. - Patrick Baillot; Gilles Barthe; Ugo Dal Lago (J. Autom. Reason., 2019)

Intersection types and runtime errors in the pi-calculus. - Ugo Dal Lago; Marc de Visme; Damiano Mazza; Akira Yoshimizu (Proc. ACM Program. Lang., 2019)

Probabilistic Termination by Monadic Affine Sized Typing. - Ugo Dal Lago; Charles Grellois (ACM Trans. Program. Lang. Syst., 2019)

On Probabilistic λ-Calculi. - Ugo Dal Lago (Foundations of Probabilistic Programming, 2020)

On the Versatility of Open Logical Relations - Continuity, Automatic Differentiation, and a Containment Theorem. - Gilles Barthe; Raphaëlle Crubillé; Ugo Dal Lago; Francesco Gavazzo (ESOP, 2020)

Decomposing Probabilistic Lambda-Calculi. - Ugo Dal Lago; Giulio Guerrieri; Willem Heijltjes (FoSSaCS, 2020)

Solvability in a Probabilistic Setting (Invited Talk). - Simona Ronchi Della Rocca; Ugo Dal Lago; Claudia Faggian (FSCD, 2020)

On Higher-Order Cryptography. - Boaz Barak; Raphaëlle Crubillé; Ugo Dal Lago (ICALP, 2020)

The Machinery of Interaction. - Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni (PPDP, 2020)

A Diagrammatic Calculus for Algebraic Effects. - Ugo Dal Lago; Francesco Gavazzo (CoRR, 2020)

The Abstract Machinery of Interaction (Long Version). - Ugo Dal Lago; Beniamino Accattoli; Gabriele Vanoni (CoRR, 2020)

On Higher-Order Cryptography (Long Version). - Boaz Barak; Raphaëlle Crubillé; Ugo Dal Lago (CoRR, 2020)

On the Termination Problem for Probabilistic Higher-Order Recursive Programs. - Naoki Kobayashi 001; Ugo Dal Lago; Charles Grellois (Log. Methods Comput. Sci., 2020)

On probabilistic term rewriting. - Martin Avanzini; Ugo Dal Lago; Akihisa Yamada 002 (Sci. Comput. Program., 2020)

Effectful applicative similarity for call-by-name lambda calculi. - Ugo Dal Lago; Francesco Gavazzo; Ryo Tanaka (Theor. Comput. Sci., 2020)

On randomised strategies in the λ-calculus. - Ugo Dal Lago; Gabriele Vanoni (Theor. Comput. Sci., 2020)

On Measure Quantifiers in First-Order Arithmetic. - Melissa Antonelli; Ugo Dal Lago; Paolo Pistone (CiE, 2021)

Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Programs. - Ugo Dal Lago; Francesco Gavazzo (FSCD, 2021)

The Space of Interaction. - Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni (LICS, 2021)

A Recursion-Theoretic Characterization of the Probabilistic Class PP. - Ugo Dal Lago; Reinhard Kahle; Isabel Oitavem (MFCS, 2021)

Modal Reasoning = Metric Reasoning, via Lawvere. - Ugo Dal Lago; Francesco Gavazzo (CoRR, 2021)

On Counting Propositional Logic. - Melissa Antonelli; Ugo Dal Lago; Paolo Pistone (CoRR, 2021)

On Measure Quantifiers in First-Order Arithmetic (Long Version). - Melissa Antonelli; Ugo Dal Lago; Paolo Pistone (CoRR, 2021)

The Space of Interaction (long version). - Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni (CoRR, 2021)

Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Systems. - Ugo Dal Lago; Francesco Gavazzo (CoRR, 2021)

On Higher-Order Probabilistic Subrecursion. - Flavien Breuvart; Ugo Dal Lago; Agathe Herrou (Log. Methods Comput. Sci., 2021)

The geometry of Bayesian programming. - Ugo Dal Lago; Naohiko Hoshino (Math. Struct. Comput. Sci., 2021)

The (In)Efficiency of interaction. - Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni (Proc. ACM Program. Lang., 2021)

On continuation-passing transformations and expected cost analysis. - Martin Avanzini; Gilles Barthe; Ugo Dal Lago (Proc. ACM Program. Lang., 2021)

Intersection types and (positive) almost-sure termination. - Ugo Dal Lago; Claudia Faggian; Simona Ronchi Della Rocca (Proc. ACM Program. Lang., 2021)

Differential logical relations, part II increments and derivatives. - Ugo Dal Lago; Francesco Gavazzo (Theor. Comput. Sci., 2021)

Tidy: Symbolic Verification of Timed Cryptographic Protocols. - Gilles Barthe; Ugo Dal Lago; Giulio Malavolta; Itsaka Rakotonirina (CCS, 2022)

On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments. - Ugo Dal Lago; Giulia Giusti (CONCUR, 2022)

On Quantitative Algebraic Higher-Order Theories. - Ugo Dal Lago; Furio Honsell; Marina Lenisa; Paolo Pistone (FSCD, 2022)

Curry and Howard Meet Borel. - Melissa Antonelli; Ugo Dal Lago; Paolo Pistone (LICS, 2022)

On Dynamic Lifting and Effect Typing in Circuit Description Languages. - Andrea Colledan; Ugo Dal Lago (TYPES, 2022)

Implicit recursion-theoretic characterizations of counting classes. - Ugo Dal Lago; Reinhard Kahle; Isabel Oitavem (Arch. Math. Log., 2022)

On Dynamic Lifting and Effect Typing in Circuit Description Languages (Extended Version). - Andrea Colledan; Ugo Dal Lago (CoRR, 2022)

On Reinforcement Learning, Effect Handlers, and the State Monad. - Ugo Dal Lago; Francesco Gavazzo; Alexis Ghyselen (CoRR, 2022)

On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments (Long Version). - Ugo Dal Lago; Giulia Giusti (CoRR, 2022)

Multi Types and Reasonable Space (Long Version). - Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni (CoRR, 2022)

On Feller Continuity and Full Abstraction (Long Version). - Gilles Barthe; Raphaëlle Crubillé; Ugo Dal Lago; Francesco Gavazzo (CoRR, 2022)

Open Higher-Order Logic (Long Version). - Ugo Dal Lago; Francesco Gavazzo; Alexis Ghyselen (CoRR, 2022)

Multi types and reasonable space. - Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni (Proc. ACM Program. Lang., 2022)

On Feller continuity and full abstraction. - Gilles Barthe; Raphaëlle Crubillé; Ugo Dal Lago; Francesco Gavazzo (Proc. ACM Program. Lang., 2022)

Effectful program distancing. - Ugo Dal Lago; Francesco Gavazzo (Proc. ACM Program. Lang., 2022)

A relational theory of effects and coeffects. - Ugo Dal Lago; Francesco Gavazzo (Proc. ACM Program. Lang., 2022)

Implicit computation complexity in higher-order programming languages: A Survey in Memory of Martin Hofmann. - Ugo Dal Lago (Math. Struct. Comput. Sci., 2022)

Contextual Behavioural Metrics. - Ugo Dal Lago; Maurizio Murgia 001 (CONCUR, 2023)

Open Higher-Order Logic. - Ugo Dal Lago; Francesco Gavazzo; Alexis Ghyselen (CSL, 2023)

On the Lattice of Program Metrics. - Ugo Dal Lago; Naohiko Hoshino; Paolo Pistone (FSCD, 2023)

(Not So) Boring Abstract Machines. - Ugo Dal Lago; Gabriele Vanoni (ICTCS, 2023)

An Arithmetic Theory for the Poly-Time Random Functions. - Melissa Antonelli; Ugo Dal Lago; Davide Davoli 001; Isabel Oitavem; Paolo Pistone (CoRR, 2023)

A Log-Sensitive Encoding of Turing Machines in the λ-Calculus. - Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni (CoRR, 2023)

Contextual Behavioural Metrics (Extended Version). - Ugo Dal Lago; Maurizio Murgia 001 (CoRR, 2023)

On Model-Checking Higher-Order Effectful Programs (Long Version). - Ugo Dal Lago; Alexis Ghyselen (CoRR, 2023)

Circuit Width Estimation via Effect Typing and Linear Dependency (Long Version). - Andrea Colledan; Ugo Dal Lago (CoRR, 2023)

Preface to the special issue on metric and differential semantics. - Ugo Dal Lago; Francesco Gavazzo; Paolo Pistone (Math. Struct. Comput. Sci., 2023)

On counting propositional logic and Wagner's hierarchy. - Melissa Antonelli; Ugo Dal Lago; Paolo Pistone (Theor. Comput. Sci., 2023)

On Computational Indistinguishability and Logical Relations. - Ugo Dal Lago; Zeinab Galal; Giulia Giusti (APLAS, 2024)

On Separation Logic, Computational Independence, and Pseudorandomness. - Ugo Dal Lago; Davide Davoli 001; Bruce M. Kapron (CSF, 2024)

Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. - Melissa Antonelli; Ugo Dal Lago; Davide Davoli 001; Isabel Oitavem; Paolo Pistone (CSL, 2024)

Circuit Width Estimation via Effect Typing and Linear Dependency. - Andrea Colledan; Ugo Dal Lago (ESOP (2), 2024)

On Basic Feasible Functionals and the Interpretation Method. - Patrick Baillot; Ugo Dal Lago; Cynthia Kop; Deivid Vale (FoSSaCS (2), 2024)

On the Almost-Sure Termination of Binary Sessions. - Ugo Dal Lago; Luca Padovani (PPDP, 2024)

Towards Quantum Multiparty Session Types. - Ivan Lanese; Ugo Dal Lago; Vikraman Choudhury (SEFM, 2024)

Towards logical foundations for probabilistic computation. - Melissa Antonelli; Ugo Dal Lago; Paolo Pistone (Ann. Pure Appl. Log., 2024)

On Separation Logic, Computational Independence, and Pseudorandomness (Extended Version). - Ugo Dal Lago; Davide Davoli 001; Bruce M. Kapron (CoRR, 2024)

On Randomized Computational Models and Complexity Classes: a Historical Overview. - Melissa Antonelli; Ugo Dal Lago; Paolo Pistone (CoRR, 2024)

Reasonable Space for the λ-Calculus, Logarithmically. - Beniamino Accattoli; Ugo Dal Lago; Gabriele Vanoni (Log. Methods Comput. Sci., 2024)

Preface. - Ugo Dal Lago; Daniele Gorla (Theor. Comput. Sci., 2024)

On Model-Checking Higher-Order Effectful Programs. - Ugo Dal Lago; Alexis Ghyselen (Proc. ACM Program. Lang., 2024)

On the Metric Nature of (Differential) Logical Relations. - Ugo Dal Lago; Naohiko Hoshino; Paolo Pistone (FSCD, 2025)

Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages. - Andrea Colledan; Ugo Dal Lago (Proc. ACM Program. Lang., 2025)

Linearization via Rewriting (Long Version). - Ugo Dal Lago; Federico Olimpieri (CoRR, 2025)