\(\mathbb{T}^\omega\) as a universal domain

DOI10.1016/0022-0000(78)90006-5zbMath0419.03007OpenAlexW2072497723MaRDI QIDQ1132085

Gordon D. Plotkin

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90006-5

zbMATH Keywords

domainsprogramming languagescomputable functionscontinuous functionscomplete partial ordersuniversal domaintopological aspectsinfinite sequences of truth-valueslambda beta calculusmathematical semanticsthe class of ordered pairs of disjoint sets of integers

Mathematics Subject Classification ID

Model theory (03C99) Semantics in the theory of computing (68Q55) Computability and recursion theory (03D99) Combinatory logic and lambda calculus (03B40)

Related Items (44)

\(\mathbb T^\omega\) as a stable universal domain. ⋮ Atomicity, coherence of information, and point-free structures ⋮ Universal profinite domains ⋮ Configuration structures, event structures and Petri nets ⋮ Trees from Functions as Processes ⋮ Universal domains and the amalgamation property ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Limiting semantics of numerical programs ⋮ Properties of domain representations of spaces through dyadic subbases ⋮ Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ Varieties of chain-complete algebras ⋮ A stable universal domain related to ^ω ⋮ Free upper regular bands ⋮ A category-theoretic characterization of functional completeness ⋮ Nonflatness and totality ⋮ Intrinsic approach spaces on domains ⋮ Universal homogeneous event structures and domains ⋮ What is a universal higher-order programming language? ⋮ Finite type structures within combinatory algebras ⋮ On stable domains ⋮ Representations of Complete Uniform Spaces via Uniform Domains ⋮ Unnamed Item ⋮ Cartesian closed categories of separable Scott domains ⋮ On the ubiquity of certain total type structures ⋮ Realizability models refuting Ishihara's boundedness principle ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Domains via graphs ⋮ Lazy Lambda calculus: Theories, models and local structure characterization ⋮ Coherence and consistency in domains ⋮ Stability and computability in coherent domains ⋮ Induction and recursion on the partial real line with applications to Real PCF ⋮ Continuously generated fixed points ⋮ On the semantics of polymorphism ⋮ Properly injective spaces and function spaces ⋮ Completeness of type assignment in continuous lambda models ⋮ Algebraic domain equations ⋮ The constructive maximal point space and partial metrizability ⋮ Existence of strongly proper dyadic subbases ⋮ Almost Every Domain is Universal ⋮ General recursive functions in a very simply interpretable typed \(\lambda\)-calculus ⋮ Concrete domains ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ Using information systems to solve recursive domain equations ⋮ Admissible representations of effective cpo's

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effectively given domains
• LCF considered as a programming language
• The Category-Theoretic Solution of Recursive Domain Equations
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Bases for Chain-complete Posets
• Data Types as Lattices
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• A Powerdomain Construction

This page was built for publication: \(\mathbb{T}^\omega\) as a universal domain