A simple adequate categorical model for PCF

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Usually types of PCF are interpreted as cpos and terms as continuous functions. It is then the case that non-termination of a closed term of ground type corresponds to the interpretation being bottom; we say that the semantics is adequate. We shall here present an axiomatic approach to adequacy for PCF in the sense that we will introduce categorical axioms enabling an adequate semantics to be given. We assume the presence of certain “bottom” maps with the role of being the interpretation of non-terminating terms, but the order-structure is left out. This is different from previous approaches where some kind of order-theoretic structure has been considered as part of an adequate categorical model for PCF. We take the point of view that partiality is the fundamental notion from which order-structure should be derived, which is corroborated by the observation that our categorical model induces an order-theoretic model for PCF in a canonical way.

Cite

CITATION STYLE

APA

Braüner, T. (1997). A simple adequate categorical model for PCF. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1210, pp. 82–98). Springer Verlag. https://doi.org/10.1007/3-540-62688-3_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free