Universality Results for Models in Locally Boolean Domains

Abstract

In [8] J. Laird has shown that an infinitary sequential extension of PCF has a fully abstract model in his category of locally boolean domains (introduced in [10] ). In this paper we introduce an extension SPCF ∞ of his language by recursive types and show that it is universal for its model in locally boolean domains.

Finally we consider an infinitary target language CPS ∞ for (the) CPS translation (of[18] ) and show that it is universal for a model in locally boolean domains which is constructed like Dana Scott’s D ∞ where \(D = \{\bot,\top\}\).