Linear types, approximation, and topology

Author

Huth, Michael ; Jung, Achim ; Keimel, Klaus

Author_Institution

Fachbereich Math., Tech. Hochschule Darmstadt, Germany

fYear

1994

fDate

4-7 Jul 1994

Firstpage

110

Lastpage

114

Abstract

We enrich the *-autonomous category of complete lattices and maps preserving all suprema with the important concept of approximation by specifying a *-autonomous full subcategory LFS of linear FS-lattices. This is the greatest *-autonomous full subcategory of linked bicontinuous lattices. The modalities !() and ?() mediate a duality between the upper and lower powerdomains. The distributive objects in LFS give rise to the compact closed *-autonomous full subcategory CD of completely distributive lattices. We characterise algebraic objects in LFS by forbidden substructures `a la Plotkin´

Keywords

approximation theory; formal logic; topology; *-autonomous full subcategory LFS; Plotkin; algebraic objects; approximation; compact closed *-autonomous full subcategory CD; complete lattices; completely distributive lattices; distributive objects; duality; forbidden substructures; interaction orders; linear FS-lattices; linear logic; linear types; linked bicontinuous lattices; modalities; powerdomains; topology; Bridges; Lattices; Linear approximation; Logic; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on

Conference_Location

Paris

Print_ISBN

0-8186-6310-3

Type

conf

DOI

10.1109/LICS.1994.316081

Filename

316081