The following pages link to Effectively given domains (Q1137572):
Displayed 38 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Computable one-to-one enumerations of effective domains (Q582908) (← links)
- I-categories as a framework for solving domain equations (Q685401) (← links)
- The largest Cartesian closed category of domains (Q761042) (← links)
- Using information systems to solve recursive domain equations (Q808273) (← links)
- Algebraic domain equations (Q1054464) (← links)
- An effectively given initial semigroup (Q1061863) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- \(\mathbb{T}^\omega\) as a universal domain (Q1132085) (← links)
- On the algebra of order (Q1143782) (← links)
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable (Q1162807) (← links)
- Embedding metric spaces into CPO's (Q1164416) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Some economic applications of Scott domains (Q1196207) (← links)
- A domain-theoretic approach to computability on the real line (Q1274807) (← links)
- Induction and recursion on the partial real line with applications to Real PCF (Q1274810) (← links)
- Context-free event domains are recognizable (Q1286370) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- On a generalized product for domains (Q1311968) (← links)
- Information categories (Q1320330) (← links)
- PCF extended with real numbers (Q1349926) (← links)
- Constructive metrisability in point-free topology. (Q1427775) (← links)
- Entailment systems for stably locally compact locales (Q1434362) (← links)
- Domain theoretic models of polymorphism (Q1824612) (← links)
- A category of compositional domain-models for separable Stone spaces. (Q1853606) (← links)
- Bounded complete models of topological spaces (Q1877616) (← links)
- Information systems for continuous posets (Q2367538) (← links)
- Some categorical aspects of information systems and domains (Q2432574) (← links)
- A stable programming language (Q2492185) (← links)
- On the computational content of the Lawson topology (Q2500493) (← links)
- The constructive maximal point space and partial metrizability (Q2575776) (← links)
- ?-Complete a-spaces (Q3666279) (← links)
- Algebraic specification of data types: A synthetic approach (Q3907066) (← links)
- A universality theorem for PCF with recursive types, parallel-or and ∃ (Q4286532) (← links)
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic (Q4382500) (← links)
- Effectiveness and multivalued logics (Q5477627) (← links)
- From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice (Q5942696) (← links)