A semantics of evidence for classical arithmetic
Journal of Symbolic Logic
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
Designs, Disputes and Strategies
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)
A Graph Abstract Machine Describing Event Structure Composition
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Ludics Programming: Interactive Proof Search
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On the Meaning of Logical Completeness
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Logic and grammar
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.01 |
Proofs in Ludics are represented by designs. Designs (desseins) can be seen as an intermediate syntax between sequent calculus and proof nets, carrying advantages from both approaches, especially w.r.t. cut-elimination. To study interaction between designs and develop a geometrical intuition, we introduce an abstract machine which presents normalization as a token travelling along a net of designs. This allows a concrete approach, from which to carry on the study of issues such as: (i) which part of a design can be recognized interactively; (ii) how to reconstruct a design from the traces of its interactions in different tests.