T^ as a universal domain
From MaRDI portal
Publication:1132085
Cites work
- A Powerdomain Construction
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- Bases for Chain-complete Posets
- Data Types as Lattices
- Effectively given domains
- scientific article; zbMATH DE number 3532924 (Why is no real title available?)
- scientific article; zbMATH DE number 3560704 (Why is no real title available?)
- scientific article; zbMATH DE number 3635472 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- LCF considered as a programming language
- The Category-Theoretic Solution of Recursive Domain Equations
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
Cited in
(44)- Algebraic domain equations
- Admissible representations of effective cpo's
- Universal profinite domains
- On Church's formal theory of functions and functionals. The - 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 -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
- Cartesian closed categories of separable Scott domains
- The constructive maximal point space and partial metrizability
- \(\mathbb T^\omega\) as a stable universal domain.
- The constructive maximal point space
- Atomicity, coherence of information, and point-free structures
- A stable universal domain related to \(\mathbb{T}^{\omega}\)
- Existence of strongly proper dyadic subbases
- Universal domains and the amalgamation property
- Trees from functions as processes
- Properties of domain representations of spaces through dyadic subbases
- Nonflatness and totality
- What is a universal higher-order programming language?
- Representations of complete uniform spaces via uniform domains
- Normal forms, linearity, and prime algebraicity over nonflat domains
- Lazy lambda calculus: theories, models and local structure characterization (extended abstract)
- Almost every domain is universal
- On the ubiquity of certain total type structures
- Computability in higher types, P and the completeness of type assignment
- Domains via graphs
- Intrinsic approach spaces on domains
- On stable domains
- Realizability models refuting Ishihara's boundedness principle
- Stability and computability in coherent domains
- Completeness of type assignment in continuous lambda models
- Using information systems to solve recursive domain equations
- Configuration structures, event structures and Petri nets
- A category-theoretic characterization of functional completeness
This page was built for publication: \(\mathbb{T}^\omega\) as a universal domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132085)
