Searching for "The Typed lambda-Calculus Is not Elementary Recursive" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

The "Hardest" Natural Decidable Theory
by Sergei Vorobyov — 1997 — 12th Annual IEEE Symp. on Logic in Computer Science (LICS'97)', IEEE
… that the typed lambda calculus is not elementary recursive, in fact requires (lower bound) time exp 1 (2 cn…
Cited by 7 (4 self) – Add To MetaCart

The Most Nonelementary Theory (A Direct Lower Bound Proof)
by Sergei Vorobyov — 1998
… lower bounds) and used this fact to prove that fi-equality in the simply typed lambda calculus…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB