Linear Dependent Types in a Call-by-Value Scenario (Long Version)

@article{Lago2012LinearDT,
  title={Linear Dependent Types in a Call-by-Value Scenario (Long Version)},
  author={Ugo Dal Lago and Barbara Petit},
  journal={CoRR},
  year={2012},
  volume={abs/1207.5592}
}
Linear dependent types [8] allow to precisely capture both the extensional behaviour 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 evaluation. 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… CONTINUE READING