Universality results for models in locally boolean domains

Authors:
Tobias Löw;Thomas Streicher
Affiliations:
TU Darmstadt, Darmstadt;TU Darmstadt, Darmstadt
Venue:
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Year:
2006

Citing 10
Cited 0

Stability and computability in coherent domains

Information and Computation
Fully abstract semantics for observably sequential languages

Information and Computation
Kripke logical relations and PCF

Information and Computation
Domains and lambda-calculi

Domains and lambda-calculi
On full abstraction for PCF: I, II, and III

Information and Computation
Full abstraction for PCF

Information and Computation
Finitary PCF is not decidable

Theoretical Computer Science
A Fully Abstract Game Semantics for Finite Nondeterminism

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Classical logic, continuation semantics and abstract machines

Journal of Functional Programming
Locally boolean domains

Theoretical Computer Science - Applied semantics: Selected topics

Quantified Score

Hi-index	0.00

Visualization

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\}$.