The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
Functions with local state: regularity and undecidability
Theoretical Computer Science
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic (TOCL)
Third-order Idealized Algol with iteration is decidable
Theoretical Computer Science
Decidability and syntactic control of interference
Theoretical Computer Science
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Decidability in syntactic control of interference
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Idealized algol with ground recursion, and DPDA equivalence
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
| Hi-index | 0.00 |
Using game semantics we prove that program equivalenceis undecidable in finitary Idealized Algol with activeexpressions as well as in its call-by-value counterpart.It is also shown that strategies corresponding to IdealizedAlgol terms of respectively second, third and higherorders define exactly regular, context-free and recursivelyenumerable languages.