Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
type: Item
instance of: scholarly article
title: Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
zbMATH Open document ID: 0924.03071
DOI: 10.1016/S0168-0072(98)00040-2
author: Daniel M. Leivant
published in: Annals of Pure and Applied Logic
publication date: 1999-07-20T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 03F05
Mathematics Subject Classification ID: 03F10
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1308104
zbMATH Keywords: primitive recursion
zbMATH Keywords: computational complexity
zbMATH Keywords: Kalmar-elementary functions
zbMATH Keywords: higher type functions
zbMATH Keywords: functionals
zbMATH Keywords: ramified recurrence
zbMATH Keywords: functional programs over free algebras
zbMATH Keywords: equational recurrence
zbMATH Keywords: applicative programs with recurrence operators
zbMATH Keywords: purely applicative higher-type programs
zbMATH Keywords: higher type recurrence
zbMATH Keywords: feasibility
MaRDI profile type: Publication
cites work: Q4850544
cites work: A new recursion-theoretic characterization of the polytime functions
cites work: Automatic synthesis of typed \(\Lambda\)-programs on term algebras
cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
cites work: Q5629622
cites work: Q5573940
cites work: Q5843849
cites work: Q3035278
cites work: Q4035315
cites work: Finitely stratified polymorphism
cites work: Q4010361
cites work: A foundational delineation of poly-time
cites work: Q4501154
cites work: Q4850553
cites work: Q3142166
cites work: Q4474861
cites work: Q4726219
cites work: Q5533181
cites work: Classes of Predictably Computable Functions
cites work: Q3325707
cites work: The realm of primitive recursion
cites work: The typed lambda-calculus is not elementary recursive
cites work: A characterization of alternating log time by ramified recurrence
full work available at URL: s0168-0072(98)00040-2
OpenAlex ID: W2013519208
description: scientific article; zbMATH DE number 1308104