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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 585; S. 55 - 70
Hauptverfasser:	Brunel, Aloïs, Gaboardi, Marco
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 20.06.2015
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!