Richard Statman
 | The topic of this article may not meet Wikipedia's notability guideline for academics. (July 2008) |
Richard Statman | |
|---|---|
| Born | Sept 6, 1946 |
| Alma mater | Stanford University |
| Scientific career | |
| Fields | computer science |
| Institutions | Carnegie Mellon |
| Doctoral advisor | Georg Kreisel |
| Doctoral students | Enrico Tronci |
Richard Statman 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 type inhabitation problem in simply typed lambda calculus is PSPACE-complete.