Richard Statman

Richard Statman (born September 6, 1946) is an American computer scientist whose principal research interest is the theory of computation, especially symbolic c

Richard Statman
Richard Statman
BornSeptember 6, 1946 (1946-09-06) (age 79)
Alma materStanford University
Scientific career
Fieldscomputer science
WorkplacesCarnegie Mellon
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 intersection types.[5] He was a co-author of the book Lambda Calculus with Types.[6]

References

  1. ^ "Richard Statman". Mathematics Genealogy Project.
  2. ^ 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. hdl:2027.42/23534.
  3. ^ Statman, Richard (September 1977). "The typed λ-calculus is not elementary recursive". 18th Annual Symposium on Foundations of Computer Science (SFCS 1977). pp. 90–94. doi:10.1109/SFCS.1977.34.
  4. ^ 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.
  5. ^ 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.
  6. ^ Barendregt, Hendrik P.; Dekkers, Wil; Statman, Richard; Alessi, Fabio (2013). Lambda calculus with types (1. publ ed.). Cambridge: Cambridge Univ. Press. ISBN 9780521766142.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.