## Profile

Jeremy Siek
Works at Indiana University Bloomington
Attended University of Notre Name
Lives in Bloomington, IN
460 followers|24,747 views

## Stream

### Jeremy Siek

Shared publicly  -

The Publication Process in Programming Languages
There was an interesting discussion at the ACM SIGPLAN Meeting at POPL 2014 regarding the problems and potential solutions with the publication process within programming languages. The discussion centered around the problem that we primarily publish in con...﻿
There was an interesting discussion at the ACM SIGPLAN Meeting at POPL 2014 regarding the problems and potential solutions with the publication process within programming languages. The discussion centered around the problem ...
8

Yes, I enjoyed our discussion about this in Indy. Let's keep peddling this idea! And find more people to help us peddle it :)﻿

### Jeremy Siek

Shared publicly  -

Last year I wrote a blog post showing how proofs of type safety can be done with just five easy lemmas if one defines the programming language in a certain way, using a special abstract machine. In this blog post I'll improve...
4
1

### Jeremy Siek

Shared publicly  -

Consider the following TypeScript program, in which a number is stored in variable x of type any and then passed to the display function that expects a string. As we saw in the previous post, a gradua...
3

### Jeremy Siek

Shared publicly  -

Consider the following statically-typed function. (The type $$\star$$ does not occur anywhere in this function.) \[ \lambda f: \mathsf{Int}{\to}\mathsf{Int}. \; x{:}\mathsf{Int} = f(42); \mathbf{retur...
1

### Jeremy Siek

Shared publicly  -

I briefly mentioned in my previous post that there are implementation challenges regarding gradual typing. One of those challenges regards space efficiency. In their paper Space-Efficient Gradual Typi...
1

### Jeremy Siek

Shared publicly  -

In my last post Type Safety in Five Easy Lemmas, I made a claim that the formulation of the operational semantics of a language makes a big difference regarding how many lemmas, and how tedious, the p...
2
In his circles
247 people
Have him in circles
460 people

### Jeremy Siek

Shared publicly  -

As of August 1, 2013 I am starting a new job as an Associate Professor in the Computer Science Division of the School of Informatics (SOIC) at Indiana University (IU). If you're unfamiliar with Indiana University, you might w...
7

Also, just to break out your math a bit:
Boulder beats Bloomington, 10 to -2.
IU beats CU, 10 to -4.  ﻿

### Jeremy Siek

Shared publicly  -

Back in Part 1 of this series, I mentioned that there is a design choice between eager and lazy cast checking. Recall the following example. \begin{align*} & \mathsf{let}\, f = (\lambda x:\mathsf{...
1

### Jeremy Siek

Shared publicly  -

If you haven't heard already, there's a new language named TypeScript from Microsoft, designed by Anders Hejlsberg and several others, including a recent alumni from my research group named Jo...
2
1

### Jeremy Siek

Shared publicly  -

Interpretations of the GTLC: Part 3, Going Faster﻿
1

### Jeremy Siek

Shared publicly  -

I just got back from Copenhagen, where I gave a tutorial on gradual typing at the Workshop on Scheme and Functional Programming. I very much enjoyed the workshop and giving the tutorial. Thank you for...
1

### Jeremy Siek

Shared publicly  -

A language is type safe if running a program in the language cannot result in an untrapped error. A trappeed error is something like an exception or a message-not-found error, that is, it's an error t...
3
1

Thanks!﻿
People
In his circles
247 people
Have him in circles
460 people
Work
Occupation
Associate Professor
Employment
• Indiana University Bloomington
Associate Professsor, 2013 - present
• University of Colorado at Boulder
Assistant Professor, 2007 - 2013
Places
Currently
Bloomington, IN
Previously
Boulder, CO - Redmond, WA - South Bend, IN
Other profiles
Contributor to
Story
Tagline
Prof. at Indiana University Bloomington
Introduction
Jeremy teaches courses on programming languages, compilers, data structures and algorithms, logic, and discrete math. He conducts research in PL, generic programming, and high-performance computing.
Bragging rights
Boost Graph Library, Gradual Typing, C++ "Concepts", NSF CAREER, SICSA Distinguished Fellowship
Education
• University of Notre Name
B.S. Mathematics, 1993 - 1997
• Indiana University
Ph.D. Computer Science, 2000 - 2005
• University of Notre Dame
M.S. Computer Science and Engineering, 1997 - 1999
Basic Information
Gender
Male