Richard Statman Explained

Richard Statman
Field:	computer science
Work Institutions:	Carnegie Mellon
Alma Mater:	Stanford University
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^[1] . His achievements include the proof that the type inhabitation problem in simply typed lambda calculus is PSPACE-complete^[2], lower bounds on simply typed lambda calculus^[3], logical relations^[4], and intersecton types^[5] . He was a co-author of the book Lambda Calculus with Types^[6] .

External links

• Carnegie Mellon profile

Notes and References

1. Web site: Richard Statman . Mathematics Genealogy Project.
2. Statman . Richard . Intuitionistic propositional logic is polynomial-space complete . Theoretical Computer Science . 1 July 1979 . 9 . 1 . 67–72 . 10.1016/0304-3975(79)90006-9. 2027.42/23534 . free .
3. Statman . Richard . The typed ?-calculus is not elementary recursive . 18th Annual Symposium on Foundations of Computer Science (SFCS 1977) . September 1977 . 90–94 . 10.1109/SFCS.1977.34.
4. Statman . R. . Logical relations and the typed λ-calculus . Information and Control . May 1985 . 65 . 2–3 . 85–97 . 10.1016/S0019-9958(85)80001-2.
5. Statman . Rick . How to Think of Intersection Types as Cartesian Products . Electronic Notes in Theoretical Computer Science . October 2016 . 325 . 305–312 . 10.1016/j.entcs.2016.09.045. free .
6. Book: Barendregt . Hendrik P. . Dekkers . Wil . Statman . Richard . Alessi . Fabio . Lambda calculus with types . 2013 . Cambridge Univ. Press . Cambridge . 9780521766142 . 1. publ.