Logical relations

Logical relations are a proof method employed in programming language semantics to show that two denotational semantics are equivalent. To describe… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2017
0204019762017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Fine-grained concurrent data structures (or FCDs) reduce the granularity of critical sections in both time and space, thus making… (More)
  • figure 3
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
2009
2009
We show how to reason about "step-indexed" logical relations in an abstract way, avoiding the tedious, error-prone, and proof… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Tait's method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational… (More)
Is this relevant?
2008
2008
Using contextual equivalence (a.k.a. observational equivalence) to specify security properties is an important idea in the field… (More)
  • figure 1
  • figure 3
Is this relevant?
2007
2007
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by… (More)
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present a proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a… (More)
  • figure 2
  • figure 7
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The theory of relational parametricity and its logical relations proof technique are powerful tools for reasoning about… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2000
2000
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not… (More)
Is this relevant?
1999
1999
We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make… (More)
Is this relevant?
1995
1995
Sieber has described a model of PCF consisting of continuous functions that are invariant under certain ((nitary) logical… (More)
Is this relevant?