- Ludics, Ludics Nets, Game Semantics
- Ludics and linear pi-calculus, event structures
- Proof Nets and sequentialization
- Proof Search
- Basic Logic and Quantum Logic
- Thesis

"Partial orders, event structures, and linear
strategies," Proceedings of Typed Lambda Calculi and Applications, TLCA09,
volume 5608 of LNCS. Springer, 2009.

With M. Piccolo.

"A Graph Abstract Machine Describing Event Structure
Composition," Electronic Notes in Theoretical Computer Science, vol. 175,
n.4, 21-36, 2007.

With M. Piccolo.

"Ludics is a model for the finitary linear
pi-calculus," Proceedings of Typed Lambda Calculi and Applications, TLCA07,
volume 4583 of LNCS. Springer, 2007.

With M. Piccolo.

"Ludics with repetitions (exponentials, interactive
types and completeness)," 24th IEEE Symposium on Logic in Computer Science
(LICS 2009), 2009.

With M. Basaldella.

"Ludics with repetitions (exponentials, interactive
types and completeness)," (46 pages) submitted to journal.

With M. Basaldella.

``Jump from Parallel to Sequential Proofs:
Multiplicatives'', Computer Science Logic 06, LNCS, Spinger, 2006.

With Paolo Di Giamberardino.

``Ludics Nets, a game model of concurrent
interaction'' , *LICS 05*, IEEE Computer Society, 2005.

With Francois Maurel.

``L-nets, strategies and proof-nets'', Computer
Science Logic CSL05, LNCS, Spinger, 2005.

With Pierre-Louis Curien.

``An approach to innocent strategies as graphs'', (45
pages), to appear in Information and Computation.

With Pierre-Louis Curien.

``Ludics and interactive observability: the geometry
of tests'', *Theoretical Computer Science*, vol.350, n.2, 213-233,
2006.

__``Ludics and interactive observability''__, *ICALP 2004, 31st
International Colloquium on Automata, Languages and Programming, LNCS*
Springer, 3142, 2004.

__``Ludics on graphs. Towards concurrency''__, preprint, short
presentation at LICS 2004.

With Francois Maurel.

``Travelling on designs: Ludics dynamics'', *CSL 02.
Lecture Notes in Computer Science*, Springer, Berlin, 2471, 2002.

``Designs, disputes and strategies'' , *CSL 02.
Lecture Notes in Computer Science*, Springer, Berlin, 2471, 2002.

With Martin Hyland.

``An introduction to
uniformity in Ludics'' , in *Linear Logic in Computer Science,* Thomas
Ehrhard, Jean-Yves Girard, Paul Ruet, Phil Scott eds., London Mathematical
Society Lecture Notes Series 316 - Cambridge University Press, November 2004.

With Marie-Renee Fleury-Donnadieu and Myriam Quatrini.

"Proof nets sequentialisation in multiplicative linear
logic," Ann. Pure Appl. Logic, 155(3):173-182, 2008.

With P. Di Giamberardino

__``Basic logic: reflection, symmetry, visibility''__, *Journal of
Symbolic Logic*, vol. 65, n. 3, 979-1013, 2000.

With Giovanni Sambin and Giulia Battilotti.

__``Classical proofs via basic logic"__, *CSL`97. Lecture Notes in
Computer Science*, Springer, Berlin, 1414, 203-219, 1998.

__``A Unified Approach to Logical Calculi and Normalization of
Proofs,''__ *Lecture Notes of the 11th European Summer School in Logic,
Language and Information (ESSLLI)*, Utrecht University, 1999.

With Giovanni Sambin.

__``From Basic Logic to Quantum Logics with Cut-elimination''__,
*International Journal of Theoretical Physics*, 37(1): 31-37, Jan 1998.

With Giovanni Sambin.

__``A term calculus for a unitary approach to normalization,''__ in
*Proceedings of International Conference on Functional Programming (ICFP) '98
*, expanded abstract (the full version appears as {\it Preprint n. 22,}
Dipartimento di Matematica Pura ed Applicata, Universit\'a di Padova), 1998.

__``Quantum logic and the cube of logics"__, *Handbook of Philosophical
Logic (second edition)*, D. Gabbay, F. Guenthner (eds.), Kluwer, vol. VI,
ch. Quantum Logic by M. L. Dalla Chiara and R. Giuntini, to appear.

"Modular proof-theory." Draft. With Giovanni Sambin and Damiano Macedonio.

Institut de Math\'ematiques de Luminy (Marseille), Universit\'e Aix-Marseille II, 2002.

Supervisor Prof. Jean-Yves Girard.

University of Padova, 1996.

Supervisor Prof. Giovanni Sambin.