Linear types and non-size-increasing polynomial time computation.
type: Item
instance of: scholarly article
title: Linear types and non-size-increasing polynomial time computation.
zbMATH Open document ID: 1054.68065
DOI: 10.1016/S0890-5401(03)00009-9
author: Martin Hofmann
published in: Information and Computation
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1967131
zbMATH Keywords: Complexity theory
zbMATH Keywords: Type system
zbMATH Keywords: Linear types
zbMATH Keywords: Higher-order function
zbMATH Keywords: Resources
MaRDI profile type: Publication
cites work: A syntactical analysis of non-size-increasing polynomial time computation
cites work: A new recursion-theoretic characterization of the polytime functions
cites work: Light linear logic
cites work: Safe recursion with higher types and BCK-algebra
cites work: Q4518880
cites work: The strength of non-size increasing computation
cites work: Region-based memory management
cites work: Static prediction of heap space usage for first-order functional programs
full work available at URL: s0890-5401(03)00009-9
OpenAlex ID: W2010059824
description: scientific article; zbMATH DE number 1967131