Harry Mairson

Ph.D., Computer Science, Stanford University, 1984
mairson at cs dot brandeis dot edu

257 Volen / (781) 736-2724

(brew) Research Interests

Static analysis
Optimal evaluation
Game semantics and proof structures
Expressibility and typed lambda calculus
Polymorphic type inference

Courses

Selected Publications

Other stuff---pictures, photos, poems, etc.

Slides from my invited talk at ICFP 2003, From Hilbert space to Dilbert space: context semantics made simple. (Comments welcome. Sorry -- this is a big file.)

Slides from my talk at GEOCAL 2006, MLL normalization and transitive closure: circuits, complexity, and Euler tours.

Go back up.
Mail comments to webmaster@cs.brandeis.edu.