Some reasons for generalising domain theory

DOI10.1017/S0960129509990375zbMath1197.06004MaRDI QIDQ3559971

J. M. E. Hyland

Publication date: 17 May 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

Cartesian-closed categories of domainscategorical generalization of domains

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Related Items (11)

Strategies as concurrent processes ⋮ Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures ⋮ Deterministic concurrent strategies ⋮ Distributive laws for relative monads ⋮ On operads, bimodules and analytic functors ⋮ Towards a homotopy domain theory ⋮ Elements of a theory of algebraic theories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ Distributed Strategies Made Easy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• An algebraic approach to stable domains
• Realizability. An introduction to its categorical side
• A universal property of the convolution monoidal structure
• Coherence for compact closed categories
• Algebras and combinators
• Une théorie combinatoire des séries formelles
• Glueing and orthogonality for models of linear logic
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Domain theoretic models of polymorphism
• Pseudo-commutative monads and pseudo-closed 2-categories
• Finite products are biproducts in a compact closed category
• Monads on symmetric monoidal closed categories
• Strong functors and monoidal monads
• A filter lambda model and the completeness of type assignment
• The Dedekind reals in abstract Stone duality
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• A Powerdomain Construction
• General synthetic domain theory – a logical approach
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
• On the ubiquity of certain total type structures
• The cartesian closed bicategory of generalised species of structures
• Profunctors, open maps and bisimulation
• Category Theory
• Automata in general algebras
• Closed categories generated by commutative monads
• Bilinearity and Cartesian Closed Monads.
• Proof theory in the abstract
• Two applications of analytic functors

This page was built for publication: Some reasons for generalising domain theory