Functions with local state: regularity and undecidability
Theoretical Computer Science
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
Sequentiality and the CPS Semantics of Fresh Names
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Interpreting Localized Computational Effects Using Operators of Higher Type
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
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
Game Semantics for Access Control
Electronic Notes in Theoretical Computer Science (ENTCS)
Fresh O'Caml: Nominal Abstract Syntax for the Masses
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Freshness and name-restriction in sets of traces with names
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Stone duality for nominal Boolean algebras with И
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
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
Electronic Notes in Theoretical Computer Science (ENTCS)
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Full abstraction for nominal Scott domains
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Hi-index | 0.00 |
We introduce nominal games for modelling programming languages with dynamically generated local names, as exemplified by Pitts and Stark's nu-calculus.Inspired by Pitts and Gabbay's recent work on nominal sets, we construct arenas and strategies in the world (or topos) of Fraenkel-Mostowski sets (or simply FM-sets).We fix an infinite set N of names to be the "atoms" of the FM-theory, and interpret the type v of names as the flat arena whose move-set is N.This approach leads to a clean and precise treatment of fresh names and standard game constructions (such as plays, views, innocent strategies, etc.) that are considered invariant under renaming.The main result is the construction of the first fully-abstract model for the nu-calculus.