Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Games and Full Abstraction for the Lazy Lambda-Calculus
LICS '95 Proceedings of the 10th 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
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Nominal Games and Full Abstraction for the Nu-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic (TOCL)
Computation: finite and infinite machines
Computation: finite and infinite machines
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Syntactic control of concurrency
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Games for complexity of second-order call-by-name programs
Theoretical Computer Science - Game theory meets theoretical computer science
Full Abstraction for Reduced ML
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Algorithmic nominal game semantics
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
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
Algorithmic games for full ground references
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Algorithmic probabilistic game semantics
Formal Methods in System Design
| Hi-index | 5.23 |
We study programs of a finitary ML-like language RMLf with ground-type references. RMLf permits the use of functions with locally declared variables that remain private and persist from one use of the function to the next. Using game semantics we show that this leads to undecidability of program equivalence already at second order. We also examine the extent to which this feature can be captured by regular languages. This gives a decidability result for a second-order fragment RMLf- of RMLf, which comprises many examples studied in the literature.