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
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A general mathematics of names
Information and Computation
Categorical Combinatorics for Innocent Strategies
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Nominal Techniques in Isabelle/HOL
Journal of Automated Reasoning
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Games: Unifying Logic, Language, and Philosophy
Games: Unifying Logic, Language, and Philosophy
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Manipulating trees with hidden labels
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
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
Constructing differential categories and deconstructing categories of games
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Compositional model extraction for higher-order concurrent programs
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Abstract Machines for Game Semantics, Revisited
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We present a model of games based on nominal sequences, which generalise sequences with atoms and a new notion of coabstraction. This gives a new, precise, and compositional mathematical treatment of justification pointers in game semantics.