Samson Abramsky
Computer scientist
Samson Abramsky's AcademicInfluence.com Rankings
Download Badge
Computer Science
Why Is Samson Abramsky Influential?
(Suggest an Edit or Addition)According to Wikipedia, Samson Abramsky is 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. His 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.
Samson Abramsky's Published Works
Published Works
- Domain theory (1995) (1277)
- Handbook of logic in computer science. (1992) (909)
- A categorical semantics of quantum protocols (2004) (857)
- Full Abstraction for PCF (1994) (697)
- Domain Theory in Logical Form (1991) (552)
- Computational Interpretations of Linear Logic (1993) (513)
- Games and full completeness for multiplicative linear logic (1992) (469)
- The lazy lambda calculus (1990) (466)
- The sheaf-theoretic structure of non-locality and contextuality (2011) (428)
- Abstract Interpretation of Declarative Languages (1987) (334)
- Full Abstraction in the Lazy Lambda Calculus (1993) (304)
- Categorical quantum mechanics (2008) (259)
- Observation Equivalence as a Testing Equivalence (1987) (238)
- Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions (1996) (231)
- Quantales, observational logic and process semantics (1993) (230)
- A fully abstract game semantics for general references (1998) (225)
- A Domain Equation for Bisimulation (1991) (205)
- Concurrent games and full completeness (1999) (199)
- Game Semantics (1999) (181)
- Strictness Analysis for Higher-Order Functions (1986) (179)
- Retracing some paths in Process Algebra (1996) (168)
- Geometry of Interaction and linear combinatory algebras (2002) (166)
- Proofs as Processes (1992) (158)
- Call-by-Value Games (1997) (143)
- New foundations for the geometry of interaction (1992) (142)
- Interaction categories and the foundations of typed concurrent programming (1996) (140)
- Semantics of Interaction: an introduction to Game Semantics (1997) (133)
- Contextual Fraction as a Measure of Contextuality. (2017) (103)
- Nuclear and trace ideals in tensored-categories (1998) (101)
- The theory of strictness analysis for higher order functions (1985) (97)
- Logical Bell Inequalities (2012) (96)
- A Structural Approach to Reversible Computation (2005) (93)
- Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories (2005) (93)
- Contextuality, Cohomology and Paradox (2015) (90)
- Introduction to Categories and Categorical Logic (2011) (87)
- A categorical quantum logic (2005) (86)
- Abstract Interpretation, Logical Relations and Kan Extensions (1990) (85)
- Full Abstraction for PCF * ( Extended Abstract ) (1994) (84)
- Nominal games and full abstraction for the nu-calculus (2004) (79)
- Applying Game Semantics to Compositional Software Modeling and Verification (2004) (77)
- A Cook's Tour of the Finitary Non-Well-Founded Sets (2011) (77)
- The Cohomology of Non-Locality and Contextuality (2011) (71)
- Category Theory and Computer Programming (1986) (69)
- Full Abstraction for Idealized Algol with Passive Expressions (1999) (68)
- The theory and practice of strictness analysis for higher order functions (1985) (68)
- From IF to BI (2009) (67)
- H*-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics (2010) (65)
- On Semantic Foundations for Applicative Multiprogramming (1983) (62)
- Strictness analysis and polymorphic invariance (1985) (62)
- The Lazy λ−Calculus (1990) (57)
- No-Cloning In Categorical Quantum Mechanics (2009) (57)
- Temperley−Lieb algebra: From knot theory to logic and computation via quantum mechanics (2009) (57)
- Abstract Physical Traces (2009) (56)
- Physical Traces: Quantum vs. Classical Information Processing (2002) (53)
- An Operational Interpretation of Negative Probabilities and No-Signalling Models (2014) (52)
- Coalgebras, Chu Spaces, and Representations of Physical Systems (2009) (47)
- Handbook of logic in computer science. Volume 4. Semantic modelling (1995) (46)
- What are the fundamental structures of concurrency? We still don't know! (2006) (45)
- Interaction categories and communicating sequential processes (1994) (45)
- The pebbling comonad in Finite Model Theory (2017) (45)
- Semantics of Interaction (Abstract) (1996) (45)
- Relational Hidden Variables and Non-Locality (2010) (44)
- Relational Databases and Bell's Theorem (2012) (44)
- Sequentiality vs. concurrency in games and logic (2003) (43)
- Domain Theory and the Logic of Observable Properties (2011) (42)
- Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky (2013) (41)
- Handbook of logic in computer science. Volume 3. Semantic Structures (1995) (40)
- Specification Structures and Propositions-as-Types for Concurrency (1996) (40)
- Interaction Categories (1993) (38)
- High-level methods for quantum computation and information (2004) (37)
- Games for Recursive Types (1994) (37)
- An internal language for autonomous categories (1993) (37)
- A game semantics for generic polymorphism (2003) (37)
- Background : computational structures (1992) (36)
- Relating Structure and Power: Comonadic Semantics for Computational Resources (2018) (33)
- Introduction to Abstract Interpretation (1987) (32)
- Big toy models - Representing physical systems as Chu spaces (2012) (32)
- Mathematical Foundations of Information Flow (2012) (32)
- Game Semantics for Programming Languages (Abstract) (1997) (31)
- Algorithmic Game Semantics: A Tutorial Introduction (2001) (31)
- Handbook of logic in computer science. Volume 2. Background: Computational structures (1993) (31)
- A relational approach to strictness analysis for higher-order polymorphic functions (1991) (29)
- Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics (2013) (29)
- Games in the Semantics of Programming Languages (1997) (29)
- The Quantum Monad on Relational Structures (2017) (28)
- Games and full abstraction for the lazy /spl lambda/-calculus (1995) (28)
- Information, Processes and Games (2016) (28)
- A Generalized Kahn Principle for Abstract Asynchronous Networks (1989) (28)
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting (2012) (27)
- Interaction categories (extended abstract) (1994) (27)
- From IF to BI: a tale of dependence and separation (2011) (27)
- TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD) (1991) (26)
- Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming (1983) (25)
- Games and Full Abstraction f"or the Lazy X-calculus (1995) (24)
- Handbook of logic in computer science. Volume 1. Background: Mathematical structures (1993) (24)
- Operational theories and Categorical quantum mechanics (2012) (24)
- Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity (2014) (24)
- Big toy models (2009) (23)
- Journeys in Non-Classical Computation (2008) (22)
- Intensionality, Definability and Computation (2017) (21)
- Linear realizability and full completeness for typed lambda-calculi (2005) (20)
- A Compositional Game Semantics for Multi−Agent Logics of Partial Information (2007) (19)
- Socially Responsive‚ Environmentally Friendly Logic (2006) (19)
- A Fully Complete PER Model for ML Polymorphic Types (2000) (19)
- Petri Nets, Discrete Physics, and Distributed Quantum Computation (2008) (18)
- TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'91) (1991) (18)
- Axioms for definability and full completeness (2000) (17)
- A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems (1997) (17)
- Semantic Unification A sheaf theoretic approach to natural language (2014) (17)
- Comonadic semantics for guarded fragments (2020) (17)
- Arrow's Theorem by Arrow Theory (2014) (16)
- Game Semantics for Access Control (2009) (16)
- Specifying Interaction Categories (1997) (15)
- Full Abstraction in the Lazy λ−calculus (1993) (15)
- Process Realizability (2015) (15)
- Secd-m: a Virtual Machine for Applicative Programming (1985) (15)
- Background : mathematical structures (1992) (14)
- Games for Dependent Types (2015) (14)
- Hardy is (almost) everywhere: Nonlocality without inequalities for almost all entangled multipartite states (2015) (14)
- Contextuality: At the Borders of Paradox (2018) (13)
- Possibilities Determine the Combinatorial Structure of Probability Polytopes (2016) (13)
- A classification of multipartite states by degree of non-locality (2014) (13)
- A comonadic view of simulation and quantum resources (2019) (12)
- Semantics of Interaction (2013) (12)
- Algorithmic Game Semantics (2002) (11)
- Minimum Quantum Resources for Strong Non-Locality (2017) (11)
- Physics from Computer Science (2007) (11)
- Two Puzzles About Computation (2014) (11)
- Arboreal Categories and Resources (2021) (11)
- Game Theory Meets Theoretical Computer Science (2005) (11)
- From Lawvere to Brandenburger-Keisler: Interactive forms of diagonalization and self-reference (2010) (10)
- A Unified Sheaf-Theoretic Account Of Non-Locality and Contextuality (2011) (10)
- Dependence Logic, Theory and Applications (2016) (10)
- Category Theory and Computer Programming, Tutorial and Workshop, Guildford, UK, September 16-20, 1985 Proceedings (1986) (10)
- A complete characterization of all-versus-nothing arguments for stabilizer states (2017) (10)
- Dynamic Games and Strategies (2016) (10)
- Grand Challenge 7: Journeys in Non-Classical Computation (2008) (10)
- Whither semantics? (2020) (9)
- Physics from Computer Science: a Position Statement (2007) (9)
- Non-locality, contextuality and valuation algebras: a general theory of disagreement (2019) (9)
- A fully abstract denotational semantics for the calculus of higher-order communicating systems (2001) (8)
- Discrete density comonads and graph parameters (2022) (8)
- The logic of contextuality (2020) (8)
- No-Signalling Is Equivalent To Free Choice of Measurements (2014) (8)
- Algorithmic Game Semantics and Component−Based Verification (2003) (7)
- Toward a Lexicalist Framework of Constraint-based Syntactic Ambiguity Reso- Lution. in 6.2 Discussion Eeects of Syntax in Human Sen- Tence Parsing: Evidence against a Structure- Based Proposal Mechanism. Journal of Ex- Perimental Psychology: Learning, Memory and (8) (2007) (7)
- The foundations of computation, physics and mentality: the Turing legacy (2012) (7)
- Arboreal Categories: An Axiomatic Theory of Resources (2021) (6)
- Game semantics for dependent types (2018) (6)
- Mixed computation of Prolog programs (1988) (6)
- Concurrent Interaction Games (2000) (6)
- Proceedings of TAPSOFT 91 (1991) (6)
- Pictures of processes (2011) (6)
- Beyond full abstraction: model-checking for Algol-like languages (2001) (6)
- Structure and Power: an emerging landscape (2022) (6)
- Logic and Categories As Tools For Building Theories (2012) (6)
- A Specification Structure for Deadlock-Freedom of Synchronous Processes (1999) (6)
- Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071) (2013) (5)
- Comonadic semantics for hybrid logic and bounded fragments (2021) (5)
- 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany (2015) (5)
- An Integrated Engineering Study Scheme in Computing (1993) (5)
- Heterotic Computing Examples with Optics, Bacteria, and Chemicals (2012) (5)
- OOPSLA panel on object-based concurrent programming (1991) (5)
- Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus (2001) (5)
- Classical logic, classical probability, and quantum mechanics (2020) (5)
- Axiomatizing Fully Complete Models for ML Polymorphic Types (2000) (5)
- Coalgebras, Chu Spaces, and Representations of Physical Systems (2013) (4)
- From CSP to Game Semantics (2010) (4)
- Comonadic semantics for hybrid logic (2022) (4)
- Team Semantics and Independence Notions in Quantum Physics (2021) (4)
- Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008 (2008) (4)
- Fully Complete Models for ML Polymorphic Types (1999) (4)
- From Computation to Interaction, towards a science of information (1998) (4)
- Handbook of logic in computer science. Volume 5. Logic and Algebraic Methods (2000) (4)
- AMS Proceedings of Symposia in Applied Mathematics (2012) (4)
- Automata, Languages and Programming (1992) (4)
- Observa-tional logic and process semantics (1993) (3)
- On the Quantum-like Contextuality of Ambiguous Phrases (2021) (3)
- Full Abstraction for PCF1 (1996) (3)
- A Fully Complete Minimal PER Model for the Simply Typed-calculus (2001) (3)
- Games and Full Abstraction for the Lazy lambda-Calculus (1995) (3)
- Probabilistic Programs: Contextuality and Relational Database Theory (2016) (3)
- Event Domains, Stable Functions and Proof-Nets (2007) (3)
- DEMONIC programming: a computational language for single-particle equilibrium thermodynamics, and its formal semantics (2015) (3)
- Logic and algebraic methods (2000) (3)
- Reasoning about concurrent systems: a functional approach (1984) (2)
- Computer Science Logic 2015 (2015) (2)
- A complete characterisation of All-versus-Nothing arguments for stabiliser states (2017) (2)
- Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II (2010) (2)
- Game semantics for exponentials (1993) (2)
- An Algebraic Characterisation of Concurrent Composition (2014) (2)
- Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1 (1991) (2)
- Algorithmic Game Semantics and Static Analysis (2005) (2)
- Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract) (2007) (1)
- Relating Structure and Power: Extended Version (2020) (1)
- Pascal−m: a language for the design of loosely coupled distributed systems (1983) (1)
- Notes on presheaf representations of strategies and cohomological refinements of k-consistency and k-equivalence (2022) (1)
- Quantum Information Flow : A Computer Science Perspective (2007) (1)
- Pascal−m in Office Information Systems (1982) (1)
- Foundations of object-based concurrent programming (panel session) (1990) (1)
- The Logic and Topology of Non-locality and Contextuality (2011) (1)
- Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD) (1991) (1)
- Dynamic game semantics (2016) (1)
- Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042) (2015) (1)
- Arboreal Categories and Homomorphism Preservation Theorems (2022) (1)
- Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Development (CCPSD) (1991) (1)
- Categorical Methods at the Crossroads (Dagstuhl Perspectives Workshop 14182) (2014) (1)
- Information Flow and Its Applications (Dagstuhl Seminar 12352) (2012) (1)
- Visions of Computer Science (2008) (1)
- Special issue dedicated to a selection of papers from Mathematical Foundations of Programming Semantics (MFPS XXV). Theoretical Computer Science 430 (1-2) (2012) (1)
- Algorithmic Game Semantics and its Applications : Final Report (2006) (1)
- Reviewers List (2021) (0)
- Observational Logic and Process Semantics (Abstract) (1989) (0)
- Proceedings of the Tutorial and Workshop on Category Theory and Computer Programming (1985) (0)
- Big toy models (2011) (0)
- Causal structure in categorical quantum mechanics (2012) (0)
- Typed Lambda Calculi and Applications (2003) (0)
- Foreword (2013) (0)
- The regular histories formulation of quantum theory (2012) (0)
- A complete characterisation of All-versus-Nothing arguments on stabilisers (2017) (0)
- Reasoning with !-graphs (2013) (0)
- Categorical Logic Categorical Logic (1995) (0)
- "Contributions to Pointfree Topology and Apartness Spaces" Uppsala Dissertations in Mathematics 71 (2011) (0)
- 05 12 11 4 v 1 15 D ec 2 00 5 A Categorical Quantum Logic (2006) (0)
- Retracing some paths in Process Algebra 1 Introduction 2 The semantic universe : transducers (2007) (0)
- Domain Theory in Logical Form Revisited: A 20 Year Retrospec tive (2007) (0)
- Logic in Computer Science, 2004. Proceedings of the 19th Annual IEEE Symposium on (2004) (0)
- Explorer The Contextual Fraction as a Measure of Contextuality (2017) (0)
- Contextual Semantics : From Quantum Mechanics to Logic , Databases , and Beyond (2014) (0)
- Measurement Scenarios and Empirical Models (2016) (0)
- Contextuality as a Resource for Shallow Circuits (2019) (0)
- The 14th International Conference on Quantum Physics and Logic (QPL) (2017) (0)
- Abstraction for PCF ∗ (0)
- Robin Milner's Work on Concurrency (2010) (0)
- Coalgebraic Semantics of Reflexive Economics (2015) (0)
- A Tale of Dependence and Separation (2008) (0)
- Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218 (2001) (0)
- Mathematical foundations of information flow : Clifford lectures information flow in physics, geometry, logic and computation, March 12-15, 2008, Tulane University, New Orleans, Louisiana (2012) (0)
- Synthese A Positive Information Logic for Inferential Information * (2008) (0)
- Nijmegen, The Netherlands July 27–August 2, 2006 (2007) (0)
- Program Semantics , Verification , and Construction (0)
- The Ackermann Award 2006 (2006) (0)
- Representing physical systems as Chu spaces (2012) (0)
- Minimum resources for strong non-locality (2017) (0)
- Discrete classical vs. continuous quantum data in abstract quantum mechanics (2005) (0)
- Invited Talks at BCTCS 2013 (2014) (0)
- 13th International Conference on Quantum Physics and Logic (QPL 2016) (2016) (0)
- Types, Orthogonality and Genericity: Some Tools for Communicating Process Architectures (2008) (0)
- 1 No-Cloning in Categorical Quantum Mechanics (2015) (0)
- Proceedings of the 4th International Conference on Category Theory and Computer Science (1991) (0)
- Game Semantics: Achievements and Prospects (2000) (0)
- Games, Interaction and Computation (2009) (0)
- What Makes Alan Turing a Great Scientist? - Introduction to the Special Theme (2012) (0)
- Automata, languages and programming : 37th International Colloquium, ICALP 2010 Bordeaux, France, July 6-10, 2010 : proceedings (2010) (0)
- Towards Simplicial Complexes in Homotopy Type Theory (2020) (0)
- Call-by-value Games (extended Abstract) (2007) (0)
- New Orleans Marriott and Sheraton New Orleans Hotels New Orleans, LA January 8–9, 2011 (2012) (0)
- Partial evaluation and MIX compilation in PROLOG (1988) (0)
- Information Flow and Its Applications (2012) (0)
- Typed lambda calculi and applications : 5th International Conference, TLCA 2001, Kraków, Poland, May 2-5, 2001 : proceedings (2001) (0)
- Relational Hidden Variables and Non-Locality (2013) (0)
- Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings (1991) (0)
- Events in context (2014) (0)
- Copy-Cat Strategies and Information Flow in Physics, Geome try, Logic and Computation (2007) (0)
- Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference (2008) (0)
- Proceedings of the 5th international conference on Typed lambda calculi and applications (2001) (0)
- From Lawvere to Brandenburger-Keisler : multi-agent forms of diagonalization and self-reference (2010) (0)
- KM99] GP Kogan and JA Makowsky. Computing Schur functions for Borchardt matrices. in preparation, 1999. Kog96] GP Kogan. Computing the permanent over elds of characteristic 3: Where and why it becomes dificult. In FOCS'96, pages 108 {114. IEEE, 1996 (1996) (0)
- All-versus-nothing arguments ( a ) Mermin ’ s original formulation (2017) (0)
- Foundations of Concurrent Object-Oriented Programming (Panel) (1990) (0)
- Categories As Tools For Building Theories (2012) (0)
- Chapter 2 From CSP to Game Semantics (2019) (0)
- Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II (2010) (0)
- Interactions between Representation Theory , Quantum Field Theory , Category Theory and Quantum Information Theory Abstracts Representing Physical Systems as Chu Spaces (2009) (0)
- Partial Boolean algebras and the logical exclusivity principle (2020) (0)
- Robin Milner's Work on Concurrency: An Appreciation (2022) (0)
- An integrated diagrammatic universe for knowledge , language and artificial reasoning (2018) (0)
- Logic and Geometry of Agents in Agent-Based Modeling (2009) (0)
- Types for Deadlock-freedom: The Synchronous Case (1997) (0)
- Volume 92 Number 2 ( 1991 ) , in the article “ A Domain Equation for Bisimulation (2001) (0)
- A Sheaf Theoretic Approach to Natural Language (2014) (0)
- Anytime Inference in Valuation Algebras (2016) (0)
This paper list is powered by the following services:
Other Resources About Samson Abramsky
What Schools Are Affiliated With Samson Abramsky?
Samson Abramsky is affiliated with the following schools: