scientific article

zbMath0712.03031MaRDI QIDQ3496329

Andreas Goerdt

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

infinite syntactic hierarchyfinitely typed \(\lambda \) -terms with if-then-else and fixpoints

Mathematics Subject Classification ID

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

Related Items (5)

The role of polymorphism in the characterisation of complexity by soft types ⋮ Complexity of proving program correctness ⋮ Tailoring recursion for complexity ⋮ On the expressive power of finitely typed and universally polymorphic recursive procedures ⋮ Characterizing complexity classes by higher type primitive recursive definitions

This page was built for publication: