Characterizations for the basic feasible functionals of finite type

From MaRDI portal





[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.




Cited in
(24)








This page was built for publication: Characterizations for the basic feasible functionals of finite type

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035304)