Linear types and approximation
From MaRDI portal
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.
Recommendations
Cited in
(10)- Characterizing consistent Smyth powerdomains by \textit{FS-}\(\land^{\uparrow}\)-domains
- A type-assignment of linear erasure and duplication
- Consistent-linear \textit{FS}-domains
- Integrating linear and dependent types
- The Scott model of linear logic is the extensional collapse of its relational model
- scientific article; zbMATH DE number 1154167 (Why is no real title available?)
- Linear domains and linear maps
- Two-dimensional Kripke semantics. II: Stability and completeness
- A profunctorial Scott semantics
- Infinitary refinement types for temporal properties in Scott domains
This page was built for publication: Linear types and approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2709786)