Domain-Theoretic Foundations of Functional Programming
Thomas Streicher · WORLD SCIENTIFIC eBooks · 2006
PCF and Its Operational Semantics The Scott Model of PCF Computational Adequacy Milner's Context Lemma The Full Abstraction Problem Logical Relations Some Structural Properties of the D Solutions of Recursive Domain Equations Characterisation of Fully Abstract Models Sequential Domains as a Model of PCF The Model of PCF in S is Fully Abstract Computability in Domains.