Richard Statman

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.

Richard Statman
BornSeptember 6, 1946 (1946-09-06) (age 74)
Alma materStanford University
Scientific career
Fieldscomputer science
InstitutionsCarnegie Mellon
Doctoral advisorGeorg Kreisel

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.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.