Effectively given domains
From MaRDI portal
Publication:1137572
DOI10.1016/0304-3975(77)90045-7zbMath0429.03028OpenAlexW2073030937MaRDI QIDQ1137572
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(77)90045-7
continuous latticesrational structureeffectively given domaincomplete partial ordersrecursive domain equations
Related Items
Information systems for continuous semi-lattices, Bounded complete models of topological spaces, Merging regular processes by means of fixed-point theory, Information systems for continuous posets, PCF extended with real numbers, A universality theorem for PCF with recursive types, parallel-or and ∃, \(\mathbb{T}^\omega\) as a universal domain, Recursive solution of initial value problems with temporal discretization, On the algebra of order, 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, The Cuntz semigroup and domain theory, Some categorical aspects of information systems and domains, Unnamed Item, Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable, Embedding metric spaces into CPO's, Constructive metrisability in point-free topology., Domain theory in logical form, Representations of stably continuous semi-lattices by information systems and abstract bases, Entailment systems for stably locally compact locales, Web spaces and worldwide web spaces: topological aspects of domain theory, Selection functions, bar recursion and backward induction, Some economic applications of Scott domains, I-categories as a framework for solving domain equations, Domains for Computation in Mathematics, Physics and Exact Real Arithmetic, Representations of Complete Uniform Spaces via Uniform Domains, Unnamed Item, Continuous Domain Theory in Logical Form, A stable programming language, From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice, On the computational content of the Lawson topology, Computability in higher types, P\(\omega\) and the completeness of type assignment, Computable one-to-one enumerations of effective domains, Unnamed Item, Unnamed Item, Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, Abstract Interpretation from a Topological Perspective, Algebraic specification of data types: A synthetic approach, A domain-theoretic approach to computability on the real line, Induction and recursion on the partial real line with applications to Real PCF, The largest Cartesian closed category of domains, Context-free event domains are recognizable, Domain theoretic models of polymorphism, Context-free event domains are recognizable, Topology, domain theory and theoretical computer science, ?-Complete a-spaces, Algebraic domain equations, The constructive maximal point space and partial metrizability, A category of compositional domain-models for separable Stone spaces., An effectively given initial semigroup, On a generalized product for domains, Using information systems to solve recursive domain equations, Admissible representations of effective cpo's, Information categories, Effectiveness and multivalued logics
Cites Work
