Effectively given domains
From MaRDI portal
Cites work
- A Powerdomain Construction
- Bases for Chain-complete Posets
- Computability concepts for programming language semantics
- Data Types as Lattices
- scientific article; zbMATH DE number 3499219 (Why is no real title available?)
- scientific article; zbMATH DE number 3635472 (Why is no real title available?)
- scientific article; zbMATH DE number 3428899 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
Cited in
(60)- Algebraic domain equations
- An effectively given initial semigroup
- Admissible representations of effective cpo's
- Merging regular processes by means of fixed-point theory
- \(\mathbb{T}^\omega\) as a universal domain
- On the algebra of order
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
- Embedding metric spaces into CPO's
- Domain theory in logical form
- Some economic applications of Scott domains
- A domain-theoretic approach to computability on the real line
- Induction and recursion on the partial real line with applications to Real PCF
- Context-free event domains are recognizable
- Topology, domain theory and theoretical computer science
- On a generalized product for domains
- Information categories
- PCF extended with real numbers
- Constructive metrisability in point-free topology.
- Entailment systems for stably locally compact locales
- The Cuntz semigroup and domain theory
- Domain theoretic models of polymorphism
- A category of compositional domain-models for separable Stone spaces.
- Bounded complete models of topological spaces
- Information systems for continuous semi-lattices
- Representations of stably continuous semi-lattices by information systems and abstract bases
- Information systems for continuous posets
- Some categorical aspects of information systems and domains
- A stable programming language
- On the computational content of the Lawson topology
- The constructive maximal point space and partial metrizability
- Semi-decidability of may, must and probabilistic testing in a higher-type setting
- The constructive maximal point space
- Web spaces and worldwide web spaces: topological aspects of domain theory
- Abstract Interpretation from a Topological Perspective
- Selection functions, bar recursion and backward induction
- ?-Complete a-spaces
- Algebraic specification of data types: A synthetic approach
- A universality theorem for PCF with recursive types, parallel-or and ∃
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
- Representations of complete uniform spaces via uniform domains
- Continuous domain theory in logical form
- Predicative theories of continuous lattices
- Context-free event domains are recognizable
- Uniform envelopes
- Point-free construction of real exponentiation
- Effectiveness and multivalued logics
- Computability in higher types, P and the completeness of type assignment
- Computable one-to-one enumerations of effective domains
- From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice
- Recursive solution of initial value problems with temporal discretization
- Decomposition of domains
- A domain-theoretic framework for robustness analysis of neural networks
- Robustness, Scott continuity, and computability
- Apartness, sharp elements, and the Scott topology of domains
- Robustness in metric spaces over continuous quantales and the Hausdorff-Smyth monad
- I-categories as a framework for solving domain equations
- Continuous and algebraic domains in univalent foundations
- A Cartesian closed category for random variables
- The largest Cartesian closed category of domains
- Using information systems to solve recursive domain equations
This page was built for publication: Effectively given domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137572)
