Jeremy Siek
Musing about programming languages and computer science.
Thursday, September 20, 2012
Interpretations of the GTLC, Part 4: Even Faster
›
Consider the following statically-typed function. (The type \(\star\) does not occur anywhere in this function.) \[ \lambda f: \mathsf{In...
Wednesday, September 19, 2012
Interpretations of the GTLC: Part 3, Going Faster
›
The intuition for an efficient coercion composition function came from thinking about types, not coercions. We'll start with the UD bla...
Tuesday, September 18, 2012
Interpretations of the GTLC, Part 2: Space-Efficient Machines
›
I briefly mentioned in my previous post that there are implementation challenges regarding gradual typing. One of those challenges regards ...
Monday, September 17, 2012
Interpretations of the Gradually-Typed Lambda Calculus, Part 1
›
I just got back from Copenhagen, where I gave a tutorial on gradual typing at the Workshop on Scheme and Functional Programming. I very muc...
Wednesday, August 29, 2012
Rationale for "Type Safety in Five"
›
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 bi...
1 comment:
Friday, August 24, 2012
Type Safety in Five Easy Lemmas
›
A language is type safe if running a program in the language cannot result in an untrapped error . A trapped error is something like an e...
2 comments:
Monday, August 13, 2012
The Work Horse of PL Theory: Structural Induction
›
The main idea in the Crash Course post was that we can define infinite sets and relations by giving a list of rules (some of which are rec...
1 comment:
‹
›
Home
View web version