Bidomains and Full Abstraction for Countable Nondeterminism
We describe a denotational semantics for a sequential functional language with random number generation over a countably infinite set (the natural numbers), and prove that it is fully abstract with respect to may-and-must testing.
Our model is based on biordered sets similar to Berry’s bidomains, and stable, monotone functions. However, (as in prior models of unbounded non-determinism) these functions may not be continuous. Working in a biordered setting allows us to exploit the different properties of both extensional and stable orders to construct a Cartesian closed category of sequential, discontinuous functions, with least and greatest fixpoints having strong enough properties to prove computational adequacy.
We establish full abstraction of the semantics by showing that it contains a simple, first-order “universal type-object” within which all types may be embedded using functions defined by (countable) ordinal induction.
KeywordsOperational Semantic Functional Language Denotational Semantic Stable Order Game Semantic
- 3.Cartwright, R., Felleisen, M.: Observable sequentiality and full abstraction. In: Proceedings of POPL 1992 (1992)Google Scholar
- 4.Curien, P.-L., Winskel, G., Plotkin, G.: Bistructures, bidomains and linear logic. In: Milner Festschrift, MIT Press, Cambridge (1997)Google Scholar
- 6.Harmer, R., McCusker, G.: A fully abstract games semantics for finite non-determinism. In: Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS 1999, IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
- 9.Lassen, S.B., Pitcher, C.: Similarity and bisimilarity for countable non-determinism and higher-order functions. Electronic Notes in Theoretical Computer Science 10 (1997)Google Scholar
- 10.Levy, P.B.: Infinite trace equivalence. In: Games for Logic and Programming Languages, pp. 195–209 (2005)Google Scholar
- 11.Longley, J.: Universal types and what they are good for. In: Domain Theory, Logic and Computation: Proceedings of the 2nd International Symposium on Domain Theory, Kluwer, Dordrecht (2004)Google Scholar
- 12.Plotkin, G.: Lectures on predomains and partial functions, Notes for a course given at the Center for the study of Language and Information, Stanford (1985)Google Scholar