Jeremy's research interests include generic programming, programming
language design, type systems, logic, compilation, and
high-performance computing. Jeremy created the gradual typing approach
to mixing static and dynamic typing and he was one of the architects
of the concepts
feature that dramatically missed making into the C++ 2010 standard. Jeremy authored the Boost
Graph Library and several other libraries in Boost.
Upcoming and Recent Events:
Software release: Build to Order BLAS v1, a high-performance
compiler for basic linear algebra.
Keynote: General Purpose Languages Should be Metalanguages.
At PEPM 2010.
Jan. 19, 2010. slides in pdf.
Talk: Threesomes, With and Without Blame.
At POPL 2010.
Jan. 20-22, 2010.
Talk: Automating the Generation of Composed Linear Algebra Kernels.
At SC09, Nov. 17, 2009.
Talk: Build to Order Linear Algebra Kernels.
At NSF-NAIS Workshop on Intelligent Software,
October 20, 2009. Edinburgh, UK.
General Chair: Generative Programming and Component Engineering (GPCE 2009). Oct. 4-5.
Talk: Build To Order BLAS.
CScADS Workshop on Libraries and Autotuning for Petascale Applications,
Tahoe, CA. Aug. 10-12, 2009.
News: The Concept extension was removed from the C++ draft standard.
Here is my take on it, Doug Gregor's, and Bjarne Stroustrup's.
Open Position: post-doctoral researcher with expertise in compilers and systems.
Read more about the position here.
Program Committee: Types in Language Design and Implementation (TLDI 2010)
Award: NSF CAREER: Bridging the Gap Between Prototyping and Production.
Guest editor: special issue of the Science of Computer Programming
Journal on Library-Centric Software Design.
