We extend type specialisation to a computational lambda calculus with
first-class references. The resulting specialiser has been used to spe
cialise a self-interpreter for this typed computational lambda calculu
s optimally. Furthermore, this specialiser can perform operations on r
eferences st specialisation time, when possible.