PhotosBiographyFacebookTwitter

From Wikipedia, the free encyclopedia
Richard Statman
BornSeptember 6, 1946 (1946-09-06) (age 77)
Alma mater Stanford University
Scientific career
Fields computer science
Institutions Carnegie Mellon
Doctoral advisor Georg Kreisel

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.

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.

External links

From Wikipedia, the free encyclopedia
Richard Statman
BornSeptember 6, 1946 (1946-09-06) (age 77)
Alma mater Stanford University
Scientific career
Fields computer science
Institutions Carnegie Mellon
Doctoral advisor Georg Kreisel

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.

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.

External links


Videos

Youtube | Vimeo | Bing

Websites

Google | Yahoo | Bing

Encyclopedia

Google | Yahoo | Bing

Facebook