How can we integrate interaction into a purely declarative language? This tutorial describes
a solution to this problem based on a monad. The solution has been implemented in the …

Graph-based intermediate representations (IRs) are widely used for powerful compiler
optimizations, either interprocedurally in pure functional languages, or intraprocedurally in …

Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where
all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) …

Optimizations in a traditional compiler are applied sequentially, with each optimization
destructively modifying the program to produce a transformed program that is then passed to …

We present a strikingly simple partial evaluator, that is type-directed and reifies a compiled
program into the text of a residual, specialized program. Our partial evaluator is concise (a …

Reflection is a wide-ranging concept that has been studied independently in many different
areas of science in general, and computer science in particular. Even in the sub-area of …

We show that standard formulations of intersection type systems are unsound in the
presence of computational effects, and propose a solution similar to the value restriction for …

Type systems usually characterize the shape of values but not their free variables. However,
many desirable safety properties could be guaranteed if one knew the free variables …

We present a series of CPS-based intermediate languages suitable for functional language
compilation, arguing that they have practical benefits over direct-style languages based on A …

A tension in language design has been between simple semantics on the one hand, and
rich possibilities for side-effects, exception handling and so on on the other. The introduction …