Samson Abramsky

From Wikipedia, the free encyclopedia

Samson Abramsky.

Samson Abramsky FRS, 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.

Biography

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.

He 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).^[1]

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

Research career

Samson Abramsky is Christopher Strachey Professor of Computing and a Fellow of Wolfson College, Oxford University. Previously he held chairs at the Imperial College of Science, Technology and Medicine, and at the University of Edinburgh.

He holds MA degrees from Cambridge and Oxford, and a PhD from the University of London.

He 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 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.

Abramsky's PhD students include Luke Ong.^[1]

Awards

He was awarded the BCS Lovelace Medal in 2013^[2]
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)

References

External links

Wikimedia Commons has media related to Samson Abramsky.

Samson Abramsky home page
Samson Abramsky page, LinkedIn
List of publications from the DBLP Bibliography Server

Authority control	VIAF: 109321899 ISNI: 0000 0001 1081 8672 BNF: cb124222117 MGP: 67094

Persondata
Name	Abramsky, Samson
Alternative names
Short description	Computer scientist
Date of birth	1953
Place of birth	United Kingdom
Date of death
Place of death

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.