Title :
The classification of continuous domains
Author_Institution :
Imperial Coll. of Sci. & Technol., London, UK
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;
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
DOI :
10.1109/LICS.1990.113731
