2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.LO2012★ 2 cited
The Geometry of Types (Long Version)
Ugo Dal Lago, Barbara Petit
We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification probl…
cs.LO2012★ 1 cited
Linear Dependent Types in a Call-by-Value Scenario (Long Version)
Ugo Dal Lago, Barbara Petit
Linear dependent types allow to precisely capture both the extensional behaviour and the time complexity of lambda terms, when the latter are evaluated by Krivine's abstract machin…