1. Abramsky, S.: Axioms for definability and full completeness. In: Proof, Language, and Interaction (Essay in honor of Robin Milner) The MIT Press (2000) 55-76.
2. Full Abstraction for PCF
3. Logic Programming with Focusing Proofs in Linear Logic
4. Basaldella, M.: On Exponentials in Ludics. PhD Thesis (2008) University of Siena.
5. Basaldella, M., Faggian, C.: Ludics with Repetitions (Exponentials, Interactive Types and Completeness). In: LICS. (2009) 375-384.