Lax Logical Relations

Gordon Plotkin, John Power, Donald Sannella, Robert Tennent

Research output: Chapter or section in a book/report/conference proceedingChapter or section

18 Citations (SciVal)


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.
Original languageEnglish
Title of host publicationAutomata, Languages and Programming: 27th International Colloquium, ICALP 2000 Geneva, Switzerland, July 9–15, 2000 Proceedings
Number of pages18
Publication statusPublished - 2002

Publication series

NameLecture Notes in Computer Science


Dive into the research topics of 'Lax Logical Relations'. Together they form a unique fingerprint.

Cite this