scientific article; zbMATH DE number 1499100

MaRDI QIDQ4501154zbMATHFDO

Authors Daniel M. Leivant

Publication date 3 September 2000

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)

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

Cited in

(11)

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

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)