Higher type recursion, ramification and polynomial time
type: Item
instance of: scholarly article
title: Higher type recursion, ramification and polynomial time
zbMATH Open document ID: 0959.03027
DOI: 10.1016/S0168-0072(00)00006-3
author: Stephen J. Bellantoni
author: Karl-Heinz Niggl
author: Helmut Schwichtenberg
published in: Annals of Pure and Applied Logic
publication date: 2000-09-04T00:00:00Z
Mathematics Subject Classification ID: 03D65
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 03F03
Mathematics Subject Classification ID: 03F10
Mathematics Subject Classification ID: 03F35
zbMATH DE Number: 1501500
zbMATH Keywords: higher type recursion
zbMATH Keywords: normalisation
zbMATH Keywords: ramified recursion
zbMATH Keywords: polynomial-time computable functions
zbMATH Keywords: lambda calculus
MaRDI profile type: Publication
cites work: A new recursion-theoretic characterization of the polytime functions
cites work: Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
cites work: Q4035304
cites work: Q3686043
cites work: Light linear logic
cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
cites work: Q4218937
cites work: Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)
cites work: Q4035315
cites work: Q4501154
cites work: Q4850553
cites work: Q4474861
cites work: The realm of primitive recursion
cites work: Q4716271
full work available at URL: s0168-0072(00)00006-3
OpenAlex ID: W1970954854
Recommended article: Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
Recommended article: Q4436023
Recommended article: Recursion in Higher Types and Resource Bounded Turing Machines
Recommended article: Characterizing complexity classes by general recursive definitions in higher types
Recommended article: Q3496329
Recommended article: Higher Recursion Theory
Recommended article: Q4040890
Recommended article: Higher type recursion for transfinite machine theory
Recommended article: Q4010352
Recommended article: Characterizing complexity classes by higher type primitive recursive definitions
description: scientific article; zbMATH DE number 1501500