Jeremy G. Siek is a Professor at Indiana University Bloomington in the School of Informatics and Computing. His research spans programming language design, type systems, gradual typing, mechanized theorem proving, and optimizing compilers. Gradual typing integration in functional languages Co-inventor of the Boost Graph Library Former NSF CAREER award recipient Active in programming language foundations research Jeremy's research focuses on reconciling static and dynamic type checking through gradual typing, with current work on parametricity in polymorphic blame calculus, combining gradual typing with dependent types, and formal criteria for gradual type systems. He investigates high-performance implementations of gradual typing and its application to security enforcement. His recent publications examine verified nanopass compilers, gradual security guarantees, and parameterized cast calculi. He has received multiple distinguished visiting fellowships and maintains the Deduce proof assistant for educational use. NSF CAREER Award (2009) Distinguished Visiting Fellowships (2010, 2015) Jeremy leads the Center for Programming Systems at IU and advises Ph.D. students Tianyu Chen (gradual security) and Darshal Shetty (gradual dependent types). He teaches courses in compilers, data structures, and programming language foundations.