Paper: An axiomatisation of computationally adequate domain theoretic models of FPC (at LICS 1994)

Authors: Marcelo P. Fiore Gordon D. Plotkin

Abstract

Categorical models of the metalanguage FPC (a type theory with sums, products, exponentials and recursive types) are defined. Then, domain-theoretic models of FPC are axiomatised and a wide subclass of them-the absolute ones-are proved to be both computationally sound and adequate. Examples include: the category of cpos and partial continuous functions and functor categories over it

BibTeX

  @InProceedings{FiorePlotkin-Anaxiomatisationofc,
    author = 	 {Marcelo P. Fiore and Gordon D. Plotkin},
    title = 	 {An axiomatisation of computationally adequate domain theoretic models of FPC },
    booktitle =  {Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science (LICS 1994)},
    year =	 {1994},
    month =	 {July}, 
    pages =      {92--102},
    location =   {Paris, France}, 
    publisher =	 {IEEE Computer Society Press}
  }