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

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 585; s. 55 - 70
Hlavní autoři:	Brunel, Aloïs, Gaboardi, Marco
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 20.06.2015
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!