Types are calling conventions
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Dominic Orchard.
Typical first-order imperative languages derive all information about how a function is called from its type. However, in a higher order lazy functional language such as Haskell, this approach leads to the
use of unduly pessimistic assumptions about how functions should be compiled.
This talk explores the consequences of pushing information about function calling convention pervasively into the type system of a compiler intermediate language. I show how this decision allows us to cleanly express several classical and not-so-classical optimisations, as well as express what appears to be an entirely new one.
(Joint work with Simon Peyton Jones, Microsoft Research Cambridge)
This talk is part of the Computer Laboratory Programming Research Group Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|