The impact of higher-order state and control effects on local relational reasoning

Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relations, for reasoning about equivalence in the setting of increasingly realistic languages--languages nearly as complex as ML or Haskell. Much of the recent work in this direction has considered the interesting representation independence principles enabled by the use of local state, but it is also important to understand the principles that powerful features like higher-order state and control effects disable. This latter topic has been broached extensively within the framework of game semantics, resulting in what Abramsky dubbed the c cube": fully abstract game-semantic characterizations of various axes in the design space of ML-like languages. But when it comes to reasoning about many actual examples, game semantics does not yet supply a useful technique for proving equivalences. In this paper, we marry th...

• Type: Conference
• Year: 2010
• Where: ICFP
• Authors: Derek Dreyer, Georg Neis, Lars Birkedal
• Keywords: ICFP 2010, Logical Relation, Programming Languages, Reasoning, Useful Technique