Thu 16 Jun 2022 13:30 - 13:50 at Macaw - Types Chair(s): Michael Greenberg

A language supporting polymorphism is a boon to programmers: they can express complex ideas once and reuse functions in a variety of situations. However, polymorphism is pain for compilers tasked with producing efficient code that manipulates concrete values.

This paper presents a new intermediate language that allows for efficient static compilation, while still supporting flexible polymorphism. Specifically, it permits polymorphism over not only the types of values, but also the representation of values, the arity of primitive machine functions, and the evaluation order of arguments—all three of which are useful in practice. The key insight is to encode information about a value’s calling convention in the kind of its type, rather than in the type itself.
this URL might only work when visiting from a URL.

Thu 16 Jun

Displayed time zone: Pacific Time (US & Canada) change