scientific article; zbMATH DE number 176200

MaRDI QIDQ4035304zbMATH OpenFDO

Authors Bruce M. Kapron, Stephen Cook

Publication date 18 May 1993

zbMATH Keywords

bounded typed loop-programspolynomially computable functionals of higher typestyped while- programming language with bounded run-times

Mathematics Subject Classification ID

Functionals in proof theory (03F10)

Recommendations

• On characterizations of the basic feasible functionals. I
• Higher type recursion, ramification and polynomial time
• scientific article; zbMATH DE number 2110623
• A proof-theoretic characterization of the basic feasible functionals
• Some applications of logic to feasibility in higher types

Cited in

(24)

• Bounded linear logic: A modular approach to polynomial-time computability
• A new recursion-theoretic characterization of the polytime functions
• A note on complexity measures for inductive classes in constructive type theory
• Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
• Theories with self-application and computational complexity.
• Higher type recursion, ramification and polynomial time
• An arithmetic for polynomial-time computation
• On characterizations of the basic feasible functionals. I
• Feasible functionals and intersection of ramified types
• Functionals using bounded information and the dynamics of algorithms
• scientific article; zbMATH DE number 3864500 (Why is no real title available?)
• Elementary explicit types and polynomial time operations
• scientific article; zbMATH DE number 517086 (Why is no real title available?)
• scientific article; zbMATH DE number 1948174 (Why is no real title available?)
• scientific article; zbMATH DE number 1499100 (Why is no real title available?)
• scientific article; zbMATH DE number 3993543 (Why is no real title available?)
• scientific article; zbMATH DE number 2110623 (Why is no real title available?)
• A tier-based typed programming language characterizing feasible functionals
• A tier-based typed programming language characterizing Feasible Functionals
• Computation models and function algebras
• Expressing computational complexity in constructive type theory
• Complete and tractable machine-independent characterizations of second-order polytime
• Functional interpretations of feasibly constructive arithmetic
• A proof-theoretic characterization of the basic feasible functionals

This page was built for publication:

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