Notions of computation and monads
Information and Computation
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Games and full abstraction for FPC
Information and Computation - Special issue: LICS 1996—Part 1
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
The Definition of Standard ML
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
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
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Nominal Games and Full Abstraction for the Nu-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Functions with local state: regularity and undecidability
Theoretical Computer Science
Full abstraction for nominal general references
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
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
| Hi-index | 0.00 |
We present the first effectively presentable fully abstract model for Stark's Reduced ML, the paradigmatic higher-order programming language combining call-by-value evaluation and integer-valued references. The model is constructed using techniques of nominal game semantics. Its distinctive feature is the presence of carefully restricted information about the store in plays, combined with conditions concerning the participants' ability to distinguish reference names. This leads to an explicit characterization of program equivalence.