Operational domain theory and topology of sequential programming languages
type: Item
instance of: scholarly article
title: Operational domain theory and topology of sequential programming languages
zbMATH Open document ID: 1263.68104
author: Weng Kin Ho
author: Martín Escardo
published in: Information and Computation
publication date: 2009-04-16T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 5544369
MaRDI profile type: Publication
full work available at URL: j.ic.2008.12.003
OpenAlex ID: W2141746484
cites work: Domain theory in logical form
cites work: Full abstraction for PCF
cites work: Q4843177
cites work: Q4222034
cites work: Local realizability toposes and a modal logic for computability
cites work: Q3679172
cites work: On the computational content of the axiom of choice
cites work: Q3360172
cites work: Computability and totality in domains
cites work: Synthetic topology: of data types and classical spaces
cites work: Continuous Lattices and Domains
cites work: Bisimilarity as a theory of functional programming
cites work: Q4288818
cites work: The Role of Compactness in Analysis
cites work: An operational domain-theoretic treatment of recursive types
cites work: On full abstraction for PCF: I, II and III
cites work: Finitary PCF is not decidable
cites work: Q4511324
cites work: From operational semantics to domain theory
cites work: Fully abstract models of typed \(\lambda\)-calculi
cites work: Topology, domain theory and theoretical computer science
cites work: Computability over the partial continuous functionals
cites work: On sequential functionals of type 3
cites work: A note on logical relations between semantics and syntax
cites work: Q4225152
cites work: Q4813228
cites work: LCF considered as a programming language
cites work: Full abstraction, totality and PCF
cites work: Data Types as Lattices
cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY
cites work: Q3316563
cites work: Q4023825
cites work: Interdefinability of parallel operations in PCF
cites work: Domain-Theoretic Foundations of Functional Programming
cites work: Q3994458
cites work: Q4485693
cites work: Tychonoff's Theorem
DOI: 10.1016/J.IC.2008.12.003
description: scientific article; zbMATH DE number 5544369