Samson Abramsky

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Samson Abramsky
Abramsky Samson.jpg
Samson Abramsky
Born (1953-03-12) 12 March 1953 (age 65)[1]
Alma mater
Scientific career
Thesis Domain Theory and the Logic of Observable Properties (1987)
Doctoral advisor Richard Bornat[4]

Samson Abramsky FRS, FRSE (born 12 March 1953) is a computer scientist who holds the Christopher Strachey Professorship at the Department of Computer Science (formerly the Computing Laboratory), University of Oxford. He has made contributions to the areas of domain theory, the lazy lambda calculus, strictness analysis, concurrency theory, interaction categories, geometry of interaction, game semantics and quantum computing.[3][5][6][7][8][9][10][11][12]


Abramsky was educated at Hasmonean Grammar School for Boys, Hendon and at King's College, Cambridge (BA 1975, MA Philosophy 1979, Diploma in Computer Science) and Queen Mary, University of London (PhD Computer Science 1988, supervised by Richard Bornat).[4]

Career and research

As of 2016 Abramsky is a Fellow of Wolfson College, Oxford and Christopher Strachey Professor of Computing at Oxford University Department of Computer Science. He has also been a Fellow of the Royal Society since 2004. His research includes the development of game semantics, domain theory in logical form, and categorical quantum mechanics.

His earlier positions include:

Abramsky has played a leading role in the development of game semantics, and its applications to the semantics of programming languages. Other notable contributions include his work on domain theory in logical form, the lazy lambda calculus, strictness analysis, concurrency theory, interaction categories, and geometry of interaction. He has recently been working on high-level methods for quantum computation and information.

Selected publications

Samson Abramsky co-edited 6 Volumes Handbook of Logic in Computer Science with Dov Gabbay and T. S. E. Maibaum.

  • 1992. Volume 1: Background: Mathematical Structures.
  • 1992. Volume 2: Background: Computational Structures.
  • 1995. Volume 3: Semantic Structures.
  • 1995. Volume 4: Semantic Modelling.
  • 2001. Volume 5: Logic and Algebraic Methods.
  • Volume 6 Logical methods in computer science.

Samson Abramsky published over two hundred publications and his h-index was 49 as of January 2015.[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 recent works of Samson Abramsky include:

  • 2013. Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics. (with G. Gottlob and P. Kolaitis). IJCAI 2013
  • 2012. Logical Bell Inequalities. (with Lucien Hardy). In Physical Review A. Vol. 85. No. ARTN 062114
  • 2010. Introduction to categories and categorical logic. (with N. Tzevelekos). In New Structures for Physics. Springer.

Awards and honours

Abramsky is a Fellow of the Royal Society (2004), a Fellow of the Royal Society of Edinburgh (2000),[citation needed] 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.

Abramsky's nomination for the Royal Society reads:


  1. ^ A & C Black (2014). "ABRAMSKY, Prof. Samson". Who's Who. Bloomsbury Publishing. (subscription required)
  2. ^ a b SAMSON ABRAMSKY ACM Fellows 2014
  3. ^ a b Samson Abramsky publications indexed by Google Scholar
  4. ^ a b Samson Abramsky at the Mathematics Genealogy Project
  5. ^ Samson Abramsky's publications indexed by the Scopus bibliographic database. (subscription required)
  6. ^ Abramsky, S.; Jagadeesan, R.; Malacaria, P. (2000). "Full Abstraction for PCF" (PDF). Information and Computation. 163 (2): 409. arXiv:1311.6125. doi:10.1006/inco.2000.2930.
  7. ^ Abramsky, S.; Ong, C. H. L. (1993). "Full Abstraction in the Lazy Lambda Calculus" (PDF). Information and Computation. 105 (2): 159. doi:10.1006/inco.1993.1044.
  8. ^ Samson Abramsky LinkedIn page
  9. ^ Samson Abramsky at DBLP Bibliography Server
  10. ^ Abramsky, S. (1993). "Computational interpretations of linear logic". Theoretical Computer Science. 111: 3. doi:10.1016/0304-3975(93)90181-R.
  11. ^ Samson Abramsky author profile page at the ACM Digital Library
  12. ^ List of publications from Microsoft Academic
  13. ^ Samson Abramsky : Publications
  14. ^ "BCS announce Needham and Lovelace Award winners".
  15. ^
Retrieved from ""
This content was retrieved from Wikipedia :
This page is based on the copyrighted Wikipedia article "Samson Abramsky"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA