Lax logical relations

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

Abstract

Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relations, they are preserved by the meanings of all lambda-calculus terms. We show that lax logical relations coincide with the correspondences of Schoett, the algebraic relations of Mitchell and the pre-logical relations of Honsell and Sannella on Henkin models, but also generalise naturally to models in cartesian closed categories and to richer languages.

Cite

CITATION STYLE

APA

Plotkin, G., Power, J., Sannella, D., & Tennent, R. (2000). Lax logical relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 85–102). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_9

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