|Born||March 12, 1953|
|Thesis||Domain Theory and the Logic of Observable Properties (1968)|
|Doctoral advisor||Richard Bornat|
Samson Abramsky FRS (born March 12, 1953), FRSE is a computer scientist who holds the Christopher Strachey Professorship at Oxford University Computing Laboratory. He is well known for playing a leading role in the development of game semantics. He has made significant contributions to the areas of domain theory, the lazy lambda calculus, strictness analysis, concurrency theory, interaction categories, and the geometry of interaction.
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).
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 achievements include 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.
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 awarded the BCS Lovelace Medal in 2013
- 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 generalization of Girard's Geometry of Interaction, leading to a new genre of full completeness theorems, which characterize 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.||”|
- "ABRAMSKY, Prof. Samson". Who's Who 2014, A & C Black, an imprint of Bloomsbury Publishing plc, 2014; online edn, Oxford University Press.(subscription required)
- List of publications from Google Scholar
- Samson Abramsky at the Mathematics Genealogy Project
- Samson Abramsky from the Scopus bibliographic database
- Abramsky, S.; Jagadeesan, R.; Malacaria, P. (2000). "Full Abstraction for PCF". Information and Computation 163 (2): 409. arXiv:arXiv:1311.6125. doi:10.1006/inco.2000.2930.
- 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.
- List of publications from the 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 from the ACM Portal
- List of publications from Microsoft Academic Search
- "BCS announce Needham and Lovelace Award winners".
|Wikimedia Commons has media related to Samson Abramsky.|