The following pages link to Ugo Dal Lago (Q276253):
Displayed 50 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- Light logics and optimal reduction: completeness and complexity (Q627123) (← links)
- Compact and tractable automaton-based representations of time granularities (Q875518) (← links)
- The weak lambda calculus as a reasonable machine (Q930866) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- On sharing, memoization, and polynomial time (Q1640979) (← links)
- On probabilistic term rewriting (Q1648879) (← links)
- On randomised strategies in the \(\lambda \)-calculus (Q1989325) (← links)
- Effectful applicative similarity for call-by-name lambda calculi (Q1989333) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- On measure quantifiers in first-order arithmetic (Q2117748) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- Decomposing probabilistic lambda calculi (Q2200818) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- Linear dependent types in a call-by-value scenario (Q2441513) (← links)
- Differential logical relations. II: Increments and derivatives (Q2664934) (← links)
- (Leftmost-Outermost) Beta Reduction is Invariant, Indeed (Q2794671) (← links)
- Confluence Results for a Quantum Lambda Calculus with Measurements (Q2825377) (← links)
- Complexity Analysis in Presence of Control Operators and Higher-Order Functions (Q2870134) (← links)
- On Constructor Rewrite Systems and the Lambda Calculus (Q2904629) (← links)
- Probabilistic operational semantics for the lambda calculus (Q2905328) (← links)
- On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
- The geometry of types (Q2931793) (← links)
- Probabilistic Recursion Theory and Implicit Computational Complexity (Q2938155) (← links)
- The geometry of linear higher-order recursion (Q2946566) (← links)
- Context semantics, linear logic, and computational complexity (Q2946582) (← links)
- On Equivalences, Metrics, and Polynomial Time (Q2947890) (← links)
- (Q2954984) (← links)
- Light logics and higher-order processes (Q2971072) (← links)
- On session types and polynomial time (Q2971079) (← links)
- Analysing the complexity of functional programs: higher-order meets first-order (Q2981952) (← links)
- A lambda-calculus foundation for universal probabilistic programming (Q2981999) (← links)
- On Higher-Order Probabilistic Subrecursion (Q2988381) (← links)
- Metric Reasoning About $$\lambda $$-Terms: The General Case (Q2988646) (← links)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- A Higher-Order Characterization of Probabilistic Polynomial Time (Q3167522) (← links)
- On Applicative Similarity, Sequentiality, and Full Abstraction (Q3449626) (← links)
- Applicative Bisimulation and Quantum λ-Calculi (Q3455863) (← links)
- Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs (Q3460055) (← links)
- A Semantic Proof of Polytime Soundness of Light Affine Logic (Q3503632) (← links)
- Quantitative Game Semantics for Linear Logic (Q3540182) (← links)
- Functional Programming in Sublinear Space (Q3558224) (← links)
- Taming Modal Impredicativity: Superlazy Reduction (Q3605525) (← links)
- Light Logics and the Call-by-Value Lambda Calculus (Q3623002) (← links)