\(\mathbb{T}^\omega\) as a universal domain
type: Item
instance of: scholarly article
title: \(\mathbb{T}^\omega\) as a universal domain
zbMATH Open document ID: 0419.03007
DOI: 10.1016/0022-0000(78)90006-5
published in: Journal of Computer and System Sciences
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 03C99
Mathematics Subject Classification ID: 03D99
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 3652304
zbMATH Keywords: lambda beta calculus
zbMATH Keywords: mathematical semantics
zbMATH Keywords: programming languages
zbMATH Keywords: computable functions
zbMATH Keywords: domains
zbMATH Keywords: complete partial orders
zbMATH Keywords: universal domain
zbMATH Keywords: infinite sequences of truth-values
zbMATH Keywords: the class of ordered pairs of disjoint sets of integers
zbMATH Keywords: continuous functions
zbMATH Keywords: topological aspects
author: Gordon D. Plotkin
MaRDI profile type: Publication
full work available at URL: 0022-0000(78)90006-5
OpenAlex ID: W2072497723
cites work: Q4131618
cites work: A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
cites work: Bases for Chain-complete Posets
cites work: Q5601829
cites work: LCF considered as a programming language
cites work: A Powerdomain Construction
cites work: Q5573961
cites work: Q5649639
cites work: Data Types as Lattices
cites work: Q4109652
cites work: Effectively given domains
cites work: Q4195918
cites work: The Category-Theoretic Solution of Recursive Domain Equations
cites work: The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
description: scientific article; zbMATH DE number 3652304