Samson Abramsky

Samson Abramsky

Samson Abramsky
Born 12 March 1953[1]
Fields
Institutions
Alma mater
Thesis Domain Theory and the Logic of Observable Properties (1968)
Doctoral advisor Richard Bornat[3]
Doctoral students
Notable awards
Website
www.cs.ox.ac.uk/samson.abramsky

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

Education

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).[3]

Career

Since 2000, he has been a Fellow of the Royal Society of Edinburgh, 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 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.

Awards and honours

Abramsky is a Fellow of the Royal Society (2004), a Fellow of the Royal Society of Edinburgh (2000), 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:

“ 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.[15] ”

Selected works

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

Samson Abramsky published over two hundred publications and h-index is 49 until January 2015. [16]

Some of the recent works of Samson Abramsky include:

References

  1. ↑ A & C Black (2014). "ABRAMSKY, Prof. Samson". Who's Who. Bloomsbury Publishing.(subscription required)
  2. ↑ 2.0 2.1 Samson Abramsky's publications indexed by Google Scholar, a free service provided by Google
  3. ↑ 3.0 3.1 3.2 Samson Abramsky at the Mathematics Genealogy Project
  4. ↑ SAMSON ABRAMSKY ACM Fellows 2014
  5. ↑ Samson Abramsky's publications indexed by the Scopus bibliographic database, a service provided by Elsevier.
  6. ↑ Abramsky, S.; Jagadeesan, R.; Malacaria, P. (2000). "Full Abstraction for PCF". 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". Information and Computation 105 (2): 159. doi:10.1006/inco.1993.1044.
  8. ↑ Samson Abramsky LinkedIn page
  9. ↑ Samson Abramsky's publications indexed by the DBLP Bibliography Server at the University of Trier
  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 from the ACM Portal
  12. ↑ List of publications from Microsoft Academic Search
  13. ↑ SAMSON ABRAMSKY ACM Fellows 2014
  14. ↑ "BCS announce Needham and Lovelace Award winners".
  15. ↑ http://royalsociety.org/DServe/dserve.exe?dsqIni=Dserve.ini&dsqApp=Archive&dsqDb=Catalog&dsqCmd=show.tcl&dsqSearch=(RefNo==%27EC%2F2004%2F01%27)
  16. ↑ Samson Abramsky : Publications
Wikimedia Commons has media related to Samson Abramsky.