257 results about "Logical relations" patented technology

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 [ [-] ]ᵢ, i=1,2. For each type A, we associate a particular relation a∼b between [ [A] ]₁ and [ [A] ]₂. We define this relation such that for all program phrase M, the two denotations are related: [ [M] ]₁∼[ [M] ]₂.