Abramsky has published over two hundred publications and his h-index was 57 as of October 2019.[13]
1986. Strictness analysis for higher-order functions. (with GL Burn, C Hankin). Science of Computer Programming.
1990. The Lazy Lambda Calculus. Research Topics in Functional Programming.
1993. Computational Interpretations of Linear logic. in Theoretical Computer Science 111
1994. Domain Theory. (with A Jung). in Handbook of Logic in Computer Science 3.
1996. Interaction categories and the foundations of typed concurrent programming. (with S Gay and R Nagarajan). NATO ASI SERIES F COMPUTER AND SYSTEMS SCIENCES 152
1997. Specifying interaction categories. (with D Pavlović). Category Theory and Computer Science
2002. Geometry of interaction and linear combinatory algebras. (with E Haghverdi and P Scott). Mathematical Structures in Computer Science 12 (5)
2003. Sequentiality vs. concurrency in games and logic. Mathematical Structures in Computer Science 13 (4)
Some of the later works of Abramsky include:
2010. Introduction to categories and categorical logic. (with N. Tzevelekos). In New Structures for Physics. Springer.
2012. Logical Bell Inequalities. (with Lucien Hardy). In Physical Review A. Vol. 85. No. ARTN 062114.
Abramsky is a Fellow of the Royal Society (2004), a Fellow of the Royal Society of Edinburgh (2000),[14] and a Member of Academia Europaea (1993). He is a member of the editorial boards of the North Holland Studies in Logic and the Foundations of Mathematics, and of the Cambridge Tracts in Theoretical Computer Science. He was general chair of LiCS 2000–2003, and is a member of the LiCS Organizing Committee.
Samson Abramsky is distinguished for seminal contributions to the mathematical foundations of computation. His outstanding achievement is his development of Game Semantics as a theory of computational processes which exposes the mathematical structure of the information flow between them. This has led to powerful applications in the study of programming languages, offering decisive new insights into the nature of sequentiality, state, control, and many other computational features. It is now leading in turn to new developments in computer-assisted program analysis and verification. An important strand, which also stands as a contribution to logic, is a generalisation of Girard's Geometry of Interaction, leading to a new genre of full completeness theorems, which characterise the 'space of proofs' of a logic. Previously, Abramsky made important contributions to abstract interpretation, domain theory, lambda calculus and concurrency. He continues to shed light over a broad range of topics by sharp and creative insights, breaking new ground, and bringing order and unity to existing work.[16]
