Logic in Computer Science (LICS 1988)

Paper: Categories of embeddings (at LICS 1988)

Authors: Thierry Coquand

Abstract

A categorical generalization of the notion of domains, which is stable by (suitable) exponentiation is presented. The goal was originally to generalize J.Y. Girard's (1986) model of polymorphism to Fω. If this notion is specialized to the poset case, a novel Cartesian closed category of domains is obtained

BibTeX

  @InProceedings{Coquand-Categoriesofembeddi,
    author = 	 {Thierry Coquand},
    title = 	 {Categories of embeddings},
    booktitle =  {Proceedings of the Third Annual IEEE Symp. on Logic in Computer Science, {LICS} 1988},
    year =	 1988,
    editor =	 {Yuri Gurevich},
    month =	 {July}, 
    pages =      {256--263},
    location =   {Edinburgh, Scotland, UK}, 
    publisher =	 {IEEE Computer Society Press}
  }