The following pages link to (Q5649639):
Displayed 50 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Convex powerdomains. I (Q581432) (← links)
- Specification of topological spaces by algebraic systems of continuous functions (Q684548) (← links)
- I-categories as a framework for solving domain equations (Q685401) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- A general theory of fuzzy arithmetic (Q751657) (← links)
- Solving reflexive domain equations in a category of complete metric spaces (Q753944) (← links)
- Functorial polymorphism (Q753948) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- The largest Cartesian closed category of domains (Q761042) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- A uniform approach to inductive posets and inductive closure (Q809105) (← links)
- Insertion of lattice-valued and hedgehog-valued functions (Q820101) (← links)
- Inconsistency and semantic unification (Q853424) (← links)
- Two categories of effective continuous cpos (Q854182) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Non-deterministic information systems and their domains (Q914401) (← links)
- Fuzzy topology with respect to continuous lattices (Q919643) (← links)
- An irregular filter model (Q930872) (← links)
- Computability and the morphological complexity of some dynamics on continuous domains (Q930875) (← links)
- Monotone insertion of lattice-valued functions (Q955179) (← links)
- Formal topological characterizations of various continuous domains (Q1004687) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- Algebraic domain equations (Q1054464) (← links)
- \(T_ 0\)-spaces and pointwise convergence (Q1064563) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)
- A characterization of Plotkin's order in powerdomains, and some of its properties (Q1069707) (← links)
- On a 'good' dense class of topological spaces (Q1085264) (← links)
- Some modifications of Scott's theorem on injective spaces (Q1088182) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Retracts of the closure space of filters in the lattice of all subsets (Q1090957) (← links)
- Universal profinite domains (Q1093371) (← links)
- Implication and analysis in classical Frege structures (Q1095139) (← links)
- Recursively defined domains and their induction principles (Q1098615) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Recursion theorems and effective domains (Q1102949) (← links)
- \(\kappa\)-continuous lattices and comprehension principles for Frege structures (Q1104320) (← links)
- A mathematical theory of randomized computation. I (Q1111027) (← links)
- A guided tour of the mathematics of MetaSoft '88 (Q1111360) (← links)
- Generalization of Scott's formula for retractions from generalized Alexandroff's cube (Q1112360) (← links)
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1114959) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- A type-free system extending (ZFC) (Q1121865) (← links)
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1123253) (← links)
- Enlargements of functional algebras for the lambda calculus (Q1129261) (← links)
- \(\mathbb{T}^\omega\) as a universal domain (Q1132085) (← links)
- Least fixed point of a functor (Q1134211) (← links)
- Continuous posets and adjoint sequences (Q1136787) (← links)