1. Abramsky S (1996) Retracing some paths in process algebra. In: Proceedings of CONCUR 96. Lectures notes in computer science, vol 1119. Springer, Berlin, pp 1–17
2. Abramsky S (2002) Algorithmic game semantics: a tutorial introduction. In: Proof and system-reliability. Kluwer, Dordrecht
3. Abramsky S (2004) High-level methods for quantum computation and information. In: Proceedings of the 19th annual IEEE symposium on logic in computer science. IEEE Computer Science Press, Los Alamitos, pp 410–414
4. Abramsky S (2005) Abstract scalars, loops, and free traced and strongly compact closed categories. In: Proceedings of CALCO 2005. Springer lecture notes in computer science, vol 3629. Springer, Berlin, pp 1–31
5. Abramsky S (2007) Temperley–Lieb algebras and geometry of interaction. In: Chen G, Kauffman L, Lamonaco S (eds) Mathematics of quantum computing and technology. Chapman and Hall/CRC, Boca Raton, pp 413–458