#### Filter Results:

- Full text PDF available (69)

#### Publication Year

2000

2018

- This year (7)
- Last 5 years (69)
- Last 10 years (107)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ugo Dal Lago, Marco Pistore, Paolo Traverso
- AAAI/IAAI
- 2002

Planning for extended goals in non-deterministic domains is one of the most significant and challenging planning problems. In spite of the recent results in this field, no work has proposed aâ€¦ (More)

- Ugo Dal Lago
- 21st Annual IEEE Symposium on Logic in Computerâ€¦
- 2006

We show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. In particular, context semantics lets us define the weight of a proof-netâ€¦ (More)

We develop the operational semantics of an untyped probabilistic Î»-calculus with continuous distributions, and both hard and soft constraints,as a foundation for universal probabilistic programmingâ€¦ (More)

- Ugo Dal Lago
- 20th Annual IEEE Symposium on Logic in Computerâ€¦
- 2005

Imposing linearity and ramification constraints allows to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polynomial-timeâ€¦ (More)

- Martin Avanzini, Ugo Dal Lago, Georg Moser
- ICFP
- 2015

We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalised versions of them, and feeding the result toâ€¦ (More)

- Ugo Dal Lago, Angelo Montanari
- SSTD
- 2001

The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, temporal dataâ€¦ (More)

- Ugo Dal Lago, Davide Sangiorgi, Michele Alberti
- POPL
- 2014

We study bisimulation and context equivalence in a probabilistic lambda-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilisticâ€¦ (More)

- RaphaÃ«lle CrubillÃ©, Ugo Dal Lago
- ESOP
- 2014

Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to aâ€¦ (More)

- Ugo Dal Lago, Simone Martini
- Theor. Comput. Sci.
- 2008

We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value lambda-calculus canâ€¦ (More)

- Ugo Dal Lago, Margherita Zorzi
- ArXiv
- 2011