Hostname: page-component-745bb68f8f-l4dxg Total loading time: 0 Render date: 2025-01-23T23:02:55.195Z Has data issue: false hasContentIssue false
  • English
  • Français

Linear types and approximation

Published online by Cambridge University Press:  04 April 2001

MICHAEL HUTH ,
ACHIM JUNG  and
KLAUS KEIMEL
MICHAEL HUTH
Affiliation:
Department of Computing and Information Sciences, Kansas State University, Manhattan, KS 66506, USA
ACHIM JUNG
Affiliation:
School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, England
KLAUS KEIMEL
Affiliation:
Fachbereich Mathematik, Technische Universität Darmstadt, Schloßgartenstraße 7, 64289 Darmstadt, Germany
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 10 , Issue 6 , December 2000 , pp. 719 - 745
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)