Lics

ACM/IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Twelfth Annual IEEE Symposium on

Logic in Computer Science (LICS 1997)

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

Authors: Marcelo P. Fiore Gordon D. Plotkin A. 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 P. Fiore and Gordon D. Plotkin and A. John Power},
    title = 	 {Complete Cuboidal Sets in Axiomatic Domain Theory},
    booktitle =  {Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS 1997)},
    year =	 {1997},
    month =	 {June}, 
    pages =      {268--279},
    location =   {Warsaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2022-10-3113:49
Sam Staton