Linear dependent types in a call-by-value scenario - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Linear dependent types in a call-by-value scenario


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 machine. In this work, we show that the same paradigm can be applied to call-by-value evaluation. A system of linear dependent types for Plotkin's PCF is introduced, called dlPCFV, whose types reflect the complexity of evaluating terms in the so-called CEK machine. dlPCFV is proved to be sound, but also relatively complete: every true statement about the extensional and intentional behaviour of terms can be derived, provided all true index term inequalities can be used as assumptions.
No file

Dates and versions

hal-00909371 , version 1 (26-11-2013)



Ugo Dal Lago, Barbara Petit. Linear dependent types in a call-by-value scenario. Principles and Practice of Declarative Programming, (PPDP'12), 2012, Leuven, Belgium. pp.115--126, ⟨10.1145/2370776.2370792⟩. ⟨hal-00909371⟩
212 View
0 Download



Gmail Facebook X LinkedIn More