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 in the next C++ standard. Jeremy authored the Boost Graph Library and several other libraries in Boost.

Upcoming and Recent Events:

Open Position: post-doctoral researcher with expertise in compilers and systems. Read more about the position here.

Program Committee: Script to Program Evolution (STOP 2009)

Talk: Exploring the Design Space of Higher-Order Casts. ESOP 2009.

Talk: Space-Efficient Blame Tracking for Gradual Typing. University of Edinburgh, March 2009.

Award: NSF CAREER: Bridging the Gap Between Prototyping and Production.

Program Committee: PLDI 2009

Program Committee: Working Conference of Domain Specific Languages

Guest editor: special issue of the Science of Computer Programming Journal on Library-Centric Software Design.

New papers

• Automating the Generation of Composed Linear Algebra Kernels. Accepted for SC09. [pdf]
• An Efficient Lock-Aware Transactional Memory Implementation. Accepted for ICOOLPS 2009.
• Threesomes, With and Without Blame. Accepted for STOP 2009. [pdf]
• Exploring the Design Space of Higher-Order Casts. In ESOP 2009. [pdf] [bib]

Teaching

• Spring 2009: ECEN 5043 & CSCI 7818: Software Engineering Reusable Components
• Fall 2008: ECEN 4553/5013 & CSCI 4555/5525: Introduction to Compiler Construction
• Spring 2008: ECEN 5023 & CSCI 7135-001: Types and Programming Languages
• Fall 2007: ECEN 4553/5013 & CSCI 4555/5525: Introduction to Compiler Construction
• Spring 2007: CSCI 4448/6448: Object-Oriented Analysis and Design
• Spring 2007: CSCI 7000-000: Practical Theorem Proving with Isabelle/Isar
• Fall 2006: CSCI 2830: Computer Science as a Field of Work and Study.

Students

• Joe Angell (Gradual Typing)
• Geoffrey Belter (High-level optimization of linear algebra kernels)
• Justin Gottschlich (Transactional Memory)
• Ian Karlin (Memory-efficient linear algebra)
• Weiyu Miao (Generic Programming, Metaprogramming)
• Christopher Schwaab (Gradual Typing)

Interesting Quotes

If you can't solve a problem, then there's an easier problem you can solve: find it. - George Polya

Writing is best done by coinduction! - Lynn Winebarger