Samson Abramsky

Revision as of 04:37, 28 May 2025 by imported>OAbot (Open access bot: url-access updated in citation with #oabot.)
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Template:Short description Template:EngvarB Template:Use dmy dates Template:Infobox scientist Samson Abramsky (born 12 March 1953) is a British computer scientist who is a Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at Wolfson College, Oxford, from 2000 to 2021.

Abramsky's early work included contributions to domain theory and the connections thereof with geometric logic. Since then, his work has covered the lazy lambda calculus, strictness analysis, concurrency theory, interaction categories and geometry of interaction, game semantics and quantum computing. Notably, he co-pioneered categorical quantum mechanics. More recently, he has been applying methods from categorical semantics to finite model theory, with applications to descriptive complexity.<ref name="googlescholar">Template:GoogleScholar</ref><ref name="scopus">Template:Scopus</ref><ref>Template:Cite journal</ref><ref>Template:Cite journal</ref><ref name="linkedin">{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref name="dblp">Template:DBLP</ref><ref>Template:Cite journal</ref><ref name="acm">Template:ACMPortal</ref><ref name="microsoft">Template:AcademicSearch</ref>

EducationEdit

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).<ref name="mathgene">Template:MathGenealogy</ref>

Career and researchEdit

Since 2021, Abramsky has been Professor of Computer Science at University College London. He has 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 publicationsEdit

Samson Abramsky co-edited 6 Volumes Handbook of Logic in Computer Science with Dov Gabbay and Tom 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.

Abramsky has published over two hundred publications and his h-index was 57 as of October 2019.<ref>Samson Abramsky : Publications</ref>

  • 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 later works of Abramsky include:

Awards and honoursEdit

Abramsky is a Fellow of the Royal Society (2004), a Fellow of the Royal Society of Edinburgh (2000),<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> 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 EATCS Award in 2024 which is given for contributions to theoretical computer science over a life long career. Among his work mentioned in the laudation are his contributions to domain theory, game semantics, and categorical approach to quantum computation and information.<ref name="eatcs">{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

|CitationClass=web }}</ref>

  • Three of his papers won the LiCS Test-of-Time award (a 20-year retrospective):<ref name="lics-tot">{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

    • Samson Abramsky. "Domain theory in Logical Form" (1987). The award was presented at LiCS 2007.
    • Samson Abramsky, Kohei Honda and Guy McCusker. "A Fully Abstract Game Semantics for General References" (1998). The award was presented at LiCS 2018.
    • Samson Abramsky and Bob Coecke. "A categorical semantics of quantum protocols." (2004). The award was presented at LiCS 2024.<ref name="tot-2024">{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

Abramsky's nomination for the Royal Society reads:

Template:Quote

ReferencesEdit

Template:Reflist

Template:Sister project Template:FRS 2004 Template:EATCS Award laureates Template:Authority control