default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUgo Dal Lago
Person information
- affiliation: Università degli Studi di Bologna, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j54]Andrea Colledan
, Ugo Dal Lago:
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages. Proc. ACM Program. Lang. 9(POPL): 1386-1416 (2025)- [i82]Ugo Dal Lago, Federico Olimpieri:
Linearization via Rewriting (Long Version). CoRR abs/2503.04408 (2025) - 2024
- [j53]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
Towards logical foundations for probabilistic computation. Ann. Pure Appl. Log. 175(9): 103341 (2024) - [j52]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Reasonable Space for the λ-Calculus, Logarithmically. Log. Methods Comput. Sci. 20(4) (2024) - [j51]Ugo Dal Lago, Alexis Ghyselen:
On Model-Checking Higher-Order Effectful Programs. Proc. ACM Program. Lang. 8(POPL): 2610-2638 (2024) - [j50]Ugo Dal Lago, Daniele Gorla:
Preface. Theor. Comput. Sci. 1010: 114716 (2024) - [c97]Ugo Dal Lago, Zeinab Galal, Giulia Giusti:
On Computational Indistinguishability and Logical Relations. APLAS 2024: 241-263 - [c96]Ugo Dal Lago, Davide Davoli, Bruce M. Kapron:
On Separation Logic, Computational Independence, and Pseudorandomness. CSF 2024: 80-95 - [c95]Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone:
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. CSL 2024: 10:1-10:19 - [c94]Andrea Colledan, Ugo Dal Lago:
Circuit Width Estimation via Effect Typing and Linear Dependency. ESOP (2) 2024: 3-30 - [c93]Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale:
On Basic Feasible Functionals and the Interpretation Method. FoSSaCS (2) 2024: 70-91 - [c92]Ugo Dal Lago, Luca Padovani:
On the Almost-Sure Termination of Binary Sessions. PPDP 2024: 9:1-9:12 - [c91]Ivan Lanese, Ugo Dal Lago, Vikraman Choudhury:
Towards Quantum Multiparty Session Types. SEFM 2024: 385-403 - [e7]Pawel Sobocinski, Ugo Dal Lago, Javier Esparza:
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024. ACM 2024 [contents] - [i81]Patrick Baillot, Ugo Dal Lago, Cynthia Kop, Deivid Vale:
On Basic Feasible Functionals and the Interpretation Method. CoRR abs/2401.12385 (2024) - [i80]Ugo Dal Lago, Davide Davoli, Bruce M. Kapron:
On Separation Logic, Computational Independence, and Pseudorandomness (Extended Version). CoRR abs/2405.11987 (2024) - [i79]Andrea Colledan, Ugo Dal Lago:
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages. CoRR abs/2408.03121 (2024) - [i78]Ugo Dal Lago, Zeinab Galal, Giulia Giusti:
On Computational Indistinguishability and Logical Relations. CoRR abs/2408.17340 (2024) - [i77]Ivan Lanese, Ugo Dal Lago, Vikraman Choudhury:
Towards Quantum Multiparty Session Types. CoRR abs/2409.11133 (2024) - [i76]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
On Randomized Computational Models and Complexity Classes: a Historical Overview. CoRR abs/2409.11999 (2024) - 2023
- [j49]Ugo Dal Lago, Francesco Gavazzo, Paolo Pistone:
Preface to the special issue on metric and differential semantics. Math. Struct. Comput. Sci. 33(4-5): 180-181 (2023) - [j48]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
On counting propositional logic and Wagner's hierarchy. Theor. Comput. Sci. 966-967: 113928 (2023) - [c90]Ugo Dal Lago, Maurizio Murgia:
Contextual Behavioural Metrics. CONCUR 2023: 38:1-38:17 - [c89]Ugo Dal Lago, Francesco Gavazzo, Alexis Ghyselen:
Open Higher-Order Logic. CSL 2023: 17:1-17:17 - [c88]Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone:
On the Lattice of Program Metrics. FSCD 2023: 20:1-20:19 - [c87]Ugo Dal Lago, Gabriele Vanoni:
(Not So) Boring Abstract Machines. ICTCS 2023: 225-240 - [i75]Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone:
An Arithmetic Theory for the Poly-Time Random Functions. CoRR abs/2301.12028 (2023) - [i74]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
A Log-Sensitive Encoding of Turing Machines in the λ-Calculus. CoRR abs/2301.12556 (2023) - [i73]Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone:
On the Lattice of Program Metrics. CoRR abs/2302.05022 (2023) - [i72]Ugo Dal Lago, Maurizio Murgia:
Contextual Behavioural Metrics (Extended Version). CoRR abs/2307.07400 (2023) - [i71]Ugo Dal Lago, Alexis Ghyselen:
On Model-Checking Higher-Order Effectful Programs (Long Version). CoRR abs/2308.16542 (2023) - [i70]Andrea Colledan, Ugo Dal Lago:
Circuit Width Estimation via Effect Typing and Linear Dependency (Long Version). CoRR abs/2310.19096 (2023) - [i69]Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone:
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. CoRR abs/2311.15003 (2023) - 2022
- [j47]Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem:
Implicit recursion-theoretic characterizations of counting classes. Arch. Math. Log. 61(7-8): 1129-1144 (2022) - [j46]Ugo Dal Lago:
Implicit computation complexity in higher-order programming languages: A Survey in Memory of Martin Hofmann. Math. Struct. Comput. Sci. 32(6): 760-776 (2022) - [j45]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Multi types and reasonable space. Proc. ACM Program. Lang. 6(ICFP): 799-825 (2022) - [j44]Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, Francesco Gavazzo:
On Feller continuity and full abstraction. Proc. ACM Program. Lang. 6(ICFP): 826-854 (2022) - [j43]Ugo Dal Lago, Francesco Gavazzo:
Effectful program distancing. Proc. ACM Program. Lang. 6(POPL): 1-30 (2022) - [j42]Ugo Dal Lago, Francesco Gavazzo:
A relational theory of effects and coeffects. Proc. ACM Program. Lang. 6(POPL): 1-28 (2022) - [c86]Gilles Barthe, Ugo Dal Lago, Giulio Malavolta, Itsaka Rakotonirina:
Tidy: Symbolic Verification of Timed Cryptographic Protocols. CCS 2022: 263-276 - [c85]Ugo Dal Lago, Giulia Giusti:
On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments. CONCUR 2022: 37:1-37:18 - [c84]Ugo Dal Lago, Furio Honsell, Marina Lenisa, Paolo Pistone:
On Quantitative Algebraic Higher-Order Theories. FSCD 2022: 4:1-4:18 - [c83]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
Curry and Howard Meet Borel. LICS 2022: 45:1-45:13 - [c82]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Reasonable Space for the λ-Calculus, Logarithmically. LICS 2022: 47:1-47:13 - [c81]Andrea Colledan, Ugo Dal Lago:
On Dynamic Lifting and Effect Typing in Circuit Description Languages. TYPES 2022: 3:1-3:21 - [e6]Ugo Dal Lago, Daniele Gorla:
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, ICTCS 2022, Rome, Italy, September 7-9, 2022. CEUR Workshop Proceedings 3284, CEUR-WS.org 2022 [contents] - [i68]Andrea Colledan, Ugo Dal Lago:
On Dynamic Lifting and Effect Typing in Circuit Description Languages (Extended Version). CoRR abs/2202.07636 (2022) - [i67]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Reasonable Space for the λ-Calculus, Logarithmically. CoRR abs/2203.00362 (2022) - [i66]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
Curry and Howard Meet Borel. CoRR abs/2203.11265 (2022) - [i65]Ugo Dal Lago, Francesco Gavazzo, Alexis Ghyselen:
On Reinforcement Learning, Effect Handlers, and the State Monad. CoRR abs/2203.15426 (2022) - [i64]Ugo Dal Lago, Furio Honsell, Marina Lenisa, Paolo Pistone:
On Quantitative Algebraic Higher-Order Theories. CoRR abs/2204.13654 (2022) - [i63]Ugo Dal Lago, Giulia Giusti:
On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments (Long Version). CoRR abs/2207.03360 (2022) - [i62]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Multi Types and Reasonable Space (Long Version). CoRR abs/2207.08795 (2022) - [i61]Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, Francesco Gavazzo:
On Feller Continuity and Full Abstraction (Long Version). CoRR abs/2207.10590 (2022) - [i60]Ugo Dal Lago, Francesco Gavazzo, Alexis Ghyselen:
Open Higher-Order Logic (Long Version). CoRR abs/2211.06671 (2022) - 2021
- [j41]Flavien Breuvart, Ugo Dal Lago, Agathe Herrou:
On Higher-Order Probabilistic Subrecursion. Log. Methods Comput. Sci. 17(4) (2021) - [j40]Ugo Dal Lago, Naohiko Hoshino:
The geometry of Bayesian programming. Math. Struct. Comput. Sci. 31(6): 633-681 (2021) - [j39]Martin Avanzini, Gilles Barthe, Ugo Dal Lago:
On continuation-passing transformations and expected cost analysis. Proc. ACM Program. Lang. 5(ICFP): 1-30 (2021) - [j38]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The (In)Efficiency of interaction. Proc. ACM Program. Lang. 5(POPL): 1-33 (2021) - [j37]Ugo Dal Lago, Claudia Faggian, Simona Ronchi Della Rocca:
Intersection types and (positive) almost-sure termination. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - [j36]Ugo Dal Lago, Francesco Gavazzo:
Differential logical relations, part II increments and derivatives. Theor. Comput. Sci. 895: 34-47 (2021) - [c80]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
On Measure Quantifiers in First-Order Arithmetic. CiE 2021: 12-24 - [c79]Ugo Dal Lago, Francesco Gavazzo:
Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Programs. FSCD 2021: 23:1-23:19 - [c78]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
On Counting Propositional Logic and Wagner's Hierarchy. ICTCS 2021: 107-121 - [c77]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The Space of Interaction. LICS 2021: 1-13 - [c76]Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem:
A Recursion-Theoretic Characterization of the Probabilistic Class PP. MFCS 2021: 35:1-35:12 - [e5]Ugo Dal Lago, Valeria de Paiva:
Proceedings Second Joint International Workshop on Linearity & Trends in Linear Logic and Applications, Linearity&TLLA@IJCAR-FSCD 2020, Online, 29-30 June 2020. EPTCS 353, 2021 [contents] - [i59]Ugo Dal Lago, Francesco Gavazzo:
Modal Reasoning = Metric Reasoning, via Lawvere. CoRR abs/2103.03871 (2021) - [i58]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
On Counting Propositional Logic. CoRR abs/2103.12862 (2021) - [i57]Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
On Measure Quantifiers in First-Order Arithmetic (Long Version). CoRR abs/2104.12124 (2021) - [i56]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The Space of Interaction (long version). CoRR abs/2104.13795 (2021) - [i55]Ugo Dal Lago, Francesco Gavazzo:
Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Systems. CoRR abs/2106.12849 (2021) - 2020
- [j35]Naoki Kobayashi, Ugo Dal Lago, Charles Grellois:
On the Termination Problem for Probabilistic Higher-Order Recursive Programs. Log. Methods Comput. Sci. 16(4) (2020) - [j34]Martin Avanzini, Ugo Dal Lago, Akihisa Yamada:
On probabilistic term rewriting. Sci. Comput. Program. 185 (2020) - [j33]Ugo Dal Lago, Gabriele Vanoni:
On randomised strategies in the λ-calculus. Theor. Comput. Sci. 813: 100-116 (2020) - [j32]Ugo Dal Lago, Francesco Gavazzo, Ryo Tanaka:
Effectful applicative similarity for call-by-name lambda calculi. Theor. Comput. Sci. 813: 234-247 (2020) - [c75]Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, Francesco Gavazzo:
On the Versatility of Open Logical Relations - Continuity, Automatic Differentiation, and a Containment Theorem. ESOP 2020: 56-83 - [c74]Ugo Dal Lago, Giulio Guerrieri, Willem Heijltjes:
Decomposing Probabilistic Lambda-Calculi. FoSSaCS 2020: 136-156 - [c73]Simona Ronchi Della Rocca, Ugo Dal Lago, Claudia Faggian:
Solvability in a Probabilistic Setting (Invited Talk). FSCD 2020: 1:1-1:17 - [c72]Boaz Barak, Raphaëlle Crubillé, Ugo Dal Lago:
On Higher-Order Cryptography. ICALP 2020: 108:1-108:16 - [c71]Ugo Dal Lago, Francesco Gavazzo:
Differential Logical Relations Part II: Increments and Derivatives. ICTCS 2020: 101-114 - [c70]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The Machinery of Interaction. PPDP 2020: 4:1-4:15 - [p1]Ugo Dal Lago:
On Probabilistic λ-Calculi. Foundations of Probabilistic Programming 2020: 121-144 - [i54]Ugo Dal Lago, Francesco Gavazzo:
A Diagrammatic Calculus for Algebraic Effects. CoRR abs/2001.01337 (2020) - [i53]Ugo Dal Lago, Beniamino Accattoli, Gabriele Vanoni:
The Abstract Machinery of Interaction (Long Version). CoRR abs/2002.05649 (2020) - [i52]Boaz Barak, Raphaëlle Crubillé, Ugo Dal Lago:
On Higher-Order Cryptography (Long Version). CoRR abs/2002.07218 (2020) - [i51]Ugo Dal Lago, Giulio Guerrieri, Willem Heijltjes:
Decomposing Probabilistic Lambda-calculi. CoRR abs/2002.08392 (2020) - [i50]Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, Francesco Gavazzo:
On the Versatility of Open Logical Relations: Continuity, Automatic Differentiation, and a Containment Theorem. CoRR abs/2002.08489 (2020) - [i49]Ugo Dal Lago, Claudia Faggian, Simona Ronchi Della Rocca:
Intersection Types and (Positive) Almost-Sure Termination. CoRR abs/2010.12689 (2020) - [i48]Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The (In)Efficiency of Interaction. CoRR abs/2010.12988 (2020)
2010 – 2019
- 2019
- [j31]Patrick Baillot, Gilles Barthe, Ugo Dal Lago:
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. J. Autom. Reason. 63(4): 813-855 (2019) - [j30]Ugo Dal Lago, Marc de Visme, Damiano Mazza, Akira Yoshimizu:
Intersection types and runtime errors in the pi-calculus. Proc. ACM Program. Lang. 3(POPL): 7:1-7:29 (2019) - [j29]Ugo Dal Lago, Charles Grellois:
Probabilistic Termination by Monadic Affine Sized Typing. ACM Trans. Program. Lang. Syst. 41(2): 10:1-10:65 (2019) - [c69]Ugo Dal Lago, Francesco Gavazzo:
Effectful Normal Form Bisimulation. ESOP 2019: 263-292 - [c68]Ugo Dal Lago, Francesco Gavazzo, Akira Yoshimizu:
Differential Logical Relations, Part I: The Simply-Typed Case. ICALP 2019: 111:1-111:14 - [c67]Martin Avanzini, Ugo Dal Lago, Alexis Ghyselen:
Type-Based Complexity Analysis of Probabilistic Functional Programs. LICS 2019: 1-13 - [c66]Naoki Kobayashi, Ugo Dal Lago, Charles Grellois:
On the Termination Problem for Probabilistic Higher-Order Recursive Programs. LICS 2019: 1-14 - [c65]Ugo Dal Lago, Naohiko Hoshino:
The Geometry of Bayesian Programming. LICS 2019: 1-13 - [c64]Ugo Dal Lago, Thomas Leventis:
On the Taylor Expansion of Probabilistic lambda-terms. FSCD 2019: 13:1-13:16 - [c63]Ugo Dal Lago, Francesco Gavazzo:
On Bisimilarity in Lambda Calculi with Continuous Probabilistic Choice. MFPS 2019: 121-141 - [i47]Ugo Dal Lago, Naohiko Hoshino:
The Geometry of Bayesian Programming. CoRR abs/1904.07425 (2019) - [i46]Ugo Dal Lago, Thomas Leventis:
On the Taylor Expansion of Probabilistic λ-Terms (Long Version). CoRR abs/1904.09650 (2019) - [i45]Ugo Dal Lago, Francesco Gavazzo, Akira Yoshimizu:
Differential Logical Relations, Part I: The Simply-Typed Case (Long Version). CoRR abs/1904.12137 (2019) - 2018
- [j28]Martin Avanzini, Ugo Dal Lago:
On sharing, memoization, and polynomial time. Inf. Comput. 261: 3-22 (2018) - [c62]Martin Avanzini, Ugo Dal Lago, Akihisa Yamada:
On Probabilistic Term Rewriting. FLOPS 2018: 132-148 - [c61]Ugo Dal Lago, Gabriele Vanoni:
On Randomised Strategies in the λ-calculus. ICTCS 2018: 92-103 - [c60]Flavien Breuvart, Ugo Dal Lago:
On Intersection Types and Probabilistic Lambda Calculi. PPDP 2018: 8:1-8:13 - [e4]Christel Baier, Ugo Dal Lago:
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. Lecture Notes in Computer Science 10803, Springer 2018, ISBN 978-3-319-89365-5 [contents] - [i44]Martin Avanzini, Ugo Dal Lago, Akihisa Yamada:
On Probabilistic Term Rewriting. CoRR abs/1802.09774 (2018) - [i43]Ugo Dal Lago, Gabriele Vanoni:
On Randomised Strategies in the λ-Calculus (Long Version). CoRR abs/1805.03934 (2018) - [i42]Naoki Kobayashi, Ugo Dal Lago, Charles Grellois:
On the Termination Problem for Probabilistic Higher-Order Recursive Programs. CoRR abs/1811.02133 (2018) - 2017
- [j27]Martin Avanzini, Ugo Dal Lago:
Automating sized-type inference for complexity analysis. Proc. ACM Program. Lang. 1(ICFP): 43:1-43:29 (2017) - [c59]Raphaëlle Crubillé, Ugo Dal Lago:
Metric Reasoning About \lambda -Terms: The General Case. ESOP 2017: 341-367 - [c58]Ugo Dal Lago, Charles Grellois:
Probabilistic Termination by Monadic Affine Sized Typing. ESOP 2017: 393-419 - [c57]Flavien Breuvart, Ugo Dal Lago, Agathe Herrou:
On Higher-Order Probabilistic Subrecursion. FoSSaCS 2017: 370-386 - [c56]Ugo Dal Lago, Francesco Gavazzo, Ryo Tanaka:
Effectful Applicative Similarity for Call-by-Name Lambda Calculi. ICTCS/CILC 2017: 87-98 - [c55]Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy:
Effectful applicative bisimilarity: Monads, relators, and Howe's method. LICS 2017: 1-12 - [c54]Ugo Dal Lago, Ryo Tanaka, Akira Yoshimizu:
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens. LICS 2017: 1-12 - [c53]Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu:
The geometry of parallelism: classical, probabilistic, and quantum effects. POPL 2017: 833-845 - [c52]Martin Avanzini, Ugo Dal Lago:
Automated Sized-Type Inference and Complexity Analysis. DICE-FOPARA@ETAPS 2017: 7-16 - [i41]Ugo Dal Lago, Charles Grellois:
Probabilistic Termination by Monadic Affine Sized Typing (Long Version). CoRR abs/1701.04089 (2017) - [i40]Flavien Breuvart, Ugo Dal Lago, Agathe Herrou:
On Higher-Order Probabilistic Subrecursion (Long Version). CoRR abs/1701.04786 (2017) - [i39]Raphaëlle Crubillé, Ugo Dal Lago:
Metric Reasoning About λ-Terms: The General Case (Long Version). CoRR abs/1701.05521 (2017) - [i38]Ugo Dal Lago, Ryo Tanaka, Akira Yoshimizu:
The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens (Long Version). CoRR abs/1704.04620 (2017) - [i37]Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy:
Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method (Long Version). CoRR abs/1704.04647 (2017) - [i36]Martin Avanzini, Ugo Dal Lago:
Automating Sized Type Inference for Complexity Analysis (Technical Report). CoRR abs/1706.09169 (2017) - [i35]Ugo Dal Lago, Beniamino Accattoli:
Encoding Turing Machines into the Deterministic Lambda-Calculus. CoRR abs/1711.10078 (2017) - 2016
- [j26]Beniamino Accattoli, Ugo Dal Lago:
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed. Log. Methods Comput. Sci. 12(1) (2016) - [j25]Patrick Baillot, Ugo Dal Lago:
Higher-order interpretations and program complexity. Inf. Comput. 248: 56-81 (2016) - [j24]Ugo Dal Lago, Ulrich Schöpp:
Computation by interaction for space-bounded functional programming. Inf. Comput. 248: 150-194 (2016) - [j23]Ugo Dal Lago, Simone Martini, Davide Sangiorgi:
Light logics and higher-order processes. Math. Struct. Comput. Sci. 26(6): 969-992 (2016) - [j22]Ugo Dal Lago, Paolo Di Giamberardino:
On session types and polynomial time. Math. Struct. Comput. Sci. 26(8): 1433-1458 (2016) - [c51]Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, Marcin Szymczak:
A lambda-calculus foundation for universal probabilistic programming. ICFP 2016: 33-46 - [c50]Ugo Dal Lago:
Infinitary Lambda Calculi from a Linear Perspective. LICS 2016: 447-456 - [e3]Marko C. J. D. van Eekelen, Ugo Dal Lago:
Foundational and Practical Aspects of Resource Analysis - 4th International Workshop, FOPARA 2015, London, UK, April 11, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9964, 2016, ISBN 978-3-319-46558-6 [contents] - [i34]Ugo Dal Lago:
Infinitary λ-Calculi from a Linear Perspective (Long Version). CoRR abs/1604.08248 (2016) - [i33]Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu:
The Geometry of Parallelism. Classical, Probabilistic, and Quantum Effects. CoRR abs/1610.09629 (2016) - 2015
- [j21]Ugo Dal Lago, Paolo Parisen Toldin:
A higher-order characterization of probabilistic polynomial time. Inf. Comput. 241: 114-141 (2015) - [j20]Ugo Dal Lago, Guillaume Bonfante:
Developments in Implicit Complexity (DICE 2012). Theor. Comput. Sci. 585: 1-2 (2015) - [c49]Raphaëlle Crubillé, Ugo Dal Lago, Davide Sangiorgi, Valeria Vignudelli:
On Applicative Similarity, Sequentiality, and Full Abstraction. Correct System Design 2015: 65-82 - [c48]Yuxin Deng, Yuan Feng, Ugo Dal Lago:
On Coinduction and Quantum Lambda Calculi. CONCUR 2015: 427-440 - [c47]Alberto Cappai, Ugo Dal Lago:
On Equivalences, Metrics, and Polynomial Time. FCT 2015: 311-323 - [c46]Ugo Dal Lago, Alessandro Rioli:
Applicative Bisimulation and Quantum λ-Calculi. FSEN 2015: 54-68 - [c45]Martin Avanzini, Ugo Dal Lago, Georg Moser:
Analysing the complexity of functional programs: higher-order meets first-order. ICFP 2015: 152-164 - [c44]Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu:
Parallelism and Synchronization in an Infinitary Context. LICS 2015: 559-572 - [c43]Raphaëlle Crubillé, Ugo Dal Lago:
Metric Reasoning about λ-Terms: The Affine Case. LICS 2015: 633-644 - [c42]Patrick Baillot, Gilles Barthe, Ugo Dal Lago:
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs. LPAR 2015: 203-218 - [c41]Martin Avanzini, Ugo Dal Lago:
On Sharing, Memoization, and Polynomial Time. STACS 2015: 62-75 - [e2]Ugo Dal Lago, Russ Harmer:
Proceedings Tenth International Workshop on Developments in Computational Models, DCM 2014, Vienna, Austria, 13th July 2014. EPTCS 179, 2015 [contents] - [i32]Martin Avanzini, Ugo Dal Lago:
On Sharing, Memoization, and Polynomial Time (Long Version). CoRR abs/1501.00894 (2015) - [i31]Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu:
Parallelism and Synchronization in an Infinitary Context (Long Version). CoRR abs/1505.03635 (2015) - [i30]Raphaëlle Crubillé, Ugo Dal Lago:
Metric Reasoning about λ-Terms: the Affine Case (Long Version). CoRR abs/1505.03638 (2015) - [i29]Alberto Cappai, Ugo Dal Lago:
On Equivalences, Metrics, and Polynomial Time (Long Version). CoRR abs/1506.03710 (2015) - [i28]Martin Avanzini, Ugo Dal Lago, Georg Moser:
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). CoRR abs/1506.05043 (2015) - [i27]Ugo Dal Lago, Alessandro Rioli:
Applicative Bisimulation and Quantum λ-Calculi (Long Version). CoRR abs/1506.06661 (2015) - [i26]Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, Marcin Szymczak:
A Lambda-Calculus Foundation for Universal Probabilistic Programming. CoRR abs/1512.08990 (2015) - 2014
- [j19]Ugo Dal Lago, Sara Zuppiroli, Maurizio Gabbrielli:
Probabilistic Recursion Theory and Implicit Computational Complexity. Sci. Ann. Comput. Sci. 24(2): 177-216 (2014) - [j18]Ugo Dal Lago, Barbara Petit:
Linear dependent types in a call-by-value scenario. Sci. Comput. Program. 84: 77-100 (2014) - [c40]Beniamino Accattoli, Ugo Dal Lago:
Beta reduction is invariant, indeed. CSL-LICS 2014: 8:1-8:10 - [c39]Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, Akira Yoshimizu:
The geometry of synchronization. CSL-LICS 2014: 35:1-35:10 - [c38]Raphaëlle Crubillé, Ugo Dal Lago:
On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi. ESOP 2014: 209-228 - [c37]Akira Yoshimizu, Ichiro Hasuo, Claudia Faggian, Ugo Dal Lago:
Measurements in Proof Nets as Higher-Order Quantum Circuits. ESOP 2014: 371-391 - [c36]Ugo Dal Lago, Sara Zuppiroli:
Probabilistic Recursion Theory and Implicit Computational Complexity. ICTAC 2014: 97-114 - [c35]Ugo Dal Lago, Davide Sangiorgi, Michele Alberti:
On coinductive equivalences for higher-order probabilistic functional programs. POPL 2014: 297-308 - [c34]Ugo Dal Lago, Margherita Zorzi:
Wave-Style Token Machines and Quantum Lambda Calculi. LINEARITY 2014: 64-78 - [e1]Ugo Dal Lago, Ricardo Peña:
Foundational and Practical Aspects of Resource Analysis - Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8552, Springer 2014, ISBN 978-3-319-12465-0 [contents] - [i25]Raphaëlle Crubillé, Ugo Dal Lago:
On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (Long Version). CoRR abs/1401.3766 (2014) - [i24]Beniamino Accattoli, Ugo Dal Lago:
Beta Reduction is Invariant, Indeed (Long Version). CoRR abs/1405.3311 (2014) - [i23]Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo, Akira Yoshimizu:
The Geometry of Synchronization (Long Version). CoRR abs/1405.3427 (2014) - [i22]Ugo Dal Lago, Sara Zuppiroli:
Probabilistic Recursion Theory and Implicit Computational Complexity (Long Version). CoRR abs/1406.3378 (2014) - 2013
- [c33]Ugo Dal Lago, Giulio Pellitta:
Complexity Analysis in Presence of Control Operators and Higher-Order Functions. LPAR 2013: 258-273 - [c32]Ugo Dal Lago, Barbara Petit:
The geometry of types. POPL 2013: 167-178 - [i21]Ugo Dal Lago, Margherita Zorzi:
Wave-Style Token Machines and Quantum Lambda Calculi. CoRR abs/1307.0550 (2013) - [i20]Ugo Dal Lago, Giulio Pellitta:
Complexity Analysis in Presence of Control Operators and Higher-Order Functions (Long Version). CoRR abs/1310.1763 (2013) - [i19]Ugo Dal Lago, Davide Sangiorgi, Michele Alberti:
On Coinductive Equivalences for Higher-Order Probabilistic Functional Programs (Long Version). CoRR abs/1311.1722 (2013) - 2012
- [j17]Ugo Dal Lago, Simone Martini:
On Constructor Rewrite Systems and the Lambda Calculus. Log. Methods Comput. Sci. 8(3) (2012) - [j16]Ugo Dal Lago, Margherita Zorzi:
Probabilistic operational semantics for the lambda calculus. RAIRO Theor. Informatics Appl. 46(3): 413-450 (2012) - [j15]Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen:
On quasi-interpretations, blind abstractions and implicit complexity. Math. Struct. Comput. Sci. 22(4): 549-580 (2012) - [c31]Patrick Baillot, Ugo Dal Lago:
Higher-Order Interpretations and Program Complexity. CSL 2012: 62-76 - [c30]Ugo Dal Lago, Barbara Petit:
Linear dependent types in a call-by-value scenario. PPDP 2012: 115-126 - [c29]Beniamino Accattoli, Ugo Dal Lago:
On the Invariance of the Unitary Cost Model for Head Reduction. RTA 2012: 22-37 - [i18]Beniamino Accattoli, Ugo Dal Lago:
On the Invariance of the Unitary Cost Model for Head Reduction (Long Version). CoRR abs/1202.1641 (2012) - [i17]Ugo Dal Lago, Paolo Parisen Toldin:
An Higher-Order Characterization of Probabilistic Polynomial Time (Long Version). CoRR abs/1202.3317 (2012) - [i16]Ugo Dal Lago, Barbara Petit:
Linear Dependent Types in a Call-by-Value Scenario (Long Version). CoRR abs/1207.5592 (2012) - [i15]Ugo Dal Lago, Tobias Heindel, Damiano Mazza, Daniele Varacca:
Computational Complexity of Interactive Behaviors. CoRR abs/1209.0663 (2012) - [i14]Ugo Dal Lago, Barbara Petit:
The Geometry of Types (Long Version). CoRR abs/1210.6857 (2012) - 2011
- [j14]Ugo Dal Lago, Marco Gaboardi:
Linear Dependent Types and Relative Completeness. Log. Methods Comput. Sci. 8(4) (2011) - [j13]Patrick Baillot, Paolo Coppola, Ugo Dal Lago:
Light logics and optimal reduction: Completeness and complexity. Inf. Comput. 209(2): 118-142 (2011) - [j12]Ugo Dal Lago, Martin Hofmann:
Realizability models and implicit complexity. Theor. Comput. Sci. 412(20): 2029-2047 (2011) - [c28]Ugo Dal Lago:
A Short Introduction to Implicit Computational Complexity. ESSLLI 2011: 89-109 - [c27]Ugo Dal Lago, Paolo Parisen Toldin:
A Higher-Order Characterization of Probabilistic Polynomial Time. FOPARA 2011: 1-18 - [c26]Ugo Dal Lago, Marco Gaboardi:
Linear Dependent Types and Relative Completeness. LICS 2011: 133-142 - [c25]Ugo Dal Lago, Claudia Faggian:
On Multiplicative Linear Logic, Modality and Quantum Circuits. QPL 2011: 55-66 - [c24]Ugo Dal Lago, Paolo Di Giamberardino:
Soft Session Types. EXPRESS 2011: 59-73 - [i13]Ugo Dal Lago, Margherita Zorzi:
Probabilistic Operational Semantics for the Lambda Calculus. CoRR abs/1104.0195 (2011) - [i12]Ugo Dal Lago, Paolo Di Giamberardino:
Soft Session Types (Long Version). CoRR abs/1107.4478 (2011) - 2010
- [j11]Ugo Dal Lago, Martin Hofmann:
Bounded Linear Logic, Revisited. Log. Methods Comput. Sci. 6(4) (2010) - [j10]Ugo Dal Lago, Martin Hofmann:
A Semantic Proof of Polytime Soundness of Light Affine Logic. Theory Comput. Syst. 46(4): 673-689 (2010) - [j9]Ugo Dal Lago, Andrea Masini, Margherita Zorzi:
Quantum implicit computational complexity. Theor. Comput. Sci. 411(2): 377-409 (2010) - [c23]Ugo Dal Lago, Ulrich Schöpp:
Type Inference for Sublinear Space Functional Programming. APLAS 2010: 376-391 - [c22]Ugo Dal Lago, Ulrich Schöpp:
Functional Programming in Sublinear Space. ESOP 2010: 205-225 - [c21]Ugo Dal Lago, Simone Martini, Davide Sangiorgi:
Light Logics and Higher-Order Processes. EXPRESS 2010: 46-60 - [c20]Ugo Dal Lago, Simone Martini, Margherita Zorzi:
General Ramified Recurrence is Sound for Polynomial Time. DICE 2010: 47-62
2000 – 2009
- 2009
- [j8]Ugo Dal Lago, Andrea Masini, Margherita Zorzi:
On a measurement-free quantum lambda calculus with classical control. Math. Struct. Comput. Sci. 19(2): 297-335 (2009) - [j7]Ugo Dal Lago:
The geometry of linear higher-order recursion. ACM Trans. Comput. Log. 10(2): 8:1-8:38 (2009) - [j6]Ugo Dal Lago:
Context semantics, linear logic, and computational complexity. ACM Trans. Comput. Log. 10(4): 25:1-25:32 (2009) - [c19]Ugo Dal Lago, Simone Martini:
Derivational Complexity Is an Invariant Cost Model. FOPARA 2009: 100-113 - [c18]Ugo Dal Lago, Simone Martini:
On Constructor Rewrite Systems and the Lambda-Calculus. ICALP (2) 2009: 163-174 - [c17]Ugo Dal Lago, Luca Roversi, Luca Vercelli:
Taming Modal Impredicativity: Superlazy Reduction. LFCS 2009: 137-151 - [c16]Ugo Dal Lago, Martin Hofmann:
Bounded Linear Logic, Revisited. TLCA 2009: 80-94 - [c15]Ugo Dal Lago, Andrea Masini, Margherita Zorzi:
Confluence Results for a Quantum Lambda Calculus with Measurements. QPL@MFPS 2009: 251-261 - [i11]Ugo Dal Lago, Simone Martini:
On Constructor Rewrite Systems and the Lambda-Calculus. CoRR abs/0904.4120 (2009) - [i10]Ugo Dal Lago, Andrea Masini, Margherita Zorzi:
Confluence Results for a Quantum Lambda Calculus with Measurements. CoRR abs/0905.4567 (2009) - 2008
- [j5]Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca:
Light Logics and the Call-by-Value Lambda Calculus. Log. Methods Comput. Sci. 4(4) (2008) - [j4]Ugo Dal Lago, Simone Martini:
The weak lambda calculus as a reasonable machine. Theor. Comput. Sci. 398(1-3): 32-50 (2008) - [c14]Ugo Dal Lago, Olivier Laurent:
Quantitative Game Semantics for Linear Logic. CSL 2008: 230-245 - [c13]Ugo Dal Lago, Martin Hofmann:
A Semantic Proof of Polytime Soundness of Light Affine Logic. CSR 2008: 134-145 - [i9]Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca:
Light Logics and the Call-by-Value Lambda Calculus. CoRR abs/0809.0195 (2008) - [i8]Ugo Dal Lago, Luca Roversi, Luca Vercelli:
Taming Modal Impredicativity: Superlazy Reduction. CoRR abs/0810.2891 (2008) - 2007
- [j3]Ugo Dal Lago, Angelo Montanari, Gabriele Puppis:
Compact and tractable automaton-based representations of time granularities. Theor. Comput. Sci. 373(1-2): 115-141 (2007) - [c12]Patrick Baillot, Paolo Coppola, Ugo Dal Lago:
Light Logics and Optimal Reduction: Completeness and Complexity. LICS 2007: 421-430 - [c11]Ugo Dal Lago, Angelo Montanari, Gabriele Puppis:
On the Equivalence of Automaton-Based Representations of Time Granularities. TIME 2007: 82-93 - [i7]Patrick Baillot, Paolo Coppola, Ugo Dal Lago:
Light Logics and Optimal Reduction: Completeness and Complexity. CoRR abs/0704.2448 (2007) - [i6]Ugo Dal Lago, Andrea Masini, Margherita Zorzi:
Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power. CoRR abs/cs/0703152 (2007) - 2006
- [j2]Ugo Dal Lago, Patrick Baillot:
On light logics, uniform encodings and polynomial time. Math. Struct. Comput. Sci. 16(4): 713-733 (2006) - [c10]Ugo Dal Lago, Simone Martini:
An Invariant Cost Model for the Lambda Calculus. CiE 2006: 105-114 - [c9]Ugo Dal Lago:
Context Semantics, Linear Logic and Computational Complexity. LICS 2006: 169-178 - [i5]Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen:
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. CoRR abs/cs/0608030 (2006) - 2005
- [b1]Ugo Dal Lago:
Semantic frameworks for implicit computational complexity. University of Bologna, Italy, 2005 - [c8]Ugo Dal Lago, Martin Hofmann:
Quantitative Models and Implicit Complexity. FSTTCS 2005: 189-200 - [c7]Ugo Dal Lago:
The Geometry of Linear Higher-Order Recursion. LICS 2005: 366-375 - [c6]Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca:
Elementary Affine Logic and the Call-by-Value Lambda Calculus. TLCA 2005: 131-145 - [i4]Ugo Dal Lago, Martin Hofmann:
Quantitative Models and Implicit Complexity. CoRR abs/cs/0506079 (2005) - [i3]Ugo Dal Lago:
The Geometry of Linear Higher-Order Recursion. CoRR abs/cs/0506080 (2005) - [i2]Ugo Dal Lago:
Context Semantics, Linear Logic and Computational Complexity. CoRR abs/cs/0510092 (2005) - [i1]Ugo Dal Lago, Simone Martini:
An Invariant Cost Model for the Lambda Calculus. CoRR abs/cs/0511045 (2005) - 2004
- [j1]Ugo Dal Lago, Simone Martini:
Phase semantics and decidability of elementary affine logic. Theor. Comput. Sci. 318(3): 409-433 (2004) - 2003
- [c5]Ugo Dal Lago, Angelo Montanari, Gabriele Puppis:
Towards Compact and Tractable Automaten-Based Representations of Time Granularities. ICTCS 2003: 72-85 - [c4]Ugo Dal Lago:
On the Expressive Power of Light Affine Logic. ICTCS 2003: 216-227 - [c3]Ugo Dal Lago, Simone Martini, Luca Roversi:
Higher-Order Linear Ramified Recurrence. TYPES 2003: 178-193 - 2002
- [c2]Ugo Dal Lago, Marco Pistore, Paolo Traverso:
Planning with a Language for Extended Goals. AAAI/IAAI 2002: 447-454 - 2001
- [c1]Ugo Dal Lago, Angelo Montanari:
Calendars, Time Granularities, and Automata. SSTD 2001: 279-298
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-14 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
