The system F of variable types, fifteen years later
Theoretical Computer Science
Theoretical Computer Science
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
A fully abstract denotational model for higher-order processes
Information and Computation
DI-Domains as a Model of Polymorphism
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Some Properties of D-Continuous Causal Nets
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Petri Nets, Event Structures and Domains
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Theoretical Computer Science - Logic, semantics and theory of programming
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
Learning in a changing world, an algebraic modal logical approach
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Borel determinacy of concurrent games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 5.23 |
A prime algebraic lattice can be characterised as isomorphic to the downwards-closed subsets, ordered by inclusion, of its complete primes. It is easily seen that the downwards-closed subsets of a partial order form a completely distributive algebraic lattice when ordered by inclusion. The converse also holds; any completely distributive algebraic lattice is isomorphic to such a set of downwards-closed subsets of a partial order. The partial order can be recovered from the lattice as the order of the lattice restricted to its complete primes. Consequently prime algebraic lattices are precisely the completely distributive algebraic lattices. The result extends to Scott domains. Several consequences are explored briefly: the representation of Berry's dI-domains by event structures; a simplified form of information systems for completely distributive Scott domains; and a simple domain theory for concurrency.