Summary: Full Abstraction for Idealized Algol with Passive
Expressions
Samson Abramsky
University of Edinburgh
Department of Computer Science
James Clerk Maxwell Building
Edinburgh EH9 3JZ
Scotland
samson@dcs.ed.ac.uk
Guy McCusker
St John's College
Oxford OX1 3JP,
England
mccusker@comlab.ox.ac.uk
Abstract
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 pas­
sive types, such as expressions, which do not.
Keywords: Algol­like languages, game semantics, full abstraction.

Source: Abramsky, Samson - Computing Laboratory, University of Oxford
McCusker, Guy - Department of Computer Science, University of Bath

Collections: Computer Technologies and Information Sciences