Jeremy G. Siek: Home

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.

Upcoming and Recent Events:

Workshop on Foundations of Object-Oriented Languages (FOOL 2013), Oct. 27 or 28, co-located with SPLASH 2013.

I am moving to Bloomington, Indiana! I have accepted a job offer from Indiana University and look forward to joining their Programming Languages Group.

Ad: Postdoc Position in Programming Languages

Keynote: The gradual typing approach to mixing static and dynamic typing, at Trends in Functional Programming (TFP) 2013 [slides].

Talk: Type Safety In Five Easy Lemmas. slides

C++, Short and Sweet, an Online C++ Course for Beginners at Udemy.

Program Committee: POPL 2014, San Diego, January 2014.

Program Committee: GPCE 2013, Oct. 27-28, 2013. (colocated with SPLASH)

Microsoft releases TypeScript, a new dialect of JavaScript inspired by my research on gradual typing.

NSF Award: Modular Reflection

Effects for Funargs, presentation at HOPE 2012. [slides]

Interpretations of the Gradually-Typed Lambda Calculus, distilled tutorial at Scheme'12, [code]

Workshop on Foundations of Object-Oriented Languages (FOOL 2012) co-located with SPLASH, Oct. 22, 2012, Tucson, AZ.

Program Committee: PLDI 2013, June 16-21, 2013. Seattle, Washington.

Program Committee: PEPM 2013, January 20-21, 2013. Rome, Italy.


	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. Upcoming and Recent Events: Workshop on Foundations of Object-Oriented Languages (FOOL 2013), Oct. 27 or 28, co-located with SPLASH 2013. I am moving to Bloomington, Indiana! I have accepted a job offer from Indiana University and look forward to joining their Programming Languages Group. Ad: Postdoc Position in Programming Languages Keynote: The gradual typing approach to mixing static and dynamic typing, at Trends in Functional Programming (TFP) 2013 [slides]. Talk: Type Safety In Five Easy Lemmas. slides C++, Short and Sweet, an Online C++ Course for Beginners at Udemy. Program Committee: POPL 2014, San Diego, January 2014. Program Committee: GPCE 2013, Oct. 27-28, 2013. (colocated with SPLASH) Microsoft releases TypeScript, a new dialect of JavaScript inspired by my research on gradual typing. NSF Award: Modular Reflection Effects for Funargs, presentation at HOPE 2012. [slides] Interpretations of the Gradually-Typed Lambda Calculus, distilled tutorial at Scheme'12, [code] Workshop on Foundations of Object-Oriented Languages (FOOL 2012) co-located with SPLASH, Oct. 22, 2012, Tucson, AZ. Program Committee: PLDI 2013, June 16-21, 2013. Seattle, Washington. Program Committee: PEPM 2013, January 20-21, 2013. Rome, Italy. Recent Blog Posts New Papers New: Gradual Typing for Mutable Objects with Michael Vitousek and Shashank Bharadwaj. (draft) [pdf] New: Interpretations of the Gradually-Typed Lambda Calculus with Ronald Garcia. In Scheme and Functional Programming 2012. [pdf], [code] 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) [pdf] New: Modular Type-Safety Proofs in Agda with Christopher Schwaab. Accepted for PLPV 2013. (revised from the Arxiv version) [pdf] 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. Description and mechanized type safety proof (in Isabelle). Dec. 2011. (updated Jan 2) The C++0x "Concepts" Effort. [At Springer] Proposal for Constrained Generics and Module Extensions for Chapel. Feb. 2011 [pdf] Blame for All. In POPL 2011. [bib] Teaching C++, Short and Sweet, an Online C++ Course for Beginners at Udemy. Fall 2012: ECEN 4553/5523 & CSCI 4555/5525: Compiler Construction C++, Short and Sweet: an introduction to C++ on Mondays through April 16 at 11am, ECCS 1B28, Spring 2012. source files. ECEN 5533, CSCI 5535: Fundamentals of Programming Languages ECEN 2703: Discrete Mathematics for Computer Engineers Spring 2011: ECEN 2703: Discrete Mathematics for Computer Engineers Spring 2011: ECEN 5013: Theorem Proving in Isabelle Fall 2010: ECEN 4553/5523 & CSCI 4555/5525: Compiler Construction Students 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) Alumni 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 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 Resources Advice regarding writing research papers, giving research talks, and writing grant proposals, from one of the best, Simon Peyton-Jones. 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.