Linear types and approximation (Q2709786)

The authors introduce FS-lattices and establish their connections to domain theory, topology and linear logic. In particular, while the category Cont of continuous lattices together with maps preserving all joins is not \(\ast\)-autonomous, its full subcategory consisting of FS-lattices is. In addition, it is maximal with this property (under one extra condition). Distributive FS-lattices are precisely completely distributive lattices and algebraic FS-lattices also form a \(\ast\)-autonomous category.