An arithmetic for non-size-increasing polynomial-time computation
type: Item
instance of: scholarly article
title: An arithmetic for non-size-increasing polynomial-time computation
zbMATH Open document ID: 1064.03036
author: Klaus Aehlig
author: Ulrich Berger
author: Martin Hofmann
author: Helmut Schwichtenberg
published in: Theoretical Computer Science
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 2083401
zbMATH Keywords: Arithmetic
zbMATH Keywords: Implicit computational complexity
zbMATH Keywords: Non-size-increasing polynomial-time computation
zbMATH Keywords: Realizability
zbMATH Keywords: Higher types
zbMATH Keywords: Lambda calculus
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.10.023
OpenAlex ID: W2051832719
cites work: A syntactical analysis of non-size-increasing polynomial time computation
cites work: Higher type recursion, ramification and polynomial time
cites work: Q4281467
cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
cites work: A type system for bounded space and functional in-place update
cites work: The strength of non-size increasing computation
cites work: Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)
cites work: Intrinsic reasoning about functional programs. I: First order theories
cites work: Q3127078
DOI: 10.1016/J.TCS.2003.10.023
description: scientific article; zbMATH DE number 2083401