Write a Blog >>
Jeremy G. Siek

Registered user since Thu 26 Jun 2014

Name:Jeremy G. Siek

Jeremy Siek is a Professor at Indiana University Bloomington. Jeremy’s areas of research include programming language design, type systems, mechanized theorem proving using proof assistants, and optimizing compilers. Jeremy’s Ph.D. thesis explored foundations for constrained templates, aka the “concepts” proposal for C++. Prior to that, Jeremy developed the Boost Graph Library, a C++ generic library for graph algorithms and data structures. Jeremy post-doc’d at Rice University where he developed the idea of gradual typing: a type system that integrates both dynamic and static typing in the same programming language. Jeremy is currently working on several open questions regarding gradual typing. Is the polymorphic blame calculus really parametric? How should gradual typing be combined with other features such as dependent types? What is the formal criteria for gradually typed languages? Is it possible to create a high-performance implementation of a gradually-typed languages? In 2009 Jeremy received the NSF CAREER award to fund his project: “Bridging the Gap Between Prototyping and Production”. In 2010 and again in 2015, Jeremy was awarded a Distinguished Visiting Fellowship from the Scottish Informatics & Computer Science Alliance.

Country:United States
Affiliation:Indiana University, USA
Research interests:Programming Languages, Gradual Typing, Mechanized Metatheory, Generic Programming


POPL 2020 Session Chair of Gradual Typing / Language Design (part of Research Papers)
Committee Member in Program Committee within the Research Papers-track
WGT 2020 Organizer in Organizing Committee within the WGT-track
Hypercoercions and a Framework for Equivalence of Cast Calculi
Co-chair in Program Committee within the WGT-track
Space-Efficient Monotonic References
Session Chair of Coercions (part of WGT)
Show activities from other conferences

POPL 2020-profile
View general profile