Realizability models for a linear dependent PCF

Recently, Dal Lago and Gaboardi have proposed a type system, named dℓPCF as a framework for implicit computational complexity. dℓPCF is a non-standard type system for PCF programs which is relatively complete with respect to quantitative properties thanks to the use of linear types inspired by Bound...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 585; s. 55 - 70
Hlavní autori: Brunel, Aloïs, Gaboardi, Marco
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 20.06.2015
Predmet:
Complexity
Computation
Computer simulation
Decoration
Implicit computational complexity
Mathematical models
Proving
Realizability
Realizability model
Semantics
Implicit computational complexity
Realizability model
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Recently, Dal Lago and Gaboardi have proposed a type system, named dℓPCF as a framework for implicit computational complexity. dℓPCF is a non-standard type system for 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. The quantitative realizability model aims at a better understanding of dℓPCF type decorations and at giving an abstract semantic proof of intensional soundness.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2015.03.005