An axiomatisation of computationally adequate domain theoretic models of fpc (1994)
Cached
Download Links
by
Marcelo P. Fiore
,
Gordon D. Plotkin
| Venue: | In 9 th LICS Conf |
| Citations: | 34 - 6 self |
BibTeX
@INPROCEEDINGS{Fiore94anaxiomatisation,
author = {Marcelo P. Fiore and Gordon D. Plotkin},
title = {An axiomatisation of computationally adequate domain theoretic models of fpc},
booktitle = {In 9 th LICS Conf},
year = {1994},
pages = {92--102},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 non-trivial and absolute ones — are proved to be both computationally sound and adequate.
Citations
| 316 | Basic concepts of enriched category theory - Kelly - 1982 |
| 257 | Semantics of programming languages: structures and techniques. Foundations of Computing - Gunter - 1992 |
| 89 | Algebraically complete categories - Freyd - 1991 |
| 65 | Recursive types reduced to inductive types - Freyd - 1990 |
| 62 | Axiomatic Domain Theory in Categories of Partial Maps - Fiore - 1996 |
| 60 | Remarks on algebraically compact categories - Freyd - 1991 |
| 52 | Full abstraction for sequential languages: The state of the art - Berry, Curien, et al. |
| 23 | The lazy -calculus - Abramsky - 1990 |
| 18 | Algebraically compact functors - Barr - 1992 |
| 11 | The lazy λ-calculus - Abramsky - 1990 |
| 8 | Cartesian closed categories of enumerations for effective typestructures - Longo, Moggi |
| 5 | Data types in algebraically !- complete categories - Ad'amek - 1993 |
| 2 | Cpo-categories of partial maps - Fiore - 1993 |
| 1 | Data types in algebraically ωcomplete categories - Adámek - 1993 |
