Deciding equivalence of finite tree automata
SIAM Journal on Computing
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM (JACM)
On full abstraction for PCF: I, II, and III
Information and Computation
Observational Equivalence of 3rd-Order Idealized Algol is Decidable
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On Program Equivalence in Languages with Ground-Type References
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Games for complexity of second-order call-by-name programs
Theoretical Computer Science - Game theory meets theoretical computer science
Idealized algol with ground recursion, and DPDA equivalence
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
| Hi-index | 5.23 |
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 @b-normal terms. Exptime-hardness of the problems, even for terms without iteration, is also shown.