Harry Mairson

Harry Mairson
Alma materYale University
Stanford University
Known fortype inference for the ML programming language
Hindley–Milner type inference
Scientific career
InstitutionsStanford University
Boston University
Brandeis University
ThesisThe Program Complexity of Searching a Table (1983)
Jeffrey Ullman
Websitehttps://www.cs.brandeis.edu/~mairson/

Harry George Mairson is a theoretical computer scientist and professor of computer science in the Volen National Center for Complex Systems at Brandeis University in Waltham, Massachusetts. His research is in the fields of logic in computer science, lambda calculus and functional programming, type theory and constructive mathematics, computational complexity theory, and algorithmics.[1]

His Ph.D. thesis, The Program Complexity of Searching a Table, won the Machtey Award at the 1983 IEEE Symposium on Foundations of Computer Science (FOCS).[2] Mairson was a Postdoctoral researcher at INRIA Rocqencourt from 1984 to 1985, at Stanford University in 1985, and at the University of Oxford in 1986.[3] He held a visiting professor position from 1999 to 2001 at Boston University. From 2005 to 2007, Mairson has served as the chair of the Faculty Senate at Brandeis. He is currently an associate editor of the journal Logical Methods in Computer Science and Information and Computation, and sits on the editorial board of Higher-Order and Symbolic Computation.[1]

Mairson's contributions to the theory of programming languages include proving that type inference for the ML programming language, so-called Hindley–Milner type inference, is complete for exponential time and that parallel beta reduction is non-elementary.

Education

Mairson received a B.A. in mathematics from Yale University in 1978 and a Ph.D. in computer science from Stanford University in 1984 under the supervision of Jeffrey Ullman.

References

  1. ^ a b "Brandeis University Bulletin 2006-2007" (PDF). Archived from the original (PDF) on 2007-02-06. Retrieved 2007-03-09.
  2. ^ FOCS Best Student Paper Award (Machtey Award)
  3. ^ National Science Foundation proposal 0702312


P ≟ NP 

This biographical article relating to an American computer scientist is a stub. You can help Wikipedia by adding missing information.

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.