Richard Statman
{{short description|American computer scientist (born 1946)}}
{{BLP sources|date=July 2008}}
{{Infobox scientist
|image = Statman.jpg
|image_size =
|name = Richard Statman
|birth_date = {{birth-date and age|September 6, 1946}}
|birth_place =
|death_date =
|death_place =
|residence =
|citizenship =
|nationality =
|ethnicity =
|field = computer science
|work_institutions = Carnegie Mellon
|alma_mater = Stanford University
|doctoral_advisor = Georg Kreisel
|doctoral_students =
|known_for =
|author_abbrev_bot =
|author_abbrev_zoo =
|prizes =
|religion =
|signature =
|footnotes =
}}
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.{{cite web |title=Richard Statman |url=https://www.genealogy.math.ndsu.nodak.edu/id.php?id=44093 |website=Mathematics Genealogy Project}} His achievements include the proof that the type inhabitation problem in simply typed lambda calculus is PSPACE-complete,{{cite journal |last1=Statman |first1=Richard |title=Intuitionistic propositional logic is polynomial-space complete |journal=Theoretical Computer Science |date=1 July 1979 |volume=9 |issue=1 |pages=67–72 |doi=10.1016/0304-3975(79)90006-9|hdl=2027.42/23534 |hdl-access=free }} lower bounds on simply typed lambda calculus,{{cite book |last1=Statman |first1=Richard |title=18th Annual Symposium on Foundations of Computer Science (SFCS 1977) |chapter=The typed λ-calculus is not elementary recursive |date=September 1977 |pages=90–94 |doi=10.1109/SFCS.1977.34}} logical relations,{{cite journal |last1=Statman |first1=R. |title=Logical relations and the typed λ-calculus |journal=Information and Control |date=May 1985 |volume=65 |issue=2–3 |pages=85–97 |doi=10.1016/S0019-9958(85)80001-2}} and intersecton types.{{cite journal |last1=Statman |first1=Rick |title=How to Think of Intersection Types as Cartesian Products |journal=Electronic Notes in Theoretical Computer Science |date=October 2016 |volume=325 |pages=305–312 |doi=10.1016/j.entcs.2016.09.045|doi-access=free }} He was a co-author of the book Lambda Calculus with Types.{{cite book |last1=Barendregt |first1=Hendrik P. |last2=Dekkers |first2=Wil |last3=Statman |first3=Richard |last4=Alessi |first4=Fabio |title=Lambda calculus with types |date=2013 |publisher=Cambridge Univ. Press |location=Cambridge |isbn=9780521766142 |edition=1. publ}}
References
{{reflist}}
External links
- [https://www.cmu.edu/math/people/faculty/statman.html Carnegie Mellon profile]
{{Authority control}}
{{DEFAULTSORT:Statman, Richard}}