Richard Statman
American computer scientist (born 1946)
title: "Richard Statman" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["american-computer-scientists", "living-people", "1946-births", "stanford-university-alumni"] description: "American computer scientist (born 1946)" topic_path: "geography/united-states" source: "https://en.wikipedia.org/wiki/Richard_Statman" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0
::summary American computer scientist (born 1946) ::
::data[format=table title="Infobox scientist"]
| Field | Value |
|---|---|
| image | Statman.jpg |
| name | Richard Statman |
| birth_date | |
| field | computer science |
| work_institutions | Carnegie Mellon |
| alma_mater | Stanford University |
| doctoral_advisor | Georg Kreisel |
| :: |
|image = Statman.jpg |image_size = |name = Richard Statman |birth_date = |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. His achievements include the proof that the type inhabitation problem in simply typed lambda calculus is PSPACE-complete, lower bounds on simply typed lambda calculus, logical relations, and intersection types. He was a co-author of the book Lambda Calculus with Types.
References
References
- "Richard Statman".
- (1 July 1979). "Intuitionistic propositional logic is polynomial-space complete". Theoretical Computer Science.
- (September 1977). "18th Annual Symposium on Foundations of Computer Science (SFCS 1977)".
- (May 1985). "Logical relations and the typed λ-calculus". Information and Control.
- (October 2016). "How to Think of Intersection Types as Cartesian Products". Electronic Notes in Theoretical Computer Science.
- (2013). "Lambda calculus with types". Cambridge Univ. Press.
::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::