Effectively given domains
From MaRDI portal
Publication:1137572
DOI10.1016/0304-3975(77)90045-7zbMath0429.03028MaRDI 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 lattices; rational structure; effectively given domain; complete partial orders; recursive domain equations
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
A universality theorem for PCF with recursive types, parallel-or and ∃, Domains for Computation in Mathematics, Physics and Exact Real Arithmetic, Effectiveness and multivalued logics, From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice, Computability in higher types, P\(\omega\) and the completeness of type assignment, Computable one-to-one enumerations of effective domains, I-categories as a framework for solving domain equations, The largest Cartesian closed category of domains, Using information systems to solve recursive domain equations, 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, 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 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, ?-Complete a-spaces, Algebraic specification of data types: A synthetic approach
Cites Work
