Full abstraction for idealized Algol with passive expressions
Theoretical Computer Science - Special issue on linear logic, 1
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Theoretical Computer Science
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Game Theoretic Analysis of Call-by-Value Computation
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Observational Equivalence of 3rd-Order Idealized Algol is Decidable
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th 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
Computation: finite and infinite machines
Computation: finite and infinite machines
Functions with local state: regularity and undecidability
Theoretical Computer Science
A fragment of ML decidable by visibly pushdown automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Block structure vs. scope extrusion: between innocence and omniscience
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We show how game semantics can be employed to prove that program equivalence in finitary Idealized Algol with active expressions is undecidable. We also investigate a notion of representability of languages by terms and show that finitary Idealized Algol terms of respectively second, third and higher orders define exactly regular, context-free and recursively enumerable languages.