Skip to Main content Skip to Navigation
Conference papers

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 :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Ugo Dal Lago Connect in order to contact the contributor
Submitted on : Friday, December 5, 2014 - 4:47:54 PM
Last modification on : Thursday, January 20, 2022 - 5:29:14 PM
Long-term archiving on: : Monday, March 9, 2015 - 6:05:09 AM


Files produced by the author(s)




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⟩



Les métriques sont temporairement indisponibles