Fully Abstract Models of Programming Languages
Allen Stoughton
chapter Preface, Introduction, Bibliography and Index, pages i--iv, 1--7
and 119--123
Research Notes in Theoretical Computer Science. Pitman, 1988
Available as PostScript.
Abstract:
From the preface: This monograph presents a language-independent theory of
fully abstract denotational semantics of programming languages---models
that identify program fragments exactly when they are operationally
interchangeable---and uses this theory to show the existence or nonexistence
of such models for several example programming languages. It is intended for
researchers in programming language semantics, and is mathematically
self-contained: only naive set theory and some very basic notions of category
theory are assumed. Some familiarity with universal algebra and domain theory
would be helpful, however.
Comments:
School of Mathematical and Physical Sciences,
University of Sussex.
![[BRICS symbol]](http://www.daimi.aau.dk/BRICS/GIF/BRICS/msymbol8mm.GIF)
BRICS WWW home page