scientific article; zbMATH DE number 1499100

zbMATH Open0947.03065MaRDI QIDQ4501154FDOQ4501154

Authors: Daniel M. Leivant 

Publication date: 3 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
• Functions over free algebras definable in the simply typed lambda calculus
• scientific article; zbMATH DE number 176200

zbMATH Keywords

computable functionsfree algebraapplicative programsequational recurrencehigher-order functionalhigher-type programshigher-type recurrencepredicative recurrence

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Cited In (11)

• A note on complexity measures for inductive classes in constructive type theory
• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
• Higher type recursion, ramification and polynomial time
• The computational contents of ramified corecurrence
• Algorithmically broad languages for polynomial time and space
• Types for Proofs and Programs
• A proof-theoretic characterization of the basic feasible functionals
• Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
• Intrinsic theories and computational complexity
• Theories with self-application and computational complexity.
• On the computational complexity of imperative programming languages

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 Q4501154)