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 next C++ standard. Jeremy authored the Boost
Graph Library and several other libraries in Boost.
Recent Blog Posts
New: Gradual Typing for Mutable Objects
with Michael Vitousek and Shashank Bharadwaj.
New: Interpretations of the Gradually-Typed Lambda Calculus
with Ronald Garcia.
In Scheme and Functional Programming 2012. [pdf],
Reliable Generation of High-Performance Matrix Algebra
with Thomas Nelson, Geoffrey Belter, Elizabeth Jessup, and Boyana Norris.
Submitted to ACM TOMS. (revised from the Arxiv version)
New: Modular Type-Safety Proofs in Agda
with Christopher Schwaab. Accepted for PLPV 2013.
(revised from the Arxiv version)
Modelyze: a Gradually Typed Host Language for Embedding
Equation-Based Modeling Languages
with David Broman. [pdf]
Well-typed Islands Parse Faster
with Erik Silkensen. [arxiv]
Effects for Funargs
with Michael M. Vitousek and Jonathan D. Turner.
The F Machine, an abstract machine for System F.
mechanized type safety proof (in Isabelle).
Dec. 2011. (updated Jan 2)
The C++0x "Concepts" Effort.
Proposal for Constrained Generics and Module Extensions for Chapel.
Blame for All.
In POPL 2011.
- Weiyu Miao (Generic Programming, Metaprogramming, ECEE)
- John Michalakes
(High-Performance Computing for Wind Energy Research, CS)
- Thomas Nelson (Optimization of linear algebra kernels, CS)
- Michael M. Vitousek (Gradual Python, CS)
- Chris Wailes (Chapel and Parallel Programming Languages, CS)
- Geoffrey Belter (Apple)
Ph.D. thesis: Efficient Generation of Sequences of Dense
Linear Algebra through Auto-Tuning
- Shashank Bharadwaj (VMware)
- Jonathan Turner (Microsoft)
- Erik Silkensen (Ph.D. student at Northeastern Univ.)
- Neelam Agrawal (National Instruments)
- Sri Teja Basava (National Instruments)
- Ian Karlin
(Postdoc at Lawrence Livermore National Laboratory)
- Justin Gottschlich (Intel Research Labs)
Ph.D. thesis: Invalidating Transactions: Optimizations, Theory, Guarantees, and Unification
Moss Prescott (Terma Software Labs)
M.S. thesis: Speaking for the Trees: a New (Old) Approach to Languages and Syntax
- Christopher Schwaab
- David Broman (Post-doc at UC Berkeley)
Ph.D. thesis: Meta-Languages and Semantics for Equation-Based Modeling and Simulation
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
- Advice regarding writing research papers, giving research talks,
and writing grant proposals, from one of the best,
- Cheat sheet for getting a job in Embedded Software
(created by Qualcomm). PDF.
- Guidelines for Ph.D. Preliminary Exam Computer Engineering URL.
- Guidelines for Ph.D. Preliminary Exam Computer Science (in Programming Languages) pdf.