Abstract

ion for Models of Control Two Corrections Dorai Sitaram Matthias Felleisen Department of Computer Science Rice University Houston, TX 77251-1892 July 29, 1992 1 Environments for Pcf v The original paper [1] defines the domain of environments for call-by-value Pcf as typerespecting maps from the set of variables to domains (cf. [1, page 166]): ae 2 Env implies ae(x t ) 2 D t : Kurt Sieber [Universit¨at des Saarlandes; personal communication: June 29, 1990] discovered that this definition is wrong as the following example demonstrates. Clearly, (if0 x p1q p1q) ' p1q because x must be bound by some surrounding x:-abstraction, which in turn implies that it cannot represent a diverging computation. On the other hand, an environment could map x to bottom and then the denotations of the two expressions would differ. Solution. The correct way to solve this problem is to restrict the set of environments to type-respecting finite maps from variables to non-bottom elements of the appropriat...

Citations