Relational Semantics of Local Variable Scoping

Most previous work on the equivalence of programs in the presence of local state has involved intricate memory modeling and the notion of contextual (observable) equivalence. We show how relational semantics can be used to avoid these complications. We define a notion of local variable scoping, along with a purely compositional semantics based on binary relations, such that all contextual considerations are completely encapsulated in the semantics. We then give an axiom system for pro- gram equivalence in the presence of local state that avoids all mention of memory or context and that does not use semantic arguments. The sys- tem is complete relative to the underlying flat equational theory. We also indicate briefly how the semantics can be extended to include higher-order functions.