Richard Statman

Richard Statman
Born September 6, 1946 (1946-09-06) (age 70)
Fields computer science
Institutions Carnegie Mellon
Alma mater Stanford University
Doctoral advisor Georg Kreisel
Doctoral students Enrico Tronci

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.


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 type inhabitation problem in simply typed lambda calculus is PSPACE-complete.

This article is issued from Wikipedia - version of the 10/18/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.