• DocumentCode
    2715384
  • Title

    The classification of continuous domains

  • Author

    Jung, Achim

  • Author_Institution
    Imperial Coll. of Sci. & Technol., London, UK
  • fYear
    1990
  • fDate
    4-7 Jun 1990
  • Firstpage
    35
  • Lastpage
    40
  • Abstract
    The long-standing problem of finding the maximal Cartesian closed categories of continuous domains is solved. The solution requires the definition of a new class of continuous domains, called FS-domains, which contains all retracts of SFP-objects. The properties of FS-domains are discussed
  • Keywords
    formal logic; programming theory; FS-domains; SFP-objects; classification; continuous domains; formal logic; maximal Cartesian closed categories; programming theory; Algebra; Algorithm design and analysis; Bibliographies; Computer languages; Computer science; Concrete; Educational institutions; Lattices; Topology; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e
  • Conference_Location
    Philadelphia, PA
  • Print_ISBN
    0-8186-2073-0
  • Type

    conf

  • DOI
    10.1109/LICS.1990.113731
  • Filename
    113731