Theoretical Computer Science
Operational reasoning for functions with local state
Higher order operational techniques in semantics
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Functions with local state: regularity and undecidability
Theoretical Computer Science
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
State-dependent representation independence
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Idealized algol with ground recursion, and DPDA equivalence
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
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
Computation-by-Interaction with effects
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Algorithmic games for full ground references
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Game semantics for interface middleweight Java
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We employ automata over infinite alphabets to capture the semantics of a finitary fragment of ML with ground-type references. Our approach is founded on game semantics, which allows us to translate programs into automata in such a way that contextual equivalence is characterized by a finitary notion of bisimilarity. As a corollary, we derive a decidability result for a class of first-order programs, including open ones that contain unspecified first-order procedures.