Linear dependent types in a call-by-value scenario

Ugo Dal Lago 1, 2 Barbara Petit 2, 1
1 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01091610
Contributor : Ugo Dal Lago <>
Submitted on : Friday, December 5, 2014 - 4:47:54 PM
Last modification on : Saturday, January 27, 2018 - 1:31:49 AM
Long-term archiving on : Monday, March 9, 2015 - 6:05:09 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Ugo Dal Lago, Barbara Petit. Linear dependent types in a call-by-value scenario. Science of Computer Programming, Elsevier, 2014, pp.24. ⟨10.1145/2370776.2370792⟩. ⟨hal-01091610⟩

Share

Metrics

Record views

207

Files downloads

288