Samson Abramsky

According to our database1, Samson Abramsky authored at least 134 papers between 1983 and 2020.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2014, "For contributions to domains in logical form, game semantics, categorical quantum mechanics, and contextual semantics.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Whither semantics?
Theor. Comput. Sci., 2020

2019
A comonadic view of simulation and quantum resources.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
Game semantics for dependent types.
Inf. Comput., 2018

Relating Structure and Power: Comonadic Semantics for Computational Resources.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Relating Structure and Power: Comonadic Semantics for Computational Resources - Extended Abstract.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017
Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting.
Mathematical Structures in Computer Science, 2017

A complete characterisation of All-versus-Nothing arguments for stabiliser states.
CoRR, 2017

Intensionality, Definability and Computation.
CoRR, 2017

Minimum Quantum Resources for Strong Non-Locality.
Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

The Quantum Monad on Relational Structures.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

The pebbling comonad in Finite Model Theory.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Hardy is (almost) everywhere: Nonlocality without inequalities for almost all entangled multipartite states.
Inf. Comput., 2016

Dynamic Games and Strategies.
CoRR, 2016

Anytime Inference in Valuation Algebras.
CoRR, 2016

Possibilities Determine the Combinatorial Structure of Probability Polytopes.
CoRR, 2016

Information, Processes and Games.
CoRR, 2016

Probabilistic Programs: Contextuality and Relational Database Theory.
Proceedings of the Quantum Interaction - 10th International Conference, 2016

Introduction.
Proceedings of the Dependence Logic, Theory and Applications, 2016

2015
From Lawvere to Brandenburger-Keisler: Interactive forms of diagonalization and self-reference.
J. Comput. Syst. Sci., 2015

Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042).
Dagstuhl Reports, 2015

DEMONIC programming: a computational language for single-particle equilibrium thermodynamics, and its formal semantics.
Proceedings of the Proceedings 12th International Workshop on Quantum Physics and Logic, 2015

Games for Dependent Types.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Contextuality, Cohomology and Paradox.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Arrow's Theorem by Arrow Theory.
Proceedings of the Logic Without Borders, 2015

2014
Events in context.
Theor. Comput. Sci., 2014

Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity.
Bulletin of the EATCS, 2014

An Algebraic Characterisation of Concurrent Composition.
CoRR, 2014

Two Puzzles About Computation.
CoRR, 2014

Semantic Unification - A Sheaf Theoretic Approach to Natural Language.
Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

An Operational Interpretation of Negative Probabilities and No-Signalling Models.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

Intensionality, Definability and Computation.
Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2013
Relational Hidden Variables and Non-Locality.
Studia Logica, 2013

Coalgebras, Chu Spaces, and Representations of Physical Systems.
J. Philosophical Logic, 2013

Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071).
Dagstuhl Reports, 2013

Semantics of Interaction.
CoRR, 2013

Foreword.
Ann. Pure Appl. Logic, 2013

Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics.
Proceedings of the IJCAI 2013, 2013

Relational Databases and Bell's Theorem.
Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

2012
Big toy models - Representing physical systems as Chu spaces.
Synthese, 2012

What Makes Alan Turing a Great Scientist? - Introduction to the Special Theme.
ERCIM News, 2012

Information Flow and Its Applications (Dagstuhl Seminar 12352).
Dagstuhl Reports, 2012

Logical Bell Inequalities
CoRR, 2012

Heterotic Computing Examples with Optics, Bacteria, and Chemicals.
Proceedings of the Unconventional Computation and Natural Computation, 2012

2011
Domain Theory and the Logic of Observable Properties
CoRR, 2011

The Cohomology of Non-Locality and Contextuality
Proceedings of the Proceedings 8th International Workshop on Quantum Physics and Logic, 2011

From IF to BI: a tale of dependence and separation
CoRR, 2011

Introduction to Categories and Categorical Logic
CoRR, 2011

A Unified Sheaf-Theoretic Account Of Non-Locality and Contextuality
CoRR, 2011

The Logic and Topology of Non-locality and Contextuality.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

2010
Robin Milner's Work on Concurrency.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

From CSP to Game Semantics.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009
Logic and Geometry of Agents in Agent-Based Modeling.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

From IF to BI.
Synthese, 2009

Preface.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Game Semantics for Access Control.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Abstract Physical Traces
CoRR, 2009

Games, Interaction and Computation.
Proceedings of the Perspectives of Systems Informatics, 2009

2008
Types, Orthogonality and Genericity: Some Tools for Communicating Process Architectures.
Proceedings of the thirty-first Communicating Process Architectures Conference, 2008

Grand Challenge 7: Journeys in Non-Classical Computation.
Proceedings of the Visions of Computer Science, 2008

2007
Physics from Computer Science: a Position Statement.
IJUC, 2007

Event Domains, Stable Functions and Proof-Nets.
Electr. Notes Theor. Comput. Sci., 2007

Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract).
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Petri Nets, Discrete Physics, and Distributed Quantum Computation.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
A categorical quantum logic.
Mathematical Structures in Computer Science, 2006

What are the Fundamental Structures of Concurrency?: We still don't know!
Electr. Notes Theor. Comput. Sci., 2006

The Ackermann Award 2006.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Game Theory Meets Theoretical Computer Science.
Theor. Comput. Sci., 2005

A structural approach to reversible computation.
Theor. Comput. Sci., 2005

Linear realizability and full completeness for typed lambda-calculi.
Ann. Pure Appl. Logic, 2005

A game semantics for generic polymorphism.
Ann. Pure Appl. Logic, 2005

Algorithmic Game Semantics and Static Analysis.
Proceedings of the Static Analysis, 12th International Symposium, 2005

Discrete classical vs. continuous quantum data in abstract quantum mechanics.
Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

A Cook's Tour of the Finitary Non-Well-Founded Sets.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004
Applying Game Semantics to Compositional Software Modeling and Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Nominal Games and Full Abstraction for the Nu-Calculus.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

A Categorical Semantics of Quantum Protocols.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

High-Level Methods for Quantum Computation and Information.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003
Sequentiality vs. Concurrency In Games And Logic.
Mathematical Structures in Computer Science, 2003

2002
Geometry of Interaction and Linear Combinatory Algebras.
Mathematical Structures in Computer Science, 2002

Physical Traces: Quantum vs. Classical Information Processing.
Proceedings of the Category Theory and Computer Science, 2002

2001
A fully abstract denotational semantics for the calculus of higher-order communicating systems.
Theor. Comput. Sci., 2001

Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218.
Inf. Comput., 2001

Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
Full Abstraction for PCF.
Inf. Comput., 2000

Axiomatizing Fully Complete Models for ML Polymorphic Types.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Game Semantics: Achievements and Prospects.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

A Fully Complete PER Model for ML Polymorphic Types.
Proceedings of the Computer Science Logic, 2000

Axioms for definability and full completeness.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
Full Abstraction for Idealized Algol with Passive Expressions.
Theor. Comput. Sci., 1999

A Specification Structure for Deadlock-Freedom of Synchronous Processes.
Theor. Comput. Sci., 1999

Process Realizability.
Electr. Notes Theor. Comput. Sci., 1999

Concurrent Games and Full Completeness.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
A Fully Abstract Game Semantics for General References.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Game Semantics for Programming Languages (Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Specifying Interaction Categories.
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

Call-by-Value Games.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions.
Electr. Notes Theor. Comput. Sci., 1996

Interaction categories and the foundations of typed concurrent programming.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996

Retracing Some Paths in Process Algebra.
Proceedings of the CONCUR '96, 1996

Semantics of Interaction (Abstract).
Proceedings of the Trees in Algebra and Programming, 1996

1995
Games and Full Abstraction for the Lazy lambda-Calculus
Proceedings of the Proceedings, 1995

Specification Structures and Propositions-as-Types for Concurrency.
Proceedings of the Logics for Concurrency, 1995

Handbook of logic in computer science, 4 Semantic modellin.
Clarendon Press, ISBN: 0198537808, 1995

1994
New Foundations for the Geometry of Interaction
Inf. Comput., May, 1994

Proofs as Processes.
Theor. Comput. Sci., 1994

Games and Full Completeness for Multiplicative Linear Logic.
J. Symb. Log., 1994

Games for Recursive Types.
Proceedings of the Proceedings for the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, 1994

Handbook of logic in computer science.
Clarendon Press, ISBN: 019853762X, 1994

1993
Full Abstraction in the Lazy Lambda Calculus
Inf. Comput., August, 1993

Computational Interpretations of Linear Logic.
Theor. Comput. Sci., 1993

Quantales, Observational Logic and Process Semantics.
Mathematical Structures in Computer Science, 1993

An Integrated Engineering Study Scheme in Computing.
Comput. J., 1993

An internal language for autonomous categories.
Applied Categorical Structures, 1993

Interaction Categories.
Proceedings of the Theory and Formal Methods 1993, 1993

1992
Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991
A Domain Equation for Bisimulation
Inf. Comput., June, 1991

OOPSLA panel on object-based concurrent programming.
OOPS Messenger, 1991

Domain Theory in Logical Form.
Ann. Pure Appl. Logic, 1991

A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

1990
Abstract Interpretation, Logical Relations and Kan Extensions.
J. Log. Comput., 1990

Foundations of Concurrent Object-Oriented Programming (Panel).
Proceedings of the Conference on Object-Oriented Programming Systems, 1990

1989
A Generalized Kahn Principle for Abstract Asynchronous Networks.
Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

Observational Logic and Process Semantics (Abstract).
Proceedings of the Logic at Botik '89, 1989

1988
Mixed Computation of Prolog Programs.
New Generation Comput., 1988

1987
Observation Equivalence as a Testing Equivalence.
Theor. Comput. Sci., 1987

1986
Strictness Analysis for Higher-Order Functions.
Sci. Comput. Program., 1986

1985
The theory of strictness analysis for higher order functions.
Proceedings of the Programs as Data Objects, 1985

Strictness analysis and polymorphic invariance.
Proceedings of the Programs as Data Objects, 1985

Secd-m: a Virtual Machine for Applicative Programming.
Proceedings of the Functional Programming Languages and Computer Architecture, 1985

Introduction.
Proceedings of the Category Theory and Computer Programming, 1985

1983
On Semantic Foundations for Applicative Multiprogramming.
Proceedings of the Automata, 1983

Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming.
Proceedings of the Fundamentals of Computation Theory, 1983


  Loading...