The following pages link to Ugo Dal Lago (Q276253):
Displayed 50 items.
- On a measurement-free quantum lambda calculus with classical control (Q3625676) (← links)
- On Constructor Rewrite Systems and the Lambda-Calculus (Q3638093) (← links)
- Proofs as Efficient Programs (Q3654818) (← links)
- Probabilistic Recursion Theory and Implicit Computational Complexity (Q4621181) (← links)
- Beta reduction is invariant, indeed (Q4635589) (← links)
- The geometry of synchronization (Q4635620) (← links)
- Parallelism and Synchronization in an Infinitary Context (Q4635836) (← links)
- Metric reasoning about λ-terms: The affine case (Q4635842) (← links)
- Infinitary Lambda Calculi from a Linear Perspective (Q4635902) (← links)
- Higher-Order Interpretations and Program Complexity (Q4649538) (← links)
- (Q4778773) (← links)
- Linear Dependent Types and Relative Completeness (Q4899111) (← links)
- (Q4963998) (← links)
- (Q4965859) (← links)
- (Q4986180) (← links)
- (Q5015214) (← links)
- (Q5028447) (← links)
- On the Versatility of Open Logical Relations (Q5041087) (← links)
- The geometry of Bayesian programming (Q5076392) (← links)
- On the Taylor expansion of probabilistic λ-terms (Q5089013) (← links)
- Differential logical relations, Part I: The simply-typed case (Q5091273) (← links)
- (Q5111892) (← links)
- (Q5129945) (← links)
- (Q5144659) (← links)
- (Q5144664) (← links)
- On Probabilistic λ-Calculi (Q5150948) (← links)
- (Q5357721) (← links)
- The geometry of parallelism: classical, probabilistic, and quantum effects (Q5370917) (← links)
- On coinductive equivalences for higher-order probabilistic functional programs (Q5408426) (← links)
- On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (Q5410701) (← links)
- Measurements in Proof Nets as Higher-Order Quantum Circuits (Q5410710) (← links)
- On light logics, uniform encodings and polynomial time (Q5482265) (← links)
- Typed Lambda Calculi and Applications (Q5704005) (← links)
- Types for Proofs and Programs (Q5712304) (← links)
- Derivational Complexity Is an Invariant Cost Model (Q5747633) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Bounded Linear Logic, Revisited (Q5894004) (← links)
- Theoretical Computer Science (Q5897351) (← links)
- Theoretical Computer Science (Q5897362) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897769) (← links)
- Logical Approaches to Computational Barriers (Q5898807) (← links)
- Bounded Linear Logic, Revisited (Q5902142) (← links)
- Effectful normal form bisimulation (Q6091306) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
- (Q6159939) (← links)
- (Q6168449) (← links)
- On Measure Quantifiers in First-Order Arithmetic (Long Version) (Q6366057) (← links)
- Curry and Howard Meet Borel (Q6394294) (← links)
- On Quantitative Algebraic Higher-Order Theories (Q6397728) (← links)
- Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories (Q6460715) (← links)