Logic in Computer Science (LICS 1997)

Paper: Complete Cuboidal Sets in Axiomatic Domain Theory (at LICS 1997)

Authors: Marcelo Fiore Gordon Plotkin John Power

Abstract

We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, viz. that of complete cuboidal set, that complies with the axiomatic requirements. We show that the category of complete cuboidal sets provides a general notion of enrichment for a wide class of axiomatic domain-theoretic structures.

BibTeX

  @InProceedings{FiorePlotkinPower-CompleteCuboidalSet,
    author = 	 {Marcelo Fiore and Gordon Plotkin and John Power},
    title = 	 {Complete Cuboidal Sets in Axiomatic Domain Theory},
    booktitle =  {Proceedings of the Twelfth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1997},
    year =	 1997,
    editor =	 {Glynn Winskel},
    month =	 {June}, 
    pages =      {268--278},
    location =   {Warsaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}
  }