Realizability models for a linear dependent PCF
Recently, Dal Lago and Gaboardi have proposed a type system, named d?PCF d ? PCF as a framework for implicit computational complexity. d?PCF d ? PCF is a non-standard type system for PCF PCF programs which is relatively complete with respect to quantitative properties thanks to the use of linear types inspired by Bounded linear logic and dependent types  la  Dependent ML. In this work, we adapt the framework of quantitative realizability and obtain a model for d?PCF d ? PCF . The quantitative realizability model aims at a better understanding of d?PCF d ? PCF type decorations and at giving an abstract semantic proof of intensional soundness.
realizability model implicit computational complexity