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).
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.
- The implicits feature of Scala was inspired by my work on concepts for C++.
Recent Papers and Talks
- State of the Art in Gradual Typing at SICSA Summer School on Practical Types slides
- 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. Accepted for ICFP 2015. pdf
Blame and coercion: together again for the first time
Reliable Generation of High-Performance Matrix Algebra
- Refined Criteria for Gradual Typing with Michael M. Vitousek, Matteo Cimini, and John Tang Boyland. In SNAPL 2015. pdf Isabelle slides
- Monotonic References for Efficient Gradual Typing with Michael M. Vitousek, Matteo Cimini, Sam Tobin-Hochstadt, and Ronald Garcia. Published at ESOP 2015. pdf Isabelle reviews
- Blame for All (revised), Amal Ahmed, James T. Perconti, Jeremy G. Siek, and Philip Wadler. draft pdf
- CSCI-C343: Data Structures Fall 2015, Fall 2014, Fall 2013
- CSCI-P523: Programming Language Implementation Spring 2014
- CSCI-B522: Programming Language Foundations Spring 2015
- C++, Short and Sweet, an Online C++ Course for Beginners at Udemy.
Previous courses at Univ. of Colorado:
- Fall 2012: Compiler Construction
- Fall 2011: Fundamentals of Programming Languages
- Fall 2011: Discrete Mathematics for Computer Engineers
- Spring 2011: Discrete Mathematics for Computer Engineers
- Spring 2011: Theorem Proving in Isabelle
- Fall 2010: Compiler Construction
CS MS Student Advising
I am available for walk-in advising in my office (LH 230D) on Tuesdays and Thursdays 3:00-4:00pm during the Fall and Spring semesters. If you have a question about fulfilling your MS degree requirements, prior to coming to my office, send me an email with a list of your courses organized by how they fulfill the degree requirements. The subject line of the email should be “CS MS:”. If you cannot make it to the walk-in time, you may also send me email, 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.
Information for Students at IU
- How do I deal with being on a waitlist during course registration?
- What are the requirements for a CS MS degree?
- What are the requirements for a CS PhD degree?
- Michael M. Vitousek (Gradual Python, i.e., Reticulated)
- Chris Wailes (Parallel Programming Languages)
- Andre Kuhlenschmidt (Compilation of Gradually Typed Languages)
- Deyaaeldeen Almahallawi (Compilation of Gradually Typed Languages)
- Spenser Bauman (Meta-tracing JIT for Racket)
- Steev Young (Dynamic Analysis of Gradually Typed Languages)
- Josie Bealle (Summer Research Opportunity in Computing)
- Andre Yuri (Summer Research Opportunity in Computing)
- Weiyu Miao (Generic Programming, Metaprogramming)
- 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 (SlamData)
M.S. thesis: Speaking for the Trees: a New (Old) Approach to Languages and Syntax
- Christopher Schwaab (Ph.D. student at the Univ. of St. Andrews)
- David Broman (Post-doc at UC Berkeley)
Ph.D. thesis: Meta-Languages and Semantics for Equation-Based Modeling and Simulation