Linear Dependent Types in a Call-by-Value Scenario - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Science of Computer Programming Year : 2013

Linear Dependent Types in a Call-by-Value Scenario


Linear dependent types allow to precisely capture both the extensional behavior and the time complexity of λ-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 computation. 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 behavior of terms can be derived, provided all true index term inequalities can be used as assumptions.
Fichier principal
Vignette du fichier
scp2013.pdf (429.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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



Ugo Dal Lago, Barbara Petit. Linear Dependent Types in a Call-by-Value Scenario. Science of Computer Programming, 2013, ⟨10.1016/j.scico.2013.07.010⟩. ⟨hal-00909317⟩
147 View
244 Download



Gmail Facebook X LinkedIn More