Richard Statman
 |
Richard Statman | |
|---|---|
 | |
| Born | September 6, 1946 (age 78) |
| 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
[edit]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
[edit]| International | |
|---|---|
| National | |
| Academics | |
| Other | |
- ^ "Richard Statman". Mathematics Genealogy Project.
- ^ Statman, Richard (1 July 1979). "Intuitionistic propositional logic is polynomial-space complete". Theoretical Computer Science. 9 (1): 67–72. doi:10.1016/0304-3975(79)90006-9.
- ^ Statman, Richard (September 1977). "The typed ?-calculus is not elementary recursive". 18th Annual Symposium on Foundations of Computer Science (sfcs 1977): 90–94. doi:10.1109/SFCS.1977.34.
- ^ Statman, R. (May 1985). "Logical relations and the typed λ-calculus". Information and Control. 65 (2–3): 85–97. doi:10.1016/S0019-9958(85)80001-2.
- ^ Statman, Rick (October 2016). "How to Think of Intersection Types as Cartesian Products". Electronic Notes in Theoretical Computer Science. 325: 305–312. doi:10.1016/j.entcs.2016.09.045.
- ^ Barendregt, Hendrik P.; Dekkers, Wil; Statman, Richard; Alessi, Fabio (2013). Lambda calculus with types (1. publ ed.). Cambridge: Cambridge Univ. Press. ISBN 9780521766142.