1. S. Abramsky. Axioms for Definability and Full Completeness, in Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling and M. Tofte, eds., MIT Press, 2000, 55–75.
2. S. Abramsky, R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, J. of Symbolic Logic
59(2), 1994, 543–574.
3. S. Abramsky, R. Jagadeesan, P. Malacaria. Full Abstraction for PCF, 1996, Inf. and Comp., to appear.
4. A. Asperti, G. Longo. Categories, Types ad Structures, Foundations of Computing Series, The MIT Press, 1991.
5. S. Abramsky, M. Lenisa. Fully Complete Models for ML Polymorphic Types, Report ECS-LFCS-99-414, University of Edinburgh, October 1999.