Third-order Idealized Algol with iteration is decidable

The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration ( IA 3 ∗ ). They are approached via a combination of game semantics and language theory. It is shown that for each IA 3 ∗ -term one can construct a pushdown automaton recognizing a representation of the strategy induced by the term. The automata have some additional properties ensuring that the associated equivalence and inclusion problems are solvable in Ptime. This gives an Exptime decision procedure for the problems of contextual equivalence and approximation for β -normal terms. Exptime-hardness of the problems, even for terms without iteration, is also shown.

Authors

• Andrzej S. Murawski
• Igor Walukiewicz

Keywords

• Game semantics
• Computational complexity
• Program analysis