The last decade has seen a number of approaches to datatype-generic programming:
PolyP, Functorial ML,'Scrap Your Boilerplate', Generic Haskell,'Generics for the Masses', and …

The static single assignment (SSA) form is central to a range of optimisation algorithms
relying on data flow information, and hence, to the correctness of compilers employing those …

Statically typed languages with Hindley-Milner polymorphism have long been compiled
using inefficient and fully boxed data representations. Recently, several new compilation …

A certified binary is a value together with a proof that the value satisfies a given specification.
Existing compilers that generate certified code have focused on simple memory and control …

A Hindley-Milner type system such as ML's seems to prohibit type-indexed values, ie.,
functions that map a family of types to a family of values. Such functions generally perform …

We describe a new method for polymorphic type inference for the dynamically typed
language Scheme. The method infers both types and explicit run-time type operations(coerc …

There is growing interest in the use of richly-typed intermediate languages in sophisticated
compilers for higher-order, typed source languages. These intermediate languages are …

Typed Assembly Languages (TALs) are used to validate the safety of machine-language
programs. The Foundational Proof-Carrying Code project seeks to verify the soundness of …

Increasing trends towards adaptive, distributed, generative and pervasive software have
made object-oriented dynamically typed languages become increasingly popular. These …

Modular languages support generative type abstraction, ensuring that an abstract type is
distinct from its representation, except inside the implementation where the two are …