Jeremy Siek is an Associate Professor of Computer Science in the School of Informatics and Computing at Indiana University. Jeremy teaches courses in programming, programming languages, compilers, logic, and other areas of computer science. Jeremy designs new language features to help programmers create and use software libraries and domain-specific languages, especially generic and high-performance ones. In particular, Jeremy invented the gradual typing approach to mixing static and dynamic type checking within the same language. Prior to that, Jeremy authored the Boost Graph Library and attempted to add concepts to C++. Jeremy is a member of the Programming Languages Group at IU and the Center for Research in Extreme Scale Technologies (CREST).

Email: jsiek@indiana.edu, Office: LH 230D, Blog, Twitter, CV

Upcoming Events

Impact

I’ve been fortunate to see some of my ideas get used in the software industry:

  • Facebook has added gradual typing to PHP. See the article in Wired magazine.
  • Microsoft created a gradually-typed dialect of JavaScript, called TypeScript.
  • The implicits feature of Scala was inspired by my work on concepts for C++.

Recent Papers and Talks

The full list is available on Google Scholar and DBLP.

  • Pycket: A Tracing JIT for a Functional Language, Spenser Bauman, Carl Friedrich Bolz, Robert Hirschfeld,Vasily Krilichev, Tobias Pape, Jeremy G. Siek, Sam Tobin-Hochstadt. Submitted to ICFP 2015. pdf
  • Blame and coercion: Together again for the first time with Peter Thiemann and Philip Wadler. Accepted for PLDI 2015 (November 2014 draft). pdf
  • Refined Criteria for Gradual Typing with Michael M. Vitousek, Matteo Cimini, and John Tang Boyland. In SNAPL 2015. pdf Isabelle
  • Monotonic References for Efficient Gradual Typing with Michael M. Vitousek, Matteo Cimini, Sam Tobin-Hochstadt, and Ronald Garcia. Accepted for ESOP 2015, October 2014. pdf  Isabelle reviews

Teaching

Previous courses at Univ. of Colorado:

CS MS Student Advising

I am available for walk-in advising in my office (LH 230D) on Tuesdays and Thursdays 3:00-4:00pm. If you have a question about fulfilling your MS degree requirements, come with your CS MS Plan filled out. (Here is an example plan.) You may also send me email, with the subject line beginning with “CS MS:”, and I will read and respond to those emails during the walk-in advising time, but giving priority to students who are there in person. If you email me your CS MS Plan, make sure that it is a plain text file, not another format such as MS Word.

Information for Students at IU

Students Advised

  1. John Michalakes (High-Performance Computing for Wind Energy Research)
  2. Thomas Nelson (Optimization of linear algebra kernels)
  3. Michael M. Vitousek (Gradual Python)
  4. Chris Wailes (Chapel and Parallel Programming Languages)

Alumni

  1. Weiyu Miao (Generic Programming, Metaprogramming)
  2. Geoffrey Belter (Apple)
    Ph.D. thesis: Efficient Generation of Sequences of Dense Linear Algebra through Auto-Tuning
  3. Shashank Bharadwaj (VMware)
  4. Jonathan Turner (Microsoft)
  5. Erik Silkensen (Ph.D. student at Northeastern Univ.)
  6. Neelam Agrawal (National Instruments)
  7. Sri Teja Basava (National Instruments)
  8. Ian Karlin (Postdoc at Lawrence Livermore National Laboratory)
  9. Justin Gottschlich (Intel Research Labs)
    Ph.D. thesis: Invalidating Transactions: Optimizations, Theory, Guarantees, and Unification
  10. Moss Prescott (SlamData)
    M.S. thesis: Speaking for the Trees: a New (Old) Approach to Languages and Syntax
  11. Christopher Schwaab (Ph.D. student at the Univ. of St. Andrews)
  12. David Broman (Post-doc at UC Berkeley)
    Ph.D. thesis: Meta-Languages and Semantics for Equation-Based Modeling and Simulation