On naturally continuous non-dcpo domains

DOI10.1017/S0960129516000165zbMath1429.06006OpenAlexW2468006416MaRDI QIDQ4593242

Vladimir Yu. Sazonov

Publication date: 22 November 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129516000165

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Expressibility of functionals in D. Scott's LCF language
• The extensional ordering of the sequential functionals
• A uniform approach to inductive posets and inductive closure
• Operational domain theory and topology of sequential programming languages
• Natural non-dcpo domains and f-spaces
• LCF considered as a programming language
• PCF extended with real numbers
• Computable functionals of finite types
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Semantics of a sequential language for exact real-number computation
• On the non-sequential nature of the interval-domain model of real-number computation
• Continuous Lattices and Domains
• Inductive Definition and Domain Theoretic Properties of Fully Abstract
• On sequential functionals of type 3

This page was built for publication: On naturally continuous non-dcpo domains