Correspondence between operational and denotational semantics: the full abstraction problem for PCF*
C -H L Ong · 1995
Abstract This chapter addresses a number of computationally relevant mathematical problems arising from the relationship between operational and denotational semantics of higher-type (or higher-order) sequential functional programming languages. We choose Scott’s language PCF (which stands for Programs for Computable Functions) as the vehicle for developing the leading ideas.