scientific article; zbMATH DE number 4170889

MaRDI QIDQ3496329zbMATH OpenFDO

Authors Andreas Goerdt

Publication date 1989

zbMATH Keywords

finitely typed \(\lambda \) -terms with if-then-else and fixpointsinfinite syntactic hierarchy

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Characterizing complexity classes by general recursive definitions in higher types
• Higher type recursion, ramification and polynomial time
• scientific article; zbMATH DE number 19768
• scientific article; zbMATH DE number 806752
• scientific article; zbMATH DE number 4179364

Cited in

(10)

• On the expressive power of finitely typed and universally polymorphic recursive procedures
• Characterizing complexity classes by higher type primitive recursive definitions
• Characterizing complexity classes by general recursive definitions in higher types
• Higher type recursion, ramification and polynomial time
• The role of polymorphism in the characterisation of complexity by soft types
• scientific article; zbMATH DE number 4179364 (Why is no real title available?)
• scientific article; zbMATH DE number 4072354 (Why is no real title available?)
• scientific article; zbMATH DE number 19768 (Why is no real title available?)
• Tailoring recursion for complexity
• Complexity of proving program correctness

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