Show simple item record

dc.contributor.authorFiore, Marcelo P
dc.contributor.authorPlotkin, Gordon
dc.coverage.spatial11en
dc.date.accessioned2003-11-05T16:22:20Z
dc.date.available2003-11-05T16:22:20Z
dc.date.issued1994
dc.identifier.urihttp://hdl.handle.net/1842/209
dc.description.abstractCategorical 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 non-trivial and 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.en
dc.format.extent266894 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleAn Axiomatisation of Computationally Adequate Domain Theoretic Models of FPCen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record