Richard_Statman

Richard Statman

Richard Statman

American computer scientist (born 1946)

Richard Statman (born September 6, 1946) is an American computer scientist whose principal research interest is the theory of computation, especially symbolic computation. His research involves lambda calculus, type theory, and combinatory algebra.

Quick Facts Born, Alma mater ...

Career

In 1974, Statman received his Ph.D. from Stanford University for his Ph.D. dissertation, supervised by Georg Kreisel, entitled Structural Complexity of Proofs. His achievements include the proof that the type inhabitation problem in simply typed lambda calculus is PSPACE-complete.
Share this article:

This article uses material from the Wikipedia article Richard_Statman, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.