Richard Statman
Jump to navigation
Jump to search
![]() |
Richard Statman | |
---|---|
![]() | |
Born | September 6, 1946 | (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
Categories:
- Articles with short description
- Short description is different from Wikidata
- BLP articles lacking sources from July 2008
- All BLP articles lacking sources
- Articles with hCards
- Articles with ISNI identifiers
- Articles with VIAF identifiers
- Articles with WorldCat Entities identifiers
- Articles with BIBSYS identifiers
- Articles with J9U identifiers
- Articles with LCCN identifiers
- Articles with NKC identifiers
- Articles with DBLP identifiers
- Articles with MATHSN identifiers
- Articles with MGP identifiers
- Articles with ZBMATH identifiers
- Articles with SUDOC identifiers
- American computer scientists
- Living people
- 1946 births