On full abstraction for PCF: I, II, and III
Information and Computation
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Interactive observability in Ludics: the geometry of tests
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Towards Ludics Programming: Interactive Proof Search
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A game semantics of linearly used continuations
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
Theoretical Computer Science
Ludics, dialogue and interaction
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
An approach to innocent strategies as graphs
Information and Computation
| Hi-index | 0.00 |
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" appraoch to Games Semantics, and thus establish a clear connection between the two subjects.