Logic in Computer Science (LICS 1994)

Paper: Linear types, approximation, and topology (at LICS 1994)

Authors: Michael Huth Achim Jung Klaus Keimel

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'

BibTeX

  @InProceedings{HuthJungKeimel-Lineartypesapproxim,
    author = 	 {Michael Huth and Achim Jung and Klaus Keimel},
    title = 	 {Linear types, approximation, and topology},
    booktitle =  {Proceedings of the Ninth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1994},
    year =	 1994,
    editor =	 {Samson Abramsky},
    month =	 {July}, 
    pages =      {110--114},
    location =   {Paris, France}, 
    publisher =	 {IEEE Computer Society Press}
  }