Introduction to higher order categorical logic
Introduction to higher order categorical logic
Theoretical Computer Science
Domain theoretic models of polymorphism
Information and Computation
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Bistructures, bidomains, and linear logic
Proof, language, and interaction
Theoretical Computer Science - Modern algebra and its applications
Two applications of analytic functors
Theoretical Computer Science - Special issue on theories of types and proofs
Stable Bistructure Models of PCF
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
On Semantic Foundations for Applicative Multiprogramming
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Bistructures, Bidomains and Linear Logic
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Glueing and orthogonality for models of linear logic
Theoretical Computer Science - Category theory and computer science
Complete Cuboidal Sets in Axiomatic Domain Theory
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
General synthetic domain theory – a logical approach
Mathematical Structures in Computer Science
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
On the ubiquity of certain total type structures
Mathematical Structures in Computer Science
Categories for fixpoint-semantics
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
The dedekind reals in abstract stone duality
Mathematical Structures in Computer Science
Realizability, Volume 152: An Introduction to its Categorical Side
Realizability, Volume 152: An Introduction to its Categorical Side
Bicategories of concurrent games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
One natural way to generalise domain theory is to replace partially ordered sets by categories. This kind of generalisation has recently found application in the study of concurrency. An outline is given of the elegant mathematical foundations that have been developed. This is specialised to give a construction of cartesian closed categories of domains, which throws light on standard presentations of domain theory.