Lesson plan
Logical relations
Logical relations are a proof method employed in programming language semantics to show that two denotational semantics are equivalent. To describe the process, let us denote the two semantics by [\![\cdot]\!]_i , where i\in\{1,2\} . For each type A , there is a particular associated relation \sim between [\![A]\!]_1 and [\![A]\!]_2 . This relation is defined such that for each program phrase M , the two denotations are related: [\![M]\!]_1 \sim [\![M]\!]_2 . Another property of this relation is that related denotations for ground types are equivalent in some sense, usually equal. The conclusion is then that both denotations exhibit equivalent behavior on ground terms, hence are equivalent.
Article summary
Logical relations are a proof method employed in programming language semantics to show that two denotational semantics are equivalent. To describe the process, let us denote the two semantics by [\![\cdot]\!]_i , where i\in\{1,2\} . For each type A , there is a particular associated relation \sim between [\![A]\!]_1 and [\![A]\!]_2 . This relation is defined such that for each program phrase M , the two denotations are related: [\![M]\!]_1 \sim [\![M]\!]_2 . Another property of this relation is that related denotations for ground types are equivalent in some sense, usually equal. The conclusion is then that both denotations exhibit equivalent behavior on ground terms, hence are equivalent.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.