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

DOI10.1016/0022-0000(78)90006-5zbMath0419.03007MaRDI 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

domains; programming languages; computable functions; continuous functions; complete partial orders; universal domain; topological aspects; infinite sequences of truth-values; lambda beta calculus; mathematical semantics; the class of ordered pairs of disjoint sets of integers

Mathematics Subject Classification ID

03C99: Model theory

68Q55: Semantics in the theory of computing

03D99: Computability and recursion theory

03B40: Combinatory logic and lambda calculus

Related Items

Universal domains and the amalgamation property, On the ubiquity of certain total type structures, Domains via graphs, Computability in higher types, P\(\omega\) and the completeness of type assignment, On stable domains, Stability and computability in coherent domains, Completeness of type assignment in continuous lambda models, Using information systems to solve recursive domain equations, A category-theoretic characterization of functional completeness, Algebraic domain equations, Admissible representations of effective cpo's, Universal profinite domains, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Varieties of chain-complete algebras, Free upper regular bands, Universal homogeneous event structures and domains, Finite type structures within combinatory algebras, Coherence and consistency in domains, Induction and recursion on the partial real line with applications to Real PCF, Properly injective spaces and function spaces, General recursive functions in a very simply interpretable typed \(\lambda\)-calculus, Concrete domains, Set-theoretical and other elementary models of the \(\lambda\)-calculus, Limiting semantics of numerical programs, Continuously generated fixed points, On the semantics of polymorphism, The constructive maximal point space and partial metrizability

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