Applicative control and computational complexity

DOI10.1007/3-540-48168-0_7MaRDI QIDQ4945219zbMATH OpenFDO

Authors Daniel M. Leivant

Publication date 23 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48168-0_7

zbMATH Keywords

complexity classeslambda calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 806752
• Computational Complexity Via Finite Types
• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
• scientific article; zbMATH DE number 2079048
• Higher type recursion, ramification and polynomial time

Cited in

(10)

• Control of a compound computer program as a variational problem
• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
• Functions over free algebras definable in the simply typed lambda calculus
• Control structures in programs and computational complexity
• scientific article; zbMATH DE number 3985077 (Why is no real title available?)
• scientific article; zbMATH DE number 1343490 (Why is no real title available?)
• scientific article; zbMATH DE number 806752 (Why is no real title available?)
• The Garland measure and computational complexity of stack programs
• Implicit computation complexity in higher-order programming languages
• Efficient computation of arbitrary control dependencies

This page was built for publication: Applicative control and computational complexity

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