Theoretical Computer Science
A maximal monoidal closed category of distributive algebraic domains
Information and Computation
Handbook of logic in computer science (vol. 3)
Linear Domains and Linear Maps
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
A Duality Theory for Quantitative Semantics
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
On an open problem of Amadio and Curien: the finite antichain condition
Information and Computation
On an open problem of Amadio and Curien: The finite antichain condition
Information and Computation
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
| Hi-index | 0.00 |
We study continuous lattices with maps that preserve all suprema rather than only directed ones. We introduce the (full) subcategory of FS-lattices, which turns out to be *-autonomous, and in fact maximal with this property. FS-lattices are studied in the presence of distributivity and algebraicity. The theory is extremely rich with numerous connections to classical Domain Theory, complete distributivity, Topology and models of Linear Logic.