Richard Statman

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 116.74.180.234 (talk) at 19:53, 27 September 2019 (Added link to combinatory logic). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Richard Statman
BornSeptember 6, 1946 (1946-09-06) (age 77)
Alma materStanford University
Scientific career
Fieldscomputer science
InstitutionsCarnegie Mellon
Doctoral advisorGeorg 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 type inhabitation problem in simply typed lambda calculus is PSPACE-complete.

External links

Retrieved from "https://en.wikipedia.org/w/index.php?title=Richard_Statman&oldid=918258154"