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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 585; pp. 55 - 70
Main Authors:	Brunel, Aloïs, Gaboardi, Marco
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 20.06.2015
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!