| Harry Mairson | |
| Alma Mater: | Yale University Stanford University |
| Thesis Title: | The Program Complexity of Searching a Table |
| Thesis Url: | https://ieeexplore.ieee.org/document/4568059 |
| Thesis Year: | 1983 |
| Doctoral Advisor: | Jeffrey Ullman |
| Known For: | type inference for the ML programming language Hindley–Milner type inference |
| Website: | https://www.cs.brandeis.edu/~mairson/ |
| Work Institution: | Stanford University Boston University Brandeis University |
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.
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.