Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity |
scientific article |
Statements
Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (English)
0 references
20 July 1999
0 references
primitive recursion
0 references
computational complexity
0 references
Kalmar-elementary functions
0 references
higher type functions
0 references
functionals
0 references
ramified recurrence
0 references
functional programs over free algebras
0 references
equational recurrence
0 references
applicative programs with recurrence operators
0 references
purely applicative higher-type programs
0 references
higher type recurrence
0 references
feasibility
0 references
