|
Search the dblp DataBase
Ugo Dal Lago:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ugo Dal Lago, Marco Pistore, Paolo Traverso
Planning with a Language for Extended Goals. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2002, pp:447-454 [Conf]
- Ugo Dal Lago, Simone Martini
An Invariant Cost Model for the Lambda Calculus. [Citation Graph (0, 0)][DBLP] CiE, 2006, pp:105-114 [Conf]
- Ugo Dal Lago, Martin Hofmann
Quantitative Models and Implicit Complexity. [Citation Graph (0, 0)][DBLP] FSTTCS, 2005, pp:189-200 [Conf]
- Ugo Dal Lago
On the Expressive Power of Light Affine Logic. [Citation Graph (0, 0)][DBLP] ICTCS, 2003, pp:216-227 [Conf]
- Ugo Dal Lago, Angelo Montanari, Gabriele Puppis
Towards Compact and Tractable Automaten-Based Representations of Time Granularities. [Citation Graph (0, 0)][DBLP] ICTCS, 2003, pp:72-85 [Conf]
- Ugo Dal Lago
The Geometry of Linear Higher-Order Recursion. [Citation Graph (0, 0)][DBLP] LICS, 2005, pp:366-375 [Conf]
- Ugo Dal Lago
Context Semantics, Linear Logic and Computational Complexity. [Citation Graph (0, 0)][DBLP] LICS, 2006, pp:169-178 [Conf]
- Ugo Dal Lago, Angelo Montanari
Calendars, Time Granularities, and Automata. [Citation Graph (0, 0)][DBLP] SSTD, 2001, pp:279-298 [Conf]
- Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca
Elementary Affine Logic and the Call-by-Value Lambda Calculus. [Citation Graph (0, 0)][DBLP] TLCA, 2005, pp:131-145 [Conf]
- Ugo Dal Lago, Simone Martini, Luca Roversi
Higher-Order Linear Ramified Recurrence. [Citation Graph (0, 0)][DBLP] TYPES, 2003, pp:178-193 [Conf]
- Ugo Dal Lago, Simone Martini
Phase semantics and decidability of elementary affine logic. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:318, n:3, pp:409-433 [Journal]
- Ugo Dal Lago, Angelo Montanari, Gabriele Puppis
Compact and tractable automaton-based representations of time granularities. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:373, n:1-2, pp:115-141 [Journal]
- Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Light Logics and Optimal Reduction: Completeness and Complexity. [Citation Graph (0, 0)][DBLP] LICS, 2007, pp:421-430 [Conf]
- Ugo Dal Lago, Angelo Montanari, Gabriele Puppis
On the Equivalence of Automaton-Based Representations of Time Granularities. [Citation Graph (0, 0)][DBLP] TIME, 2007, pp:82-93 [Conf]
- Ugo Dal Lago, Andrea Masini, Margherita Zorzi
Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Light Logics and Optimal Reduction: Completeness and Complexity [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Quantitative Game Semantics for Linear Logic. [Citation Graph (, )][DBLP]
A Semantic Proof of Polytime Soundness of Light Affine Logic. [Citation Graph (, )][DBLP]
Functional Programming in Sublinear Space. [Citation Graph (, )][DBLP]
On Constructor Rewrite Systems and the Lambda-Calculus. [Citation Graph (, )][DBLP]
Taming Modal Impredicativity: Superlazy Reduction. [Citation Graph (, )][DBLP]
Bounded Linear Logic, Revisited. [Citation Graph (, )][DBLP]
Quantitative Models and Implicit Complexity [Citation Graph (, )][DBLP]
The Geometry of Linear Higher-Order Recursion [Citation Graph (, )][DBLP]
Context Semantics, Linear Logic and Computational Complexity [Citation Graph (, )][DBLP]
An Invariant Cost Model for the Lambda Calculus [Citation Graph (, )][DBLP]
Light Logics and the Call-by-Value Lambda Calculus [Citation Graph (, )][DBLP]
Taming Modal Impredicativity: Superlazy Reduction [Citation Graph (, )][DBLP]
Bounded Linear Logic, Revisited [Citation Graph (, )][DBLP]
On Constructor Rewrite Systems and the Lambda-Calculus [Citation Graph (, )][DBLP]
Confluence Results for a Quantum Lambda Calculus with Measurements [Citation Graph (, )][DBLP]
General Ramified Recurrence is Sound for Polynomial Time [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.008secs
|