On sequential functionals of type 3

Authors:
Dag Normann
Affiliations:
Department of Mathematics, The University of Oslo, P.O. Box 1053, Blindern N-0316 Oslo, Norway Email: dnormann@math.uio.no
Venue:
Mathematical Structures in Computer Science
Year:
2006

Citing 8
Cited 2

A type-theoretical alternative to ISWIM, CUCH, OWHY

Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Mathematical theory of domains

Mathematical theory of domains
Domain theory

Handbook of logic in computer science (vol. 3)
Domains and lambda-calculi

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

Information and Computation
Finitary PCF is not decidable

Theoretical Computer Science
Full Abstraction for PCF

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Full abstraction, totality and PCF

Mathematical Structures in Computer Science

Operational domain theory and topology of sequential programming languages

Information and Computation
On natural non-dcpo domains

Pillars of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the extensional ordering of the sequential functionals of pure type 3, for example, as defined via game semantics (Abramsky et al. 1994; Hyland and Ong 2000), is not cpo-enriched. This shows that this model does not equal Milner's (Milner 1977) fully abstract model for PCF.