scientific article
From MaRDI portal
Publication:4035304
zbMath0788.03068MaRDI QIDQ4035304
Bruce M. Kapron, Stephen A. Cook
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bounded typed loop-programspolynomially computable functionals of higher typestyped while- programming language with bounded run-times
Related Items (14)
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals ⋮ Computation models and function algebras ⋮ Expressing computational complexity in constructive type theory ⋮ Theories with self-application and computational complexity. ⋮ Bounded linear logic: A modular approach to polynomial-time computability ⋮ Type-two polynomial-time and restricted lookahead ⋮ Functional interpretations of feasibly constructive arithmetic ⋮ A new recursion-theoretic characterization of the polytime functions ⋮ A proof-theoretic characterization of the basic feasible functionals ⋮ An arithmetic for polynomial-time computation ⋮ Elementary explicit types and polynomial time operations ⋮ A note on complexity measures for inductive classes in constructive type theory ⋮ Feasible functionals and intersection of ramified types ⋮ Higher type recursion, ramification and polynomial time
This page was built for publication:
