The following pages link to Data Types as Lattices (Q4103509):
Displayed 50 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Convex powerdomains. I (Q581432) (← links)
- Uniqueness of Scott's reflexive domain in \(P\omega \) (Q672137) (← links)
- Extremal solutions of inequations over lattices with applications to supervisory control (Q672379) (← links)
- Lambda abstraction algebras: representation theorems (Q674002) (← links)
- Two models of synthetic domain theory (Q678839) (← links)
- On stable domains (Q685428) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Functorial polymorphism (Q753948) (← links)
- On combinatory algebras and their expansions (Q760416) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Separately continuous algebras (Q790140) (← links)
- The insensitivity theorem for nonreducing reflexive types (Q792755) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- Using information systems to solve recursive domain equations (Q808273) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Codatatypes in ML (Q908682) (← links)
- Two-level semantics and abstract interpretation (Q911319) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- An algebraic approach to stable domains (Q917677) (← links)
- An irregular filter model (Q930872) (← links)
- Computability and the morphological complexity of some dynamics on continuous domains (Q930875) (← links)
- Sheaf toposes for realizability (Q938241) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- Kleene chain completeness and fixedpoint properties (Q1052104) (← links)
- Algebraic domain equations (Q1054464) (← links)
- Algebraic relations and presentations (Q1055794) (← links)
- Order completion monads (Q1055871) (← links)
- An effectively given initial semigroup (Q1061863) (← links)
- Rewrite systems on a lattice of types (Q1064065) (← links)
- Admissible representations of effective cpo's (Q1068562) (← links)
- A characterization of Plotkin's order in powerdomains, and some of its properties (Q1069707) (← links)
- Type 2 recursion theory (Q1073021) (← links)
- Theory of representations (Q1073022) (← links)
- On merging software extensions (Q1082067) (← links)
- Infinite-word languages and continuous mappings (Q1082087) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
- Universal profinite domains (Q1093371) (← links)
- Two-level semantics and code generation (Q1095636) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Polymorphic type inference and containment (Q1110312) (← links)
- A mathematical theory of randomized computation. I (Q1111027) (← links)
- A guided tour of the mathematics of MetaSoft '88 (Q1111360) (← links)
- A small complete category (Q1112159) (← 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)
- Borel ideals vs. Borel sets of countable relations and trees (Q1120573) (← links)
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1123253) (← links)
