Samson Abramsky
| Samson Abramsky | |
|---|---|
 Samson Abramsky | |
| Born | 12 March 1953[1] |
| Fields | |
| Institutions | |
| Alma mater |
|
| Thesis | Domain Theory and the Logic of Observable Properties (1987) |
| Doctoral advisor | Richard Bornat[3] |
| Notable awards |
|
|
Website www | |
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.[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 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:
- Programmer, GEC Computers Limited, 1976–1978
- Lecturer, Department of Computer Science and Statistics, QMUL, 1980–1983
- Lecturer, 1983–1988, Reader, 1988–1990, professor, 1990–1995, Department of Computing, Imperial College London
- Professor of Theoretical Computer Science, University of Edinburgh, 1996–2000
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), 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.
- He was elected Fellow of ACM (2014) For contributions to domains in logical form, game semantics, categorical quantum mechanics, and contextual semantics. [4]
- He was awarded the BCS Lovelace Medal in 2013[14]
- He was awarded an EPSRC Senior Research Fellowship in 2007
- His paper "Domain theory in Logical Form" won the LiCS Test-of-Time award (a 20-year retrospective) for 1987. The award was presented at LiCS 2007.
- He was awarded an EPSRC Senior Research Fellowship on Foundational Structures and Methods for Quantum Informatics in 2007.
- Fellow of the Royal Society (2004)
- Fellow of the Royal Society of Edinburgh (2000)
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] | ” |
References
- ↑ A & C Black (2014). "ABRAMSKY, Prof. Samson". Who's Who. Bloomsbury Publishing.(subscription required)
- 1 2 Samson Abramsky's publications indexed by Google Scholar
- 1 2 Samson Abramsky at the Mathematics Genealogy Project
- 1 2 SAMSON ABRAMSKY ACM Fellows 2014
- ↑ Samson Abramsky's publications indexed by the Scopus bibliographic database, a service provided by Elsevier. (subscription required)
- ↑ 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. - ↑ 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.
- ↑ Samson Abramsky LinkedIn page
- ↑ Samson Abramsky at DBLP Bibliography Server
- ↑ Abramsky, S. (1993). "Computational interpretations of linear logic". Theoretical Computer Science. 111: 3. doi:10.1016/0304-3975(93)90181-R.
- ↑ Samson Abramsky author profile page at the ACM Digital Library
- ↑ List of publications from Microsoft Academic Search
- ↑ Samson Abramsky : Publications
- ↑ "BCS announce Needham and Lovelace Award winners".
- ↑ http://royalsociety.org/DServe/dserve.exe?dsqIni=Dserve.ini&dsqApp=Archive&dsqDb=Catalog&dsqCmd=show.tcl&dsqSearch=(RefNo==%27EC%2F2004%2F01%27)
 |
Wikimedia Commons has media related to Samson Abramsky. |