Abstract
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily sequential functionals is not ω-complete and therefore not continuous in the traditional terminology (in contrast to the old fully abstract continuous dcpo model of Milner). This is also applicable to a wider class of models such as the recently constructed by the author fully abstract (universal) model for \({\bf PCF}^+={\bf PCF} + \textrm{parallel } {\bf if}\). Here we will present an outline of a general approach to this kind of “natural” domains which, although being non-dcpos, allow considering “naturally” continuous functions (with respect to existing directed “pointwise”, or “natural” least upper bounds) and also have appropriate version of “naturally” algebraic and “naturally” bounded complete “natural” domains. This is the non-dcpo analogue of the well-known concept of Scott domains, or equivalently, the complete f-spaces of Ershov. In fact, the latter version of natural domains, if considered under “natural” Scott topology, exactly corresponds to the class of f-spaces, not necessarily complete.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., Jagadeesan, R., Malacaria, P.: Full Abstraction for PCF. Information and Computation 163(2), 409–470 (2000)
Ershov, Y.L.: Computable functionals of finite types. Algebra and Logic 11(4), 367–437 (1972), http://www.springerlink.com doi: 10.1007/BF02219096 (English Version)
Hyland, J.M.E., Ong, C.-H.L.: On Full Abstraction for PCF: I, II, and III. Information and Computation 163, 285–408 (2000)
Milner, R.: Fully abstract models of typed λ-calculi. Theoretical Computer Science 4, 1–22 (1977)
Nickau, H.: Hereditarily-Sequential Functionals: A Game-Theoretic Approach to Sequentiality. Siegen, PhD Thesis (1996)
Normann, D.: On sequential functionals of type 3. Mathematical Structures in Computer Science 16(2), 279–289 (2006)
Plotkin, G.: LCF considered as a programming language. Theoretical Computer Science 5, 223–256 (1977)
Sazonov, V.Y.: Functionals computable in series and in parallel. Sibirskii Matematicheskii Zhurnal 17(3), 648–672 (1976), http://www.springerlink.com , doi: 10.1007/BF00967869 (English Version)
Sazonov, V.Y.: Expressibility of functionals in D.Scott’s LCF language. Algebra and Logic 15(3), 308–330 (1976), http://www.springerlink.com , doi: 10.1007/BF01876321 (English Version)
Sazonov, V.Y.: Inductive Definition and Domain Theoretic Properties of Fully Abstract Models for PCF and PCF. Logical Methods in Computer Science 3(3:7), 1–50 (2007), http://www.lmcs-online.org
Scott, D.S.: A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoretical Computer Science, 121 (1&2), 411–440 Böhm Festschrift (1993) Article has been widely circulated as an unpublished manuscript since (1969)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sazonov, V. (2008). On Natural Non-dcpo Domains. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds) Pillars of Computer Science. Lecture Notes in Computer Science, vol 4800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78127-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-78127-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78126-4
Online ISBN: 978-3-540-78127-1
eBook Packages: Computer ScienceComputer Science (R0)