14 citations · 17 across the 4 of their papers we have counts for
4 papers
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…
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…
A Categorical Model for the Lambda Calculus with Constructors
Barbara Petit
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constant…
Linearity in the non-deterministic call-by-value setting
Alejandro Díaz-Caro, Barbara Petit
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fi…