A Graph-Based Approach to Proving Observational Equivalence in Functional Programming Languages with Effects

This paper introduces a novel graph-based approach, utilizing focused hypernet rewriting and the concept of robustness, to prove observational equivalence in functional programming languages, particularly those with effects like state.