1. S. Abramsky. Proofs as processes. Unpublished Lecture Notes, 1991.
2. S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Technical Report DoC 92/24, Department of Computing, Imperial College of Science Technology and Medicine, 1992.
3. S. Abramsky and R. Jagadeesan. New foundations for the geometry of interaction. In Proceedings,Seventh Annual IEEE Symposium on Logic in Computer Science, pages 211–222. IEEE Computer Society Press, 1992.
4. P. Aczel. Non-well-founded sets. CSLI Lecture Notes 14. Center for the Study of Language and Information, 1988.
5. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21 (4): 181–185, 1985.