Characterizations for the basic feasible functionals of finite type (Q4035304)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 176200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizations for the basic feasible functionals of finite type |
scientific article; zbMATH DE number 176200 |
Statements
18 May 1993
0 references
polynomially computable functionals of higher types
0 references
typed while- programming language with bounded run-times
0 references
bounded typed loop-programs
0 references
0.8690182566642761
0 references
0.8690182566642761
0 references
0.825534462928772
0 references
0.8147395849227905
0 references
Characterizations for the basic feasible functionals of finite type (English)
0 references
[For the entire collection see Zbl 0753.00018.] The first author and \textit{A. Urquhart} [Ann. Pure Appl. Log. 63, 103-200 (1993; Zbl 0780.03026)] introduced a class of polynomially computable functionals of higher types via typed \(\lambda\)-calculus with bounded recursion. Here they present two alternative characterizations: via a typed while-programming language with bounded run-times, and via bounded typed loop-programs.
0 references
