Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
An equational notion of lifting monad
Theoretical Computer Science - Category theory and computer science
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Presheaf models for CCS-like languages
Theoretical Computer Science
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
A uniform approach to domain theory in realizability models
Mathematical Structures in Computer Science
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Some reasons for generalising domain theory
Mathematical Structures in Computer Science
Discrete generalised polynomial functors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, viz. that of complete cuboidal set, that complies with the axiomatic requirements. We show that the category of complete cuboidal sets provides a general notion of enrichment for a wide class of axiomatic domain-theoretic structures.