Linear dependent types in a call-by-value scenario

Abstract

Linear dependent types [11] allow to precisely capture both the extensional behavior and the time complexity of &#955;-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 d<i>l… (More)
DOI: 10.1145/2370776.2370792

Topics

9 Figures and Tables

Statistics

02040201520162017
Citations per Year

Citation Velocity: 13

Averaging 13 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Lago2012LinearDT, title={Linear dependent types in a call-by-value scenario}, author={Ugo Dal Lago and Barbara Petit}, booktitle={Sci. Comput. Program.}, year={2012} }