Samson Abramsky

Last updated

Samson Abramsky
FRS FRSE
Abramsky Samson.jpg
Abramsky in May 2005
Born (1953-03-12) 12 March 1953 (age 71) [1]
Alma mater
Awards
Scientific career
Fields
Institutions
Thesis Domain Theory and the Logic of Observable Properties  (1987)
Doctoral advisor Richard Bornat [4]
Website www.cs.ox.ac.uk/samson.abramsky

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.

Contents

Abramsky's early work included profound 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. [3] [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). [4]

Career and research

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 publications

Samson Abramsky co-edited 6 Volumes Handbook of Logic in Computer Science with Dov Gabbay and Tom Maibaum:

Abramsky has published over two hundred publications and his h-index was 57 as of October 2019. [13]

Some of the later works of Abramsky include:

Awards and honours

Abramsky is a Fellow of the Royal Society (2004), a Fellow of the Royal Society of Edinburgh (2000), [14] 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. [19]

Related Research Articles

In computer science, denotational semantics is an approach of formalizing the meanings of programming languages by constructing mathematical objects that describe the meanings of expressions from the languages. Other approaches providing formal semantics of programming languages include axiomatic semantics and operational semantics.

<span class="mw-page-title-main">Dana Scott</span> American logician (born 1932)

Dana Stewart Scott is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundations of modern approaches to the semantics of programming languages. He has also worked on modal logic, topology, and category theory.

Computer science is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. One well known subject classification system for computer science is the ACM Computing Classification System devised by the Association for Computing Machinery.

Domain theory is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains. Consequently, domain theory can be considered as a branch of order theory. The field has major applications in computer science, where it is used to specify denotational semantics, especially for functional programming languages. Domain theory formalizes the intuitive ideas of approximation and convergence in a very general way and is closely related to topology.

In programming language theory, semantics is the rigorous mathematical study of the meaning of programming languages. Semantics assigns computational meaning to valid strings in a programming language syntax. It is closely related to, and often crosses over with, the semantics of mathematical proofs.

Categorical logic is the branch of mathematics in which tools and concepts from category theory are applied to the study of mathematical logic. It is also notable for its connections to theoretical computer science. In broad terms, categorical logic represents both syntax and semantics by a category, and an interpretation by a functor. The categorical framework provides a rich conceptual background for logical and type-theoretic constructions. The subject has been recognisable in these terms since around 1970.

<span class="mw-page-title-main">Logic in computer science</span> Academic discipline

Logic in computer science covers the overlap between the field of logic and that of computer science. The topic can essentially be divided into three main areas:

<span class="mw-page-title-main">BCS Lovelace Medal</span> Award

The Lovelace Medal was established by the British Computer Society in 1998, and is presented to individuals who have made outstanding contributions to the understanding or advancement of computing. It is the top award in computing in the UK. Awardees deliver the Lovelace Lecture.

Giorgi Japaridze is a Georgian-American researcher in logic and theoretical computer science. He currently holds the title of Full Professor at the Computing Sciences Department of Villanova University. Japaridze is best known for his invention of computability logic, cirquent calculus, and Japaridze's polymodal logic.

<span class="mw-page-title-main">Gordon Plotkin</span> Computer Scientist

Gordon David Plotkin is a theoretical computer scientist in the School of Informatics at the University of Edinburgh. Plotkin is probably best known for his introduction of structural operational semantics (SOS) and his work on denotational semantics. In particular, his notes on A Structural Approach to Operational Semantics were very influential. He has contributed to many other areas of computer science.

<span class="mw-page-title-main">Programming language theory</span> Branch of computer science

Programming language theory (PLT) is a branch of computer science that deals with the design, implementation, analysis, characterization, and classification of formal languages known as programming languages. Programming language theory is closely related to other fields including mathematics, software engineering, and linguistics. There are a number of academic conferences and journals in the area.

Logic is the formal science of using reason and is considered a branch of both philosophy and mathematics and to a lesser extent computer science. Logic investigates and classifies the structure of statements and arguments, both through the study of formal systems of inference and the study of arguments in natural language. The scope of logic can therefore be very large, ranging from core topics such as the study of fallacies and paradoxes, to specialized analyses of reasoning such as probability, correct reasoning, and arguments involving causality. One of the aims of logic is to identify the correct and incorrect inferences. Logicians study the criteria for the evaluation of arguments.

The ACM–IEEE Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in relation to mathematical logic. Extended versions of selected papers of each year's conference appear in renowned international journals such as Logical Methods in Computer Science and ACM Transactions on Computational Logic.

Gérard Pierre Huet is a French computer scientist, linguist and mathematician. He is senior research director at INRIA and mostly known for his major and seminal contributions to type theory, programming language theory and to the theory of computation.

Categorical quantum mechanics is the study of quantum foundations and quantum information using paradigms from mathematics and computer science, notably monoidal category theory. The primitive objects of study are physical processes, and the different ways that these can be composed. It was pioneered in 2004 by Samson Abramsky and Bob Coecke. Categorical quantum mechanics is entry 18M40 in MSC2020.

<span class="mw-page-title-main">Bob Coecke</span> Belgian theoretical physicist and logician

Bob Coecke is a Belgian theoretical physicist and logician who was professor of Quantum foundations, Logics and Structures at Oxford University until 2020. He pioneered categorical quantum mechanics, Quantum Picturalism, ZX-calculus, DisCoCat model for natural language, and quantum natural language processing (QNLP). He is a founder of the Quantum Physics and Logic community and conference series, and of the journal Compositionality.

ACM SIGLOG or SIGLOG is the Association for Computing Machinery Special Interest Group on Logic and Computation. It publishes a news magazine, and has the annual ACM–IEEE Symposium on Logic in Computer Science (LICS) as its flagship conference. In addition, it publishes an online newsletter, the SIGLOG Monthly Bulletin, and "maintains close ties" with the related academic journal ACM Transactions on Computational Logic.

Mariangiola Dezani-Ciancaglini is an Italian logician and theoretical computer scientist whose research topics include type theory and intersection type disciplines, lambda calculus, and programming language semantics. She is a professor emerita at the University of Turin.

DisCoCat is a mathematical framework for natural language processing which uses category theory to unify distributional semantics with the principle of compositionality. The grammatical derivations in a categorial grammar are interpreted as linear maps acting on the tensor product of word vectors to produce the meaning of a sentence or a piece of text. String diagrams are used to visualise information flow and reason about natural language semantics.

References

  1. ↑ A & C Black (2014). "ABRAMSKY, Prof. Samson". Who's Who. Bloomsbury Publishing.(subscription required)
  2. 1 2 "Mr Samson Abramsky". awards.acm.org.
  3. 1 2 Samson Abramsky publications indexed by Google Scholar
  4. 1 2 Samson Abramsky at the Mathematics Genealogy Project
  5. ↑ Samson Abramsky's publications indexed by the Scopus bibliographic database. (subscription required)
  6. ↑ 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.
  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 at DBLP Bibliography Server OOjs UI icon edit-ltr-progressive.svg
  10. ↑ Abramsky, S. (1993). "Computational interpretations of linear logic". Theoretical Computer Science . 111 (1–2): 3–57. doi: 10.1016/0304-3975(93)90181-R .
  11. ↑ Samson Abramsky author profile page at the ACM Digital Library
  12. ↑ Samson Abramsky publications indexed by Microsoft Academic
  13. ↑ Samson Abramsky : Publications
  14. ↑ "Professor Samson Abramsky FRS FRSE". The Royal Society of Edinburgh. 19 May 2017. Retrieved 27 January 2019.
  15. ↑ "The EATCS Award 2024 - Laudation for Samson Abramsky". eatcs.org.
  16. ↑ "BCS Academy of Computing | BCS". www.bcs.org.
  17. ↑ "LICS Test-of-Time Award". siglog.org.
  18. ↑ "ICALP/LICS/FSCD 2024". compose.ioc.ee.
  19. ↑ "DServe Archive Catalog Show". collections.royalsociety.org.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.