A fully abstract games model of Reynolds’ Idealized Algol is described. The model gives a semantic account of the distinction between active types, such as commands, which admit side-effecting behaviour, and passive types, such as expressions, which do not.
