A fully abstract games model of Reynolds' idealized Algol is described. The
model gives a semantic account of the distinction between active types, su
ch as commands, which admit side-effecting behaviour, and passive types, su
ch as expressions, which do not. (C) 1999 Elsevier Science B.V. All rights
reserved.