Samson Abramsky

From Infogalactic: the planetary knowledge core
Jump to: navigation, search
Samson Abramsky
Abramsky Samson.jpg
Samson Abramsky
Born (1953-03-12) 12 March 1953 (age 71)[1]
Fields <templatestyles src="Plainlist/styles.css"/>
Institutions <templatestyles src="Plainlist/styles.css"/>
Alma mater <templatestyles src="Plainlist/styles.css"/>
Thesis Domain Theory and the Logic of Observable Properties (1987)
Doctoral advisor Richard Bornat[3]
Doctoral students <templatestyles src="Plainlist/styles.css"/>
Notable awards <templatestyles src="Plainlist/styles.css"/>
Website
www.cs.ox.ac.uk/samson.abramsky

Samson Abramsky FRS (born 12 March 1953), FRSE 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 computer science.[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

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

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.

Abramsky's nomination for the Royal Society reads:

  1. REDIRECT Template:Cquote


  • This is a redirect from a page that has been moved (renamed). This page was kept as a redirect to avoid breaking links, both internal and external, that may have been made to the old page name. For more information follow the bold category link.

Selected works

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 h-index is 49 until January 2015. [15]

  • 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:

References

  1. ↑ Lua error in package.lua at line 80: module 'strict' not found.(subscription required)
  2. ↑ 2.0 2.1 Samson Abramsky's publications indexed by Google Scholar, a service provided by Google
  3. ↑ 3.0 3.1 3.2 Samson Abramsky at the Mathematics Genealogy Project
  4. ↑ SAMSON ABRAMSKY ACM Fellows 2014
  5. ↑ Samson Abramsky's publications indexed by the Scopus bibliographic database, a service provided by Elsevier.
  6. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  7. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  8. ↑ Samson Abramsky LinkedIn page
  9. ↑ Samson Abramsky's publications indexed by the DBLP Bibliography Server at the University of Trier
  10. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  11. ↑ Samson Abramsky from the Association for Computing Machinery (ACM) Digital Library
  12. ↑ List of publications from Microsoft Academic Search
  13. ↑ SAMSON ABRAMSKY ACM Fellows 2014
  14. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  15. ↑ Samson Abramsky : Publications
Retrieved from "https://infogalactic.com/w/index.php?title=Samson_Abramsky&oldid=1953609"