Ugo Dal Lago

According to our database1, Ugo Dal Lago authored at least 90 papers between 2001 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Intersection types and runtime errors in the pi-calculus.
PACMPL, 2019

On the Taylor Expansion of Probabilistic lambda-terms.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

The Geometry of Bayesian Programming.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

On the Termination Problem for Probabilistic Higher-Order Recursive Programs.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Type-Based Complexity Analysis of Probabilistic Functional Programs.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Differential Logical Relations, Part I: The Simply-Typed Case.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Effectful Normal Form Bisimulation.
Proceedings of the Programming Languages and Systems, 2019

2018
On Intersection Types and Probabilistic Lambda Calculi.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

On Randomised Strategies in the λ-calculus.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

On Probabilistic Term Rewriting.
Proceedings of the Functional and Logic Programming - 14th International Symposium, 2018

2017
Automating sized-type inference for complexity analysis.
PACMPL, 2017

Automated Sized-Type Inference and Complexity Analysis.
Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

The geometry of parallelism: classical, probabilistic, and quantum effects.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Effectful applicative bisimilarity: Monads, relators, and Howe's method.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Effectful Applicative Similarity for Call-by-Name Lambda Calculi.
Proceedings of the 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), 2017

On Higher-Order Probabilistic Subrecursion.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Probabilistic Termination by Monadic Affine Sized Typing.
Proceedings of the Programming Languages and Systems, 2017

Metric Reasoning About \lambda -Terms: The General Case.
Proceedings of the Programming Languages and Systems, 2017

2016
Light logics and higher-order processes.
Mathematical Structures in Computer Science, 2016

On session types and polynomial time.
Mathematical Structures in Computer Science, 2016

Computation by interaction for space-bounded functional programming.
Inf. Comput., 2016

(Leftmost-Outermost) Beta Reduction is Invariant, Indeed.
Logical Methods in Computer Science, 2016

Infinitary Lambda Calculi from a Linear Perspective.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A lambda-calculus foundation for universal probabilistic programming.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

2015
Developments in Implicit Complexity (DICE 2012).
Theor. Comput. Sci., 2015

On Sharing, Memoization, and Polynomial Time.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Parallelism and Synchronization in an Infinitary Context.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Metric Reasoning about λ-Terms: The Affine Case.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Analysing the complexity of functional programs: higher-order meets first-order.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

Applicative Bisimulation and Quantum λ-Calculi.
Proceedings of the Fundamentals of Software Engineering - 6th International Conference, 2015

On Equivalences, Metrics, and Polynomial Time.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

On Coinduction and Quantum Lambda Calculi.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

On Applicative Similarity, Sequentiality, and Full Abstraction.
Proceedings of the Correct System Design, 2015

2014
Probabilistic Recursion Theory and Implicit Computational Complexity.
Sci. Ann. Comp. Sci., 2014

Wave-Style Token Machines and Quantum Lambda Calculi.
Proceedings of the Proceedings Third International Workshop on Linearity, 2014

On coinductive equivalences for higher-order probabilistic functional programs.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Probabilistic Recursion Theory and Implicit Computational Complexity.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

Measurements in Proof Nets as Higher-Order Quantum Circuits.
Proceedings of the Programming Languages and Systems, 2014

On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi.
Proceedings of the Programming Languages and Systems, 2014

The geometry of synchronization.
Proceedings of the 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), 2014

Beta reduction is invariant, indeed.
Proceedings of the 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), 2014

2013
The geometry of types.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Complexity Analysis in Presence of Control Operators and Higher-Order Functions.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

2012
On quasi-interpretations, blind abstractions and implicit complexity.
Mathematical Structures in Computer Science, 2012

Probabilistic operational semantics for the lambda calculus.
RAIRO - Theor. Inf. and Applic., 2012

On Constructor Rewrite Systems and the Lambda Calculus
Logical Methods in Computer Science, 2012

On the Invariance of the Unitary Cost Model for Head Reduction.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Linear dependent types in a call-by-value scenario.
Proceedings of the Principles and Practice of Declarative Programming, 2012

Higher-Order Interpretations and Program Complexity.
Proceedings of the Computer Science Logic (CSL'12), 2012

2011
Realizability models and implicit complexity.
Theor. Comput. Sci., 2011

Confluence Results for a Quantum Lambda Calculus with Measurements.
Electr. Notes Theor. Comput. Sci., 2011

On Multiplicative Linear Logic, Modality and Quantum Circuits
Proceedings of the Proceedings 8th International Workshop on Quantum Physics and Logic, 2011

Soft Session Types
Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

Linear Dependent Types and Relative Completeness
Logical Methods in Computer Science, 2011

Linear Dependent Types and Relative Completeness.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

A Higher-Order Characterization of Probabilistic Polynomial Time.
Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2011

A Short Introduction to Implicit Computational Complexity.
Proceedings of the Lectures on Logic and Computation, 2011

2010
Quantum implicit computational complexity.
Theor. Comput. Sci., 2010

Light Logics and Higher-Order Processes
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

General Ramified Recurrence is Sound for Polynomial Time
Proceedings of the Proceedings International Workshop on Developments in Implicit Computational complExity, 2010

Bounded Linear Logic, Revisited
Logical Methods in Computer Science, 2010

Functional Programming in Sublinear Space.
Proceedings of the Programming Languages and Systems, 2010

Type Inference for Sublinear Space Functional Programming.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
Context semantics, linear logic, and computational complexity.
ACM Trans. Comput. Log., 2009

On a measurement-free quantum lambda calculus with classical control.
Mathematical Structures in Computer Science, 2009

Bounded Linear Logic, Revisited.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

Taming Modal Impredicativity: Superlazy Reduction.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

On Constructor Rewrite Systems and the Lambda-Calculus.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Derivational Complexity Is an Invariant Cost Model.
Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2009

2008
The weak lambda calculus as a reasonable machine.
Theor. Comput. Sci., 2008

Light Logics and the Call-by-Value Lambda Calculus.
Logical Methods in Computer Science, 2008

A Semantic Proof of Polytime Soundness of Light Affine Logic.
Proceedings of the Computer Science, 2008

Quantitative Game Semantics for Linear Logic.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
Compact and tractable automaton-based representations of time granularities.
Theor. Comput. Sci., 2007

On the Equivalence of Automaton-Based Representations of Time Granularities.
Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 2007

Light Logics and Optimal Reduction: Completeness and Complexity.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
On light logics, uniform encodings and polynomial time.
Mathematical Structures in Computer Science, 2006

Context Semantics, Linear Logic and Computational Complexity.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

An Invariant Cost Model for the Lambda Calculus.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Elementary Affine Logic and the Call-by-Value Lambda Calculus.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

The Geometry of Linear Higher-Order Recursion.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Quantitative Models and Implicit Complexity.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004
Phase semantics and decidability of elementary affine logic.
Theor. Comput. Sci., 2004

2003
Higher-Order Linear Ramified Recurrence.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

Towards Compact and Tractable Automaten-Based Representations of Time Granularities.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

On the Expressive Power of Light Affine Logic.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002
Planning with a Language for Extended Goals.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Calendars, Time Granularities, and Automata.
Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001


  Loading...