Samson Abramsky

223 papers A* 17A 1B 24C 1Journal 115Unranked 45

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Commutation Groups and State-Independent Contextuality. CoRR Samson Abramsky, Serban-Ion Cercelescu, Carmen Maria Constantin
2026	J	`jnl`	Team Semantics and Independence Notions in quantum Physics. Bull. Symb. Log. Samson Abramsky, Joni Puljujärvi, Jouko Väänänen
2025	J	`jnl`	Existential and positive games: a comonadic and axiomatic view. CoRR Samson Abramsky, Thomas Laure, Luca Reggio
2025	J	`jnl`	Open Questions about Time and Self-reference in Living Systems. CoRR Samson Abramsky, Wolfgang Banzhaf, Leo S. D. Caves, Michael Levin, Penousal Machado, Charles Ofria, Susan Stepney, Roger White
2024	J	`jnl`	An Invitation to Game Comonads. ACM SIGLOG News Samson Abramsky, Luca Reggio
2024	J	`jnl`	An invitation to game comonads. CoRR Samson Abramsky, Luca Reggio
2024	J	`jnl`	Arboreal categories and equi-resource homomorphism preservation theorems. Ann. Pure Appl. Log. Samson Abramsky, Luca Reggio
2024	B	`conf`	Commutation Groups and State-Independent Contextuality. FSCD Samson Abramsky, Serban-Ion Cercelescu, Carmen Maria Constantin
2024	J	`jnl`	Game Semantics for Higher-Order Unitary Quantum Computation. CoRR Samson Abramsky, Radha Jagadeesan
2023	J	`jnl`	Arboreal Categories: An Axiomatic Theory of Resources. Log. Methods Comput. Sci. Samson Abramsky, Luca Reggio
2023	J	`jnl`	Combining contextuality and causality: a game semantics approach. CoRR Samson Abramsky, Rui Soares Barbosa, Amy Searle
2023	B	`conf`	Linear Arboreal Categories. MFPS Samson Abramsky, Yoàv Montacute, Nihil Shah
2022	B	`conf`	Comonadic semantics for hybrid logic. MFCS Samson Abramsky, Dan Marsden
2022	—	`conf`	Discrete Density Comonads and Graph Parameters. CMCS Samson Abramsky, Tomas Jakl, Thomas Paine
2022	J	`jnl`	Discrete density comonads and graph parameters. CoRR Samson Abramsky, Tomas Jakl, Thomas Paine
2022	J	`jnl`	Notes on presheaf representations of strategies and cohomological refinements of k-consistency and k-equivalence. CoRR Samson Abramsky
2022	J	`jnl`	Robin Milner's Work on Concurrency: An Appreciation. CoRR Samson Abramsky
2022	J	`jnl`	Structure and Power: an Emerging Landscape. Fundam. Informaticae Samson Abramsky
2022	J	`jnl`	Structure and Power: an emerging landscape. CoRR Samson Abramsky
2021	A*	`conf`	Arboreal Categories and Resources. ICALP Samson Abramsky, Luca Reggio
2021	J	`jnl`	Arboreal Categories: An Axiomatic Theory of Resources. CoRR Samson Abramsky, Luca Reggio
2021	A*	`conf`	Comonadic semantics for guarded fragments. LICS Samson Abramsky, Dan Marsden
2021	J	`jnl`	Comonadic semantics for hybrid logic and bounded fragments. CoRR Samson Abramsky, Dan Marsden
2021	J	`jnl`	On the Quantum-like Contextuality of Ambiguous Phrases. CoRR Daphne Wang, Mehrnoosh Sadrzadeh, Samson Abramsky, Víctor H. Cervantes
2021	J	`jnl`	Relating structure and power: Comonadic semantics for computational resources. J. Log. Comput. Samson Abramsky, Nihil Shah
2021	B	`conf`	The Logic of Contextuality. CSL Samson Abramsky, Rui Soares Barbosa
2020	J	`jnl`	Classical logic, classical probability, and quantum mechanics. CoRR Samson Abramsky
2020	J	`jnl`	Comonadic semantics for guarded fragments. CoRR Samson Abramsky, Dan Marsden
2020	J	`jnl`	Contextuality: At the Borders of Paradox. CoRR Samson Abramsky
2020	J	`jnl`	Dynamic game semantics. Math. Struct. Comput. Sci. Norihiro Yamada, Samson Abramsky
2020	J	`jnl`	Relating Structure and Power: Extended Version. CoRR Samson Abramsky, Nihil Shah
2020	J	`jnl`	The logic of contextuality. CoRR Samson Abramsky, Rui Soares Barbosa
2020	J	`jnl`	Whither Semantics? CoRR Samson Abramsky
2020	J	`jnl`	Whither semantics? Theor. Comput. Sci. Samson Abramsky
2019	A*	`conf`	A comonadic view of simulation and quantum resources. LICS Samson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield
2019	J	`jnl`	A comonadic view of simulation and quantum resources. CoRR Samson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield
2018	J	`jnl`	Game semantics for dependent types. Inf. Comput. Matthijs Vákár, Radha Jagadeesan, Samson Abramsky
2018	—	`conf`	Relating Structure and Power: Comonadic Semantics for Computational Resources - Extended Abstract. CMCS Samson Abramsky, Nihil Shah
2018	B	`conf`	Relating Structure and Power: Comonadic Semantics for Computational Resources. CSL Samson Abramsky, Nihil Shah
2018	J	`jnl`	Relating Structure and Power: Comonadic Semantics for Computational Resources. CoRR Samson Abramsky, Nihil Shah
2017	J	`jnl`	A complete characterisation of All-versus-Nothing arguments for stabiliser states. CoRR Samson Abramsky, Rui Soares Barbosa, Giovanni Carù, Simon Perdrix
2017	J	`jnl`	Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting. Math. Struct. Comput. Sci. Samson Abramsky, Viktor Winschel
2017	J	`jnl`	Intensionality, Definability and Computation. CoRR Samson Abramsky
2017	—	`conf`	Minimum Quantum Resources for Strong Non-Locality. TQC Samson Abramsky, Rui Soares Barbosa, Giovanni Carù, Nadish de Silva, Kohei Kishida, Shane Mansfield
2017	B	`conf`	The Quantum Monad on Relational Structures. MFCS Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata
2017	J	`jnl`	The Quantum Monad on Relational Structures. CoRR Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata
2017	A*	`conf`	The pebbling comonad in Finite Model Theory. LICS Samson Abramsky, Anuj Dawar, Pengming Wang
2017	J	`jnl`	The pebbling comonad in finite model theory. CoRR Samson Abramsky, Anuj Dawar, Pengming Wang
2016	J	`jnl`	Anytime Inference in Valuation Algebras. CoRR Abhishek Dasgupta, Samson Abramsky
2016	—	`book`	Dependence Logic, Theory and Applications Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer
2016	J	`jnl`	Dynamic Games and Strategies. CoRR Norihiro Yamada, Samson Abramsky
2016	J	`jnl`	Hardy is (almost) everywhere: Nonlocality without inequalities for almost all entangled multipartite states. Inf. Comput. Samson Abramsky, Carmen M. Constantin, Shenggang Ying
2016	J	`jnl`	Information, Processes and Games. CoRR Samson Abramsky
2016	—	`ch.`	Introduction. Dependence Logic Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer
2016	J	`jnl`	Possibilities Determine the Combinatorial Structure of Probability Polytopes. CoRR Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield
2016	—	`conf`	Probabilistic Programs: Contextuality and Relational Database Theory. QI Peter D. Bruza, Samson Abramsky
2015	—	`ch.`	Arrow's Theorem by Arrow Theory. Logic Without Borders Samson Abramsky
2015	J	`jnl`	Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042). Dagstuhl Reports Samson Abramsky, Alexander Kurz, Pierre Lescanne, Viktor Winschel
2015	B	`conf`	Contextuality, Cohomology and Paradox. CSL Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield
2015	J	`jnl`	Contextuality, Cohomology and Paradox. CoRR Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield
2015	—	`conf`	DEMONIC programming: a computational language for single-particle equilibrium thermodynamics, and its formal semantics. QPL Samson Abramsky, Dominic Horsman
2015	J	`jnl`	From Lawvere to Brandenburger-Keisler: Interactive forms of diagonalization and self-reference. J. Comput. Syst. Sci. Samson Abramsky, Jonathan A. Zvesper
2015	—	`conf`	Games for Dependent Types. ICALP (2) Samson Abramsky, Radha Jagadeesan, Matthijs Vákár
2015	J	`jnl`	Games for Dependent Types. CoRR Samson Abramsky, Radha Jagadeesan, Matthijs Vákár
2015	J	`jnl`	Process Realizability. CoRR Samson Abramsky
2014	J	`jnl`	An Algebraic Characterisation of Concurrent Composition. CoRR Samson Abramsky
2014	—	`conf`	An Operational Interpretation of Negative Probabilities and No-Signalling Models. Horizons of the Mind Samson Abramsky, Adam Brandenburger
2014	J	`jnl`	Axioms for Definability and Full Completeness. CoRR Samson Abramsky
2014	J	`jnl`	Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity. CoRR Samson Abramsky
2014	J	`jnl`	Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity. Bull. EATCS Samson Abramsky
2014	J	`jnl`	Events in context. Theor. Comput. Sci. Samson Abramsky
2014	J	`jnl`	Game Semantics for Access Control. CoRR Samson Abramsky, Radha Jagadeesan
2014	—	`ch.`	Intensionality, Definability and Computation. Johan van Benthem on Logic and Information Dynamics Samson Abramsky
2014	J	`jnl`	Retracing some paths in Process Algebra. CoRR Samson Abramsky
2014	—	`conf`	Semantic Unification - A Sheaf Theoretic Approach to Natural Language. Categories and Types in Logic, Language, and Physics Samson Abramsky, Mehrnoosh Sadrzadeh
2014	J	`jnl`	Semantic Unification A sheaf theoretic approach to natural language. CoRR Samson Abramsky, Mehrnoosh Sadrzadeh
2014	J	`jnl`	Two Puzzles About Computation. CoRR Samson Abramsky
2014	J	`jnl`	What are the fundamental structures of concurrency? We still don't know! CoRR Samson Abramsky
2013	J	`jnl`	A Game Semantics for Generic Polymorphism. CoRR Samson Abramsky, Radha Jagadeesan
2013	—	`conf`	A classification of multipartite states by degree of non-locality. QPL Samson Abramsky, Carmen M. Constantin
2013	J	`jnl`	Coalgebras, Chu Spaces, and Representations of Physical Systems. J. Philos. Log. Samson Abramsky
2013	J	`jnl`	Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071). Dagstuhl Reports Samson Abramsky, Juha Kontinen, Jouko A. Väänänen, Heribert Vollmer
2013	J	`jnl`	Foreword. Ann. Pure Appl. Log. Samson Abramsky, Dan R. Ghica
2013	J	`jnl`	Full Abstraction for PCF. CoRR Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
2013	J	`jnl`	Games and Full Completeness for Multiplicative Linear Logic. CoRR Samson Abramsky, Radha Jagadeesan
2013	—	`conf`	No-Signalling Is Equivalent To Free Choice of Measurements. QPL Samson Abramsky, Adam Brandenburger, Andrei Savochkin
2013	—	`conf`	Relational Databases and Bell's Theorem. In Search of Elegance in the Theory and Practice of Computation Samson Abramsky
2013	J	`jnl`	Relational Hidden Variables and Non-Locality. Stud Logica Samson Abramsky
2013	A*	`conf`	Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics. IJCAI Samson Abramsky, Georg Gottlob, Phokion G. Kolaitis
2013	J	`jnl`	Semantics of Interaction. CoRR Samson Abramsky
2012	J	`jnl`	Big toy models - Representing physical systems as Chu spaces. Synth. Samson Abramsky
2012	J	`jnl`	Coalgebraic Analysis of Subgame-perfect Equilibria in Infinite Games without Discounting CoRR Samson Abramsky, Viktor Winschel
2012	—	`conf`	From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference. CMCS Samson Abramsky, Jonathan A. Zvesper
2012	—	`conf`	Heterotic Computing Examples with Optics, Bacteria, and Chemicals. UCNC Susan Stepney, Samson Abramsky, Matthias Bechmann, Jerzy Gorecki, Viv Kendon, Thomas J. Naughton, Mario J. Pérez-Jiménez, Francisco José Romero-Campero, Angelika Sebald
2012	J	`jnl`	Information Flow and Its Applications (Dagstuhl Seminar 12352). Dagstuhl Reports Samson Abramsky, Jean Krivine, Michael W. Mislove
2012	J	`jnl`	Logical Bell Inequalities CoRR Samson Abramsky, Lucien Hardy
2012	J	`jnl`	Preface. Theor. Comput. Sci. Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi
2012	J	`jnl`	Relational Databases and Bell's Theorem CoRR Samson Abramsky
2012	J	`jnl`	What Makes Alan Turing a Great Scientist? - Introduction to the Special Theme. ERCIM News Gilles Dowek, Samson Abramsky
2011	J	`jnl`	A Cook's Tour of the Finitary Non-Well-Founded Sets CoRR Samson Abramsky
2011	J	`jnl`	A Generalized Kahn Principle for Abstract Asynchronous Networks CoRR Samson Abramsky
2011	J	`jnl`	A Structural Approach to Reversible Computation CoRR Samson Abramsky
2011	J	`jnl`	A Unified Sheaf-Theoretic Account Of Non-Locality and Contextuality CoRR Samson Abramsky, Adam Brandenburger
2011	J	`jnl`	Domain Theory and the Logic of Observable Properties CoRR Samson Abramsky
2011	J	`jnl`	From IF to BI: a tale of dependence and separation CoRR Samson Abramsky, Jouko A. Väänänen
2011	J	`jnl`	Introduction to Categories and Categorical Logic CoRR Samson Abramsky, Nikos Tzevelekos
2011	J	`jnl`	Sequentiality vs. Concurrency in Games and Logic CoRR Samson Abramsky
2011	—	`conf`	The Cohomology of Non-Locality and Contextuality QPL Samson Abramsky, Shane Mansfield, Rui Soares Barbosa
2011	C	`conf`	The Logic and Topology of Non-locality and Contextuality. UC Samson Abramsky
2010	—	`ed.`	Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I ICALP (1) Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis
2010	—	`ed.`	Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II ICALP (2) Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis
2010	A*	`conf`	Coalgebras, Chu Spaces, and Representations of Physical Systems. LICS Samson Abramsky
2010	—	`ch.`	From CSP to Game Semantics. Reflections on the Work of C. A. R. Hoare Samson Abramsky
2010	J	`jnl`	From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference CoRR Samson Abramsky, Jonathan A. Zvesper
2010	J	`jnl`	Relational Hidden Variables and Non-Locality CoRR Samson Abramsky
2010	B	`conf`	Robin Milner's Work on Concurrency. MFPS Samson Abramsky
2009	J	`jnl`	Abstract Physical Traces CoRR Samson Abramsky, Bob Coecke
2009	J	`jnl`	Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories CoRR Samson Abramsky
2009	J	`jnl`	Big Toy Models: Representing Physical Systems As Chu Spaces CoRR Samson Abramsky
2009	J	`jnl`	Coalgebras, Chu Spaces, and Representations of Physical Systems CoRR Samson Abramsky
2009	J	`jnl`	From IF to BI. Synth. Samson Abramsky, Jouko A. Väänänen
2009	B	`conf`	Game Semantics for Access Control. MFPS Samson Abramsky, Radha Jagadeesan
2009	—	`conf`	Games, Interaction and Computation. Ershov Memorial Conference Samson Abramsky
2009	—	`ch.`	Logic and Geometry of Agents in Agent-Based Modeling. Encyclopedia of Complexity and Systems Science Samson Abramsky
2009	B	`conf`	Preface. MFPS Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi
2009	B	`ed.`	Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, MFPS 2009, Oxford, UK, April 3-7, 2009 MFPS Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi
2008	—	`conf`	Grand Challenge 7: Journeys in Non-Classical Computation. BCS Int. Acad. Conf. Susan Stepney, Samson Abramsky, Andy Adamatzky, Colin G. Johnson, Jon Timmis
2008	—	`conf`	Petri Nets, Discrete Physics, and Distributed Quantum Computation. Concurrency, Graphs and Models Samson Abramsky
2008	—	`conf`	Types, Orthogonality and Genericity: Some Tools for Communicating Process Architectures. CPA Samson Abramsky
2008	—	`ed.`	Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008 BCS Int. Acad. Conf. Erol Gelenbe, Samson Abramsky, Vladimiro Sassone
2007	—	`conf`	Event Domains, Stable Functions and Proof-Nets. Computation, Meaning, and Logic Samson Abramsky
2007	B	`conf`	Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract). CSL Samson Abramsky
2007	—	`conf`	Petri Nets, Discrete Physics, and Distributed Quantum Computation. ICATPN Samson Abramsky
2007	J	`jnl`	Physics from Computer Science: a Position Statement. Int. J. Unconv. Comput. Samson Abramsky, Bob Coecke
2006	J	`jnl`	A categorical quantum logic. Math. Struct. Comput. Sci. Samson Abramsky, Ross Duncan
2006	B	`conf`	The Ackermann Award 2006. CSL Samson Abramsky, Erich Grädel, Johann A. Makowsky
2005	J	`jnl`	A Categorical Quantum Logic CoRR Samson Abramsky, Ross Duncan
2005	—	`conf`	A Cook's Tour of the Finitary Non-Well-Founded Sets. We Will Show Them! (1) Samson Abramsky
2005	J	`jnl`	A game semantics for generic polymorphism. Ann. Pure Appl. Log. Samson Abramsky, Radha Jagadeesan
2005	J	`jnl`	A structural approach to reversible computation. Theor. Comput. Sci. Samson Abramsky
2005	B	`conf`	Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories. CALCO Samson Abramsky
2005	B	`conf`	Algorithmic Game Semantics and Static Analysis. SAS Samson Abramsky
2005	—	`conf`	Discrete classical vs. continuous quantum data in abstract quantum mechanics. Spatial Representation Samson Abramsky, Bob Coecke
2005	J	`jnl`	Game Theory Meets Theoretical Computer Science. Theor. Comput. Sci. Samson Abramsky, Marios Mavronicolas
2005	J	`jnl`	Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Log. Samson Abramsky, Marina Lenisa
2005	—	`conf`	What are the Fundamental Structures of Concurrency?: We still don't know! APC 25 Samson Abramsky
2004	A*	`conf`	A Categorical Semantics of Quantum Protocols. LICS Samson Abramsky, Bob Coecke
2004	J	`jnl`	A categorical semantics of quantum protocols CoRR Samson Abramsky, Bob Coecke
2004	A	`conf`	Applying Game Semantics to Compositional Software Modeling and Verification. TACAS Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
2004	A*	`conf`	High-Level Methods for Quantum Computation and Information. LICS Samson Abramsky
2004	A*	`conf`	Nominal Games and Full Abstraction for the Nu-Calculus. LICS Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian David Bede Stark
2003	B	`conf`	A Game Semantics for Generic Polymorphism. FoSSaCS Samson Abramsky, Radha Jagadeesan
2003	J	`jnl`	Sequentiality vs. Concurrency In Games And Logic. Math. Struct. Comput. Sci. Samson Abramsky
2002	J	`jnl`	Geometry of Interaction and Linear Combinatory Algebras. Math. Struct. Comput. Sci. Samson Abramsky, Esfandiar Haghverdi, Philip J. Scott
2002	J	`jnl`	Physical Traces: Quantum vs. Classical Information Processing CoRR Samson Abramsky, Bob Coecke
2002	—	`conf`	Physical Traces: Quantum vs. Classical Information Processing. CTCS Samson Abramsky, Bob Coecke
2001	J	`jnl`	A fully abstract denotational semantics for the calculus of higher-order communicating systems. Theor. Comput. Sci. Bent Thomsen, Samson Abramsky
2001	J	`jnl`	Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218. Inf. Comput. Samson Abramsky, Luca Aceto, Anna Ingólfsdóttir
2001	B	`conf`	Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. CSL Samson Abramsky, Marina Lenisa
2001	—	`ed.`	Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings. TLCA Samson Abramsky
2000	B	`conf`	A Fully Complete PER Model for ML Polymorphic Types. CSL Samson Abramsky, Marina Lenisa
2000	B	`conf`	Axiomatizing Fully Complete Models for ML Polymorphic Types. MFCS Samson Abramsky, Marina Lenisa
2000	—	`conf`	Axioms for definability and full completeness. Proof, Language, and Interaction Samson Abramsky
2000	J	`jnl`	Full Abstraction for PCF. Inf. Comput. Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
2000	A*	`conf`	Game Semantics: Achievements and Prospects. ICALP Samson Abramsky
2000	—	`book`	Handbook of logic in computer science. Volume 5. Logic and Algebraic Methods. Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum
1999	J	`jnl`	A Specification Structure for Deadlock-Freedom of Synchronous Processes. Theor. Comput. Sci. Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
1999	A*	`conf`	Concurrent Games and Full Completeness. LICS Samson Abramsky, Paul-André Melliès
1999	J	`jnl`	Full Abstraction for Idealized Algol with Passive Expressions. Theor. Comput. Sci. Samson Abramsky, Guy McCusker
1999	—	`conf`	Process Realizability. Realizability Semantics and Applications@FLoC Samson Abramsky
1998	A*	`conf`	A Fully Abstract Game Semantics for General References. LICS Samson Abramsky, Kohei Honda, Guy McCusker
1997	—	`conf`	A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems. TACS Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
1997	B	`conf`	Call-by-Value Games. CSL Samson Abramsky, Guy McCusker
1997	B	`conf`	Game Semantics for Programming Languages (Abstract). MFCS Samson Abramsky
1997	—	`conf`	Specifying Interaction Categories. Category Theory and Computer Science Dusko Pavlovic, Samson Abramsky
1996	—	`conf`	Interaction categories and the foundations of typed concurrent programming. NATO ASI DPD Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
1996	—	`conf`	Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. Linear Logic Tokyo Meeting Samson Abramsky, Guy McCusker
1996	B	`conf`	Retracing Some Paths in Process Algebra. CONCUR Samson Abramsky
1996	—	`conf`	Semantics of Interaction (Abstract). CAAP Samson Abramsky
1995	A*	`conf`	Games and Full Abstraction for the Lazy lambda-Calculus LICS Samson Abramsky, Guy McCusker
1995	—	`book`	Handbook of logic in computer science. Volume 4. Semantic modelling. Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum
1995	—	`conf`	Specification Structures and Propositions-as-Types for Concurrency. Banff Higher Order Workshop Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
1994	—	`conf`	Full Abstraction for PCF. TACS Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan
1994	J	`jnl`	Games and Full Completeness for Multiplicative Linear Logic. J. Symb. Log. Samson Abramsky, Radha Jagadeesan
1994	—	`conf`	Games for Recursive Types. Theory and Formal Methods Samson Abramsky, Guy McCusker
1994	—	`book`	Handbook of logic in computer science. Volume 3. Semantic Structures. Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum
1994	J	`jnl`	New Foundations for the Geometry of Interaction Inf. Comput. Samson Abramsky, Radha Jagadeesan
1994	J	`jnl`	Proofs as Processes. Theor. Comput. Sci. Samson Abramsky
1993	J	`jnl`	An Integrated Engineering Study Scheme in Computing. Comput. J. Anthony Finkelstein, Jeff Kramer, Samson Abramsky, Krysia Broda, Sophia Drossopoulou, Susan Eisenbach
1993	—	`conf`	An Internal Language for Autonomous Categories. Theory and Formal Methods Ian Mackie, Leopoldo Román, Samson Abramsky
1993	J	`jnl`	An internal language for autonomous categories. Appl. Categorical Struct. Ian Mackie, Leopoldo Román, Samson Abramsky
1993	J	`jnl`	Computational Interpretations of Linear Logic. Theor. Comput. Sci. Samson Abramsky
1993	J	`jnl`	Full Abstraction in the Lazy Lambda Calculus Inf. Comput. Samson Abramsky, C.-H. Luke Ong
1993	—	`conf`	Interaction Categories. Theory and Formal Methods Samson Abramsky
1993	J	`jnl`	Quantales, Observational Logic and Process Semantics. Math. Struct. Comput. Sci. Samson Abramsky, Steven Vickers
1992	—	`conf`	Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract). FSTTCS Samson Abramsky, Radha Jagadeesan
1992	—	`book`	Handbook of logic in computer science. Volume 1. Background: Mathematical structures. Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum
1992	—	`book`	Handbook of logic in computer science. Volume 2. Background: Computational structures. Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum
1992	A*	`conf`	New Foundations for the Geometry of Interaction LICS Samson Abramsky, Radha Jagadeesan
1991	J	`jnl`	A Domain Equation for Bisimulation Inf. Comput. Samson Abramsky
1991	A*	`conf`	A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions. POPL Samson Abramsky, Thomas P. Jensen
1991	—	`ed.`	Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings CTCS David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné, David E. Rydeheard
1991	J	`jnl`	Domain Theory in Logical Form. Ann. Pure Appl. Log. Samson Abramsky
1991	—	`ed.`	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) TAPSOFT, Vol.1 Samson Abramsky, T. S. E. Maibaum
1991	—	`ed.`	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) TAPSOFT, Vol.2 Samson Abramsky, T. S. E. Maibaum
1990	J	`jnl`	Abstract Interpretation, Logical Relations and Kan Extensions. J. Log. Comput. Samson Abramsky
1990	—	`conf`	Foundations of Concurrent Object-Oriented Programming (Panel). OOPSLA/ECOOP Gul Agha, Samson Abramsky, Carl Hewitt, Robin Milner, Peter Wegner, Akinori Yonezawa
1990	—	`conf`	Foundations of object-based concurrent programming (panel session). OOPSLA/ECOOP Addendum Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky
1990	—	`conf`	OOPSLA panel on object-based concurrent programming. OOPSLA/ECOOP Workshop on Object-based Concurrent Programming Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky
1989	B	`conf`	A Generalized Kahn Principle for Abstract Asynchronous Networks. Mathematical Foundations of Programming Semantics Samson Abramsky
1989	—	`conf`	Observational Logic and Process Semantics (Abstract). Logic at Botik Samson Abramsky
1988	J	`jnl`	Mixed Computation of Prolog Programs. New Gener. Comput. David A. Fuller, Samson Abramsky
1987	—	`book`	Abstract Interpretation of Declarative Languages Samson Abramsky, Chris Hankin
1987	A*	`conf`	Domain Theory in Logical Form LICS Samson Abramsky
1987	J	`jnl`	Observation Equivalence as a Testing Equivalence. Theor. Comput. Sci. Samson Abramsky
1986	—	`ed.`	Category Theory and Computer Programming, Tutorial and Workshop, Guildford, UK, September 16-20, 1985 Proceedings CTCS David H. Pitt, Samson Abramsky, Axel Poigné, David E. Rydeheard
1986	J	`jnl`	Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky
1985	—	`conf`	Introduction. CTCS Samson Abramsky
1985	—	`conf`	Secd-m: a Virtual Machine for Applicative Programming. FPCA Samson Abramsky, R. Sykes
1985	—	`conf`	Strictness analysis and polymorphic invariance. Programs as Data Objects Samson Abramsky
1985	—	`conf`	The theory of strictness analysis for higher order functions. Programs as Data Objects Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky
1983	B	`conf`	Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. FCT Samson Abramsky
1983	A*	`conf`	On Semantic Foundations for Applicative Multiprogramming. ICALP Samson Abramsky