Summary: Full Abstraction for Idealized Algol with Passive
University of Edinburgh
Department of Computer Science
James Clerk Maxwell Building
Edinburgh EH9 3JZ
St John's College
Oxford OX1 3JP,
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 sideeffecting behaviour, and pas
sive types, such as expressions, which do not.
Keywords: Algollike languages, game semantics, full abstraction.