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 Science of Computer Programming Year : 2014

Linear dependent types in a call-by-value scenario


Linear dependent types were introduced recently as a formal system that allows to precisely capture both the extensional behavior and the time com-plexity of λ-terms, when the latter are evaluated by Krivine's abstract ma-chine. 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 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.
Fichier principal
Vignette du fichier
main.pdf (573.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01091610 , version 1 (05-12-2014)



Ugo Dal Lago, Barbara Petit. Linear dependent types in a call-by-value scenario. PPDP '12: Proceedings of the 14th symposium on Principles and practice of declarative programming, Sep 2012, Leuven, Belgium. pp.24, ⟨10.1145/2370776.2370792⟩. ⟨hal-01091610⟩


56 View
190 Download



Gmail Facebook Twitter LinkedIn More