default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamson Abramsky
Person information
- affiliation: University College London, UK
- affiliation (former): University of Oxford, UK
- affiliation (former): University of Edinburgh, Scotland, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j46]Samson Abramsky, Luca Reggio
:
Arboreal categories and equi-resource homomorphism preservation theorems. Ann. Pure Appl. Log. 175(6): 103423 (2024)- [j45]Samson Abramsky, Luca Reggio:
An Invitation to Game Comonads. ACM SIGLOG News 11(3): 5-48 (2024) - [c85]Samson Abramsky, Serban-Ion Cercelescu, Carmen-Maria Constantin:
Commutation Groups and State-Independent Contextuality. FSCD 2024: 28:1-28:20 - [i67]Samson Abramsky, Radha Jagadeesan:
Game Semantics for Higher-Order Unitary Quantum Computation. CoRR abs/2404.06646 (2024) - [i66]Samson Abramsky, Luca Reggio:
An invitation to game comonads. CoRR abs/2407.00606 (2024) - 2023
- [j44]Samson Abramsky, Luca Reggio:
Arboreal Categories: An Axiomatic Theory of Resources. Log. Methods Comput. Sci. 19(3) (2023) - [i65]Samson Abramsky, Yoàv Montacute, Nihil Shah:
Linear Arboreal Categories. CoRR abs/2301.10088 (2023) - [i64]Samson Abramsky, Rui Soares Barbosa, Amy Searle:
Combining contextuality and causality: a game semantics approach. CoRR abs/2307.04786 (2023) - 2022
- [j43]Samson Abramsky:
Structure and Power: an Emerging Landscape. Fundam. Informaticae 186(1-4): 1-26 (2022) - [c84]Samson Abramsky, Tomas Jakl, Thomas Paine:
Discrete Density Comonads and Graph Parameters. CMCS 2022: 23-44 - [c83]Samson Abramsky, Dan Marsden:
Comonadic semantics for hybrid logic. MFCS 2022: 7:1-7:14 - [i63]Samson Abramsky, Tomas Jakl, Thomas Paine:
Discrete density comonads and graph parameters. CoRR abs/2205.06589 (2022) - [i62]Samson Abramsky:
Structure and Power: an emerging landscape. CoRR abs/2206.07393 (2022) - [i61]Samson Abramsky:
Robin Milner's Work on Concurrency: An Appreciation. CoRR abs/2206.09250 (2022) - [i60]Samson Abramsky:
Notes on presheaf representations of strategies and cohomological refinements of k-consistency and k-equivalence. CoRR abs/2206.12156 (2022) - 2021
- [j42]Samson Abramsky, Nihil Shah:
Relating structure and power: Comonadic semantics for computational resources. J. Log. Comput. 31(6): 1390-1428 (2021) - [c82]Samson Abramsky, Rui Soares Barbosa:
The Logic of Contextuality. CSL 2021: 5:1-5:18 - [c81]Samson Abramsky, Luca Reggio:
Arboreal Categories and Resources. ICALP 2021: 115:1-115:20 - [c80]Samson Abramsky, Dan Marsden:
Comonadic semantics for guarded fragments. LICS 2021: 1-13 - [i59]Samson Abramsky, Luca Reggio:
Arboreal Categories: An Axiomatic Theory of Resources. CoRR abs/2102.08109 (2021) - [i58]Daphne Wang, Mehrnoosh Sadrzadeh, Samson Abramsky, Víctor H. Cervantes:
On the Quantum-like Contextuality of Ambiguous Phrases. CoRR abs/2107.14589 (2021) - [i57]Samson Abramsky, Dan Marsden:
Comonadic semantics for hybrid logic and bounded fragments. CoRR abs/2110.09844 (2021) - 2020
- [j41]Norihiro Yamada, Samson Abramsky:
Dynamic game semantics. Math. Struct. Comput. Sci. 30(8): 892-951 (2020) - [j40]Samson Abramsky:
Whither semantics? Theor. Comput. Sci. 807: 3-14 (2020) - [i56]Samson Abramsky, Dan Marsden:
Comonadic semantics for guarded fragments. CoRR abs/2008.11094 (2020) - [i55]Samson Abramsky, Nihil Shah:
Relating Structure and Power: Extended Version. CoRR abs/2010.06496 (2020) - [i54]Samson Abramsky:
Classical logic, classical probability, and quantum mechanics. CoRR abs/2010.13326 (2020) - [i53]Samson Abramsky:
Whither Semantics? CoRR abs/2010.13328 (2020) - [i52]Samson Abramsky, Rui Soares Barbosa:
The logic of contextuality. CoRR abs/2011.03064 (2020) - [i51]Samson Abramsky:
Contextuality: At the Borders of Paradox. CoRR abs/2011.04899 (2020)
2010 – 2019
- 2019
- [c79]Samson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield:
A comonadic view of simulation and quantum resources. LICS 2019: 1-12 - [i50]Samson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield:
A comonadic view of simulation and quantum resources. CoRR abs/1904.10035 (2019) - 2018
- [j39]Matthijs Vákár, Radha Jagadeesan, Samson Abramsky:
Game semantics for dependent types. Inf. Comput. 261: 401-431 (2018) - [c78]Samson Abramsky, Nihil Shah:
Relating Structure and Power: Comonadic Semantics for Computational Resources - Extended Abstract. CMCS 2018: 1-5 - [c77]Samson Abramsky, Nihil Shah:
Relating Structure and Power: Comonadic Semantics for Computational Resources. CSL 2018: 2:1-2:17 - [i49]Samson Abramsky, Nihil Shah:
Relating Structure and Power: Comonadic Semantics for Computational Resources. CoRR abs/1806.09031 (2018) - 2017
- [j38]Samson Abramsky, Viktor Winschel:
Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting. Math. Struct. Comput. Sci. 27(5): 751-761 (2017) - [c76]Samson Abramsky, Anuj Dawar, Pengming Wang:
The pebbling comonad in Finite Model Theory. LICS 2017: 1-12 - [c75]Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata:
The Quantum Monad on Relational Structures. MFCS 2017: 35:1-35:19 - [c74]Samson Abramsky, Rui Soares Barbosa, Giovanni Carù, Nadish de Silva, Kohei Kishida, Shane Mansfield:
Minimum Quantum Resources for Strong Non-Locality. TQC 2017: 9:1-9:20 - [i48]Samson Abramsky, Anuj Dawar, Pengming Wang:
The pebbling comonad in finite model theory. CoRR abs/1704.05124 (2017) - [i47]Samson Abramsky:
Intensionality, Definability and Computation. CoRR abs/1705.04744 (2017) - [i46]Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata:
The Quantum Monad on Relational Structures. CoRR abs/1705.07310 (2017) - [i45]Samson Abramsky, Rui Soares Barbosa, Giovanni Carù, Simon Perdrix:
A complete characterisation of All-versus-Nothing arguments for stabiliser states. CoRR abs/1705.08459 (2017) - 2016
- [j37]Samson Abramsky, Carmen M. Constantin, Shenggang Ying:
Hardy is (almost) everywhere: Nonlocality without inequalities for almost all entangled multipartite states. Inf. Comput. 250: 3-14 (2016) - [c73]Peter D. Bruza, Samson Abramsky:
Probabilistic Programs: Contextuality and Relational Database Theory. QI 2016: 163-174 - [p4]Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Introduction. Dependence Logic 2016: 1-3 - [e11]Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Dependence Logic, Theory and Applications. Springer 2016, ISBN 978-3-319-31801-1 [contents] - [i44]Norihiro Yamada, Samson Abramsky:
Dynamic Games and Strategies. CoRR abs/1601.04147 (2016) - [i43]Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield:
Possibilities Determine the Combinatorial Structure of Probability Polytopes. CoRR abs/1603.07735 (2016) - [i42]Samson Abramsky:
Information, Processes and Games. CoRR abs/1604.02603 (2016) - [i41]Abhishek Dasgupta, Samson Abramsky:
Anytime Inference in Valuation Algebras. CoRR abs/1605.04218 (2016) - 2015
- [j36]Samson Abramsky, Jonathan A. Zvesper:
From Lawvere to Brandenburger-Keisler: Interactive forms of diagonalization and self-reference. J. Comput. Syst. Sci. 81(5): 799-812 (2015) - [c72]Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield:
Contextuality, Cohomology and Paradox. CSL 2015: 211-228 - [c71]Samson Abramsky, Radha Jagadeesan, Matthijs Vákár:
Games for Dependent Types. ICALP (2) 2015: 31-43 - [c70]Samson Abramsky, Dominic Horsman:
DEMONIC programming: a computational language for single-particle equilibrium thermodynamics, and its formal semantics. QPL 2015: 1-16 - [p3]Samson Abramsky:
Arrow's Theorem by Arrow Theory. Logic Without Borders 2015: 15-30 - [i40]Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield:
Contextuality, Cohomology and Paradox. CoRR abs/1502.03097 (2015) - [i39]Samson Abramsky, Radha Jagadeesan, Matthijs Vákár:
Games for Dependent Types. CoRR abs/1508.05023 (2015) - [i38]Samson Abramsky:
Process Realizability. CoRR abs/1512.06233 (2015) - [i37]Samson Abramsky, Alexander Kurz, Pierre Lescanne, Viktor Winschel:
Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042). Dagstuhl Reports 5(1): 197-206 (2015) - 2014
- [j35]Samson Abramsky:
Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity. Bull. EATCS 113 (2014) - [j34]Samson Abramsky:
Events in context. Theor. Comput. Sci. 546: 7-9 (2014) - [c69]Samson Abramsky, Mehrnoosh Sadrzadeh:
Semantic Unification - A Sheaf Theoretic Approach to Natural Language. Categories and Types in Logic, Language, and Physics 2014: 1-13 - [c68]Samson Abramsky, Adam Brandenburger:
An Operational Interpretation of Negative Probabilities and No-Signalling Models. Horizons of the Mind 2014: 59-75 - [p2]Samson Abramsky:
Intensionality, Definability and Computation. Johan van Benthem on Logic and Information Dynamics 2014: 121-142 - [i36]Samson Abramsky:
Axioms for Definability and Full Completeness. CoRR abs/1401.4735 (2014) - [i35]Samson Abramsky:
What are the fundamental structures of concurrency? We still don't know! CoRR abs/1401.4973 (2014) - [i34]Samson Abramsky:
Retracing some paths in Process Algebra. CoRR abs/1401.5113 (2014) - [i33]Samson Abramsky, Radha Jagadeesan:
Game Semantics for Access Control. CoRR abs/1401.5325 (2014) - [i32]Samson Abramsky, Mehrnoosh Sadrzadeh:
Semantic Unification A sheaf theoretic approach to natural language. CoRR abs/1403.3351 (2014) - [i31]Samson Abramsky:
Two Puzzles About Computation. CoRR abs/1403.4880 (2014) - [i30]Samson Abramsky:
An Algebraic Characterisation of Concurrent Composition. CoRR abs/1406.1965 (2014) - [i29]Samson Abramsky:
Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity. CoRR abs/1406.7386 (2014) - 2013
- [j33]Samson Abramsky, Dan R. Ghica:
Foreword. Ann. Pure Appl. Log. 164(11): 1037 (2013) - [j32]Samson Abramsky:
Coalgebras, Chu Spaces, and Representations of Physical Systems. J. Philos. Log. 42(3): 551-574 (2013) - [j31]Samson Abramsky:
Relational Hidden Variables and Non-Locality. Stud Logica 101(2): 411-452 (2013) - [c67]Samson Abramsky:
Relational Databases and Bell's Theorem. In Search of Elegance in the Theory and Practice of Computation 2013: 13-35 - [c66]Samson Abramsky, Georg Gottlob, Phokion G. Kolaitis:
Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics. IJCAI 2013: 440-446 - [c65]Samson Abramsky, Adam Brandenburger, Andrei Savochkin:
No-Signalling Is Equivalent To Free Choice of Measurements. QPL 2013: 1-9 - [c64]Samson Abramsky, Carmen M. Constantin:
A classification of multipartite states by degree of non-locality. QPL 2013: 10-25 - [i28]Samson Abramsky, Radha Jagadeesan:
Games and Full Completeness for Multiplicative Linear Logic. CoRR abs/1311.6057 (2013) - [i27]Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria:
Full Abstraction for PCF. CoRR abs/1311.6125 (2013) - [i26]Samson Abramsky:
Semantics of Interaction. CoRR abs/1312.0121 (2013) - [i25]Samson Abramsky, Radha Jagadeesan:
A Game Semantics for Generic Polymorphism. CoRR abs/1312.1120 (2013) - [i24]Samson Abramsky, Juha Kontinen, Jouko A. Väänänen, Heribert Vollmer:
Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071). Dagstuhl Reports 3(2): 45-54 (2013) - 2012
- [j30]Samson Abramsky:
Big toy models - Representing physical systems as Chu spaces. Synth. 186(3): 697-718 (2012) - [j29]Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi:
Preface. Theor. Comput. Sci. 430: 1-2 (2012) - [c63]Samson Abramsky, Jonathan A. Zvesper:
From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference. CMCS 2012: 1-19 - [c62]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:
Heterotic Computing Examples with Optics, Bacteria, and Chemicals. UCNC 2012: 198-209 - [i23]Samson Abramsky, Lucien Hardy:
Logical Bell Inequalities. CoRR abs/1203.1352 (2012) - [i22]Samson Abramsky:
Relational Databases and Bell's Theorem. CoRR abs/1208.6416 (2012) - [i21]Samson Abramsky, Viktor Winschel:
Coalgebraic Analysis of Subgame-perfect Equilibria in Infinite Games without Discounting. CoRR abs/1210.4537 (2012) - [i20]Samson Abramsky, Jean Krivine, Michael W. Mislove:
Information Flow and Its Applications (Dagstuhl Seminar 12352). Dagstuhl Reports 2(8): 99-112 (2012) - [i19]Gilles Dowek, Samson Abramsky:
What Makes Alan Turing a Great Scientist? - Introduction to the Special Theme. ERCIM News 2012(91) (2012) - 2011
- [c61]Samson Abramsky:
The Logic and Topology of Non-locality and Contextuality. UC 2011: 1 - [c60]Samson Abramsky, Shane Mansfield, Rui Soares Barbosa:
The Cohomology of Non-Locality and Contextuality. QPL 2011: 1-14 - [i18]Samson Abramsky, Adam Brandenburger:
A Unified Sheaf-Theoretic Account Of Non-Locality and Contextuality. CoRR abs/1102.0264 (2011) - [i17]Samson Abramsky, Nikos Tzevelekos:
Introduction to Categories and Categorical Logic. CoRR abs/1102.1313 (2011) - [i16]Samson Abramsky, Jouko A. Väänänen:
From IF to BI: a tale of dependence and separation. CoRR abs/1102.1388 (2011) - [i15]Samson Abramsky:
A Cook's Tour of the Finitary Non-Well-Founded Sets. CoRR abs/1111.7148 (2011) - [i14]Samson Abramsky:
A Structural Approach to Reversible Computation. CoRR abs/1111.7154 (2011) - [i13]Samson Abramsky:
Sequentiality vs. Concurrency in Games and Logic. CoRR abs/1111.7159 (2011) - [i12]Samson Abramsky:
Domain Theory and the Logic of Observable Properties. CoRR abs/1112.0347 (2011) - [i11]Samson Abramsky:
A Generalized Kahn Principle for Abstract Asynchronous Networks. CoRR abs/1112.0427 (2011) - 2010
- [c59]Samson Abramsky:
Coalgebras, Chu Spaces, and Representations of Physical Systems. LICS 2010: 411-420 - [c58]Samson Abramsky:
Robin Milner's Work on Concurrency. MFPS 2010: 5-10 - [p1]Samson Abramsky:
From CSP to Game Semantics. Reflections on the Work of C. A. R. Hoare 2010: 33-45 - [e10]Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis:
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Lecture Notes in Computer Science 6198, Springer 2010, ISBN 978-3-642-14164-5 [contents] - [e9]Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis:
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6199, Springer 2010, ISBN 978-3-642-14161-4 [contents] - [i10]Samson Abramsky, Jonathan A. Zvesper:
From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference. CoRR abs/1006.0992 (2010) - [i9]Samson Abramsky:
Relational Hidden Variables and Non-Locality. CoRR abs/1007.2754 (2010)
2000 – 2009
- 2009
- [j28]Samson Abramsky, Jouko A. Väänänen:
From IF to BI. Synth. 167(2): 207-230 (2009) - [c57]Samson Abramsky:
Games, Interaction and Computation. Ershov Memorial Conference 2009: 1 - [c56]Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi:
Preface. MFPS 2009: 1-2 - [c55]Samson Abramsky, Radha Jagadeesan:
Game Semantics for Access Control. MFPS 2009: 135-156 - [e8]Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi:
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, MFPS 2009, Oxford, UK, April 3-7, 2009. Electronic Notes in Theoretical Computer Science 249, Elsevier 2009 [contents] - [r1]Samson Abramsky:
Logic and Geometry of Agents in Agent-Based Modeling. Encyclopedia of Complexity and Systems Science 2009: 5286-5299 - [i8]Samson Abramsky:
Big Toy Models: Representing Physical Systems As Chu Spaces. CoRR abs/0910.2393 (2009) - [i7]Samson Abramsky:
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories. CoRR abs/0910.2931 (2009) - [i6]Samson Abramsky, Bob Coecke:
Abstract Physical Traces. CoRR abs/0910.3144 (2009) - [i5]Samson Abramsky:
Coalgebras, Chu Spaces, and Representations of Physical Systems. CoRR abs/0910.3959 (2009) - 2008
- [c54]Susan Stepney, Samson Abramsky, Andy Adamatzky, Colin G. Johnson, Jon Timmis:
Grand Challenge 7: Journeys in Non-Classical Computation. BCS Int. Acad. Conf. 2008: 407-421 - [c53]Samson Abramsky:
Petri Nets, Discrete Physics, and Distributed Quantum Computation. Concurrency, Graphs and Models 2008: 527-543 - [c52]Samson Abramsky:
Types, Orthogonality and Genericity: Some Tools for Communicating Process Architectures. CPA 2008: 1-13 - [e7]Erol Gelenbe, Samson Abramsky, Vladimiro Sassone:
Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008. British Computer Society 2008 [contents] - 2007
- [j27]Samson Abramsky, Bob Coecke:
Physics from Computer Science: a Position Statement. Int. J. Unconv. Comput. 3(3): 179-197 (2007) - [c51]Samson Abramsky:
Petri Nets, Discrete Physics, and Distributed Quantum Computation. ICATPN 2007: 1-2 - [c50]Samson Abramsky:
Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract). CSL 2007: 1-2 - [c49]Samson Abramsky:
Event Domains, Stable Functions and Proof-Nets. Computation, Meaning, and Logic 2007: 33-67 - 2006
- [j26]Samson Abramsky, Ross Duncan:
A categorical quantum logic. Math. Struct. Comput. Sci. 16(3): 469-489 (2006) - [c48]Samson Abramsky, Erich Grädel, Johann A. Makowsky:
The Ackermann Award 2006. CSL 2006: 622-626 - 2005
- [j25]Samson Abramsky, Radha Jagadeesan:
A game semantics for generic polymorphism. Ann. Pure Appl. Log. 133(1-3): 3-37 (2005) - [j24]Samson Abramsky, Marina Lenisa:
Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Log. 134(2-3): 122-168 (2005) - [j23]Samson Abramsky, Marios Mavronicolas:
Game Theory Meets Theoretical Computer Science. Theor. Comput. Sci. 343(1-2): 1-3 (2005) - [j22]Samson Abramsky:
A structural approach to reversible computation. Theor. Comput. Sci. 347(3): 441-464 (2005) - [c47]Samson Abramsky:
A Cook's Tour of the Finitary Non-Well-Founded Sets. We Will Show Them! (1) 2005: 1-18 - [c46]Samson Abramsky:
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories. CALCO 2005: 1-29 - [c45]Samson Abramsky:
Algorithmic Game Semantics and Static Analysis. SAS 2005: 1 - [c44]Samson Abramsky:
What are the Fundamental Structures of Concurrency?: We still don't know! APC 25 2005: 37-41 - [i4]Samson Abramsky, Bob Coecke:
Discrete classical vs. continuous quantum data in abstract quantum mechanics. Spatial Representation 2005 - [i3]Samson Abramsky, Ross Duncan:
A Categorical Quantum Logic. CoRR abs/quant-ph/0512114 (2005) - 2004
- [c43]Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian David Bede Stark:
Nominal Games and Full Abstraction for the Nu-Calculus. LICS 2004: 150-159 - [c42]Samson Abramsky:
High-Level Methods for Quantum Computation and Information. LICS 2004: 410-414 - [c41]Samson Abramsky, Bob Coecke:
A Categorical Semantics of Quantum Protocols. LICS 2004: 415-425 - [c40]Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Applying Game Semantics to Compositional Software Modeling and Verification. TACAS 2004: 421-435 - [i2]Samson Abramsky, Bob Coecke:
A categorical semantics of quantum protocols. CoRR quant-ph/0402130 (2004) - 2003
- [j21]Samson Abramsky:
Sequentiality vs. Concurrency In Games And Logic. Math. Struct. Comput. Sci. 13(4): 531-565 (2003) - [c39]Samson Abramsky, Radha Jagadeesan:
A Game Semantics for Generic Polymorphism. FoSSaCS 2003: 1-22 - 2002
- [j20]Samson Abramsky, Esfandiar Haghverdi, Philip J. Scott:
Geometry of Interaction and Linear Combinatory Algebras. Math. Struct. Comput. Sci. 12(5): 625-665 (2002) - [c38]Samson Abramsky, Bob Coecke:
Physical Traces: Quantum vs. Classical Information Processing. CTCS 2002: 1-22 - [i1]Samson Abramsky, Bob Coecke:
Physical Traces: Quantum vs. Classical Information Processing. CoRR cs.CG/0207057 (2002) - 2001
- [j19]Samson Abramsky, Luca Aceto, Anna Ingólfsdóttir:
Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218. Inf. Comput. 165(2): 119-122 (2001) - [j18]Bent Thomsen, Samson Abramsky:
A fully abstract denotational semantics for the calculus of higher-order communicating systems. Theor. Comput. Sci. 254(1-2): 557-589 (2001) - [c37]Samson Abramsky, Marina Lenisa:
Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. CSL 2001: 443-457 - [e6]Samson Abramsky:
Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings. Lecture Notes in Computer Science 2044, Springer 2001, ISBN 3-540-41960-8 [contents] - 2000
- [b5]Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum:
Handbook of logic in computer science. Volume 5. Logic and Algebraic Methods. Clarendon Press 2000, ISBN 0198537816, pp. I-XVIII, 1-537 - [j17]Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria:
Full Abstraction for PCF. Inf. Comput. 163(2): 409-470 (2000) - [c36]Samson Abramsky:
Axioms for definability and full completeness. Proof, Language, and Interaction 2000: 55-76 - [c35]Samson Abramsky, Marina Lenisa:
A Fully Complete PER Model for ML Polymorphic Types. CSL 2000: 140-155 - [c34]Samson Abramsky:
Game Semantics: Achievements and Prospects. ICALP 2000: 1 - [c33]Samson Abramsky, Marina Lenisa:
Axiomatizing Fully Complete Models for ML Polymorphic Types. MFCS 2000: 141-151
1990 – 1999
- 1999
- [j16]Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan:
A Specification Structure for Deadlock-Freedom of Synchronous Processes. Theor. Comput. Sci. 222(1-2): 1-53 (1999) - [j15]Samson Abramsky, Guy McCusker:
Full Abstraction for Idealized Algol with Passive Expressions. Theor. Comput. Sci. 227(1-2): 3-42 (1999) - [c32]Samson Abramsky, Paul-André Melliès:
Concurrent Games and Full Completeness. LICS 1999: 431-442 - [c31]Samson Abramsky:
Process Realizability. Realizability Semantics and Applications@FLoC 1999: 1-2 - 1998
- [c30]Samson Abramsky, Kohei Honda, Guy McCusker:
A Fully Abstract Game Semantics for General References. LICS 1998: 334-344 - 1997
- [c29]Samson Abramsky, Guy McCusker:
Call-by-Value Games. CSL 1997: 1-17 - [c28]Dusko Pavlovic, Samson Abramsky:
Specifying Interaction Categories. Category Theory and Computer Science 1997: 147-158 - [c27]Samson Abramsky:
Game Semantics for Programming Languages (Abstract). MFCS 1997: 3-4 - [c26]Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan:
A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems. TACS 1997: 295-320 - 1996
- [c25]Samson Abramsky:
Semantics of Interaction (Abstract). CAAP 1996: 1 - [c24]Samson Abramsky:
Retracing Some Paths in Process Algebra. CONCUR 1996: 1-17 - [c23]Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan:
Interaction categories and the foundations of typed concurrent programming. NATO ASI DPD 1996: 35-113 - [c22]Samson Abramsky, Guy McCusker:
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. Linear Logic Tokyo Meeting 1996: 2-14 - 1995
- [b4]Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum:
Handbook of logic in computer science. Volume 4. Semantic modelling. Clarendon Press 1995, ISBN 0198537808, pp. I-XIII, 1-651 - [c21]Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan:
Specification Structures and Propositions-as-Types for Concurrency. Banff Higher Order Workshop 1995: 5-40 - [c20]Samson Abramsky, Guy McCusker:
Games and Full Abstraction for the Lazy lambda-Calculus. LICS 1995: 234-243 - 1994
- [b3]Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum:
Handbook of logic in computer science. Volume 3. Semantic Structures. Clarendon Press 1994, ISBN 019853762X, pp. I-XIII, 1-490 - [j14]Samson Abramsky, Radha Jagadeesan:
New Foundations for the Geometry of Interaction. Inf. Comput. 111(1): 53-119 (1994) - [j13]Samson Abramsky, Radha Jagadeesan:
Games and Full Completeness for Multiplicative Linear Logic. J. Symb. Log. 59(2): 543-574 (1994) - [j12]Samson Abramsky:
Proofs as Processes. Theor. Comput. Sci. 135(1): 5-9 (1994) - [c19]Samson Abramsky, Guy McCusker:
Games for Recursive Types. Theory and Formal Methods 1994: 1-20 - [c18]Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan:
Full Abstraction for PCF. TACS 1994: 1-15 - 1993
- [j11]Ian Mackie, Leopoldo Román, Samson Abramsky:
An internal language for autonomous categories. Appl. Categorical Struct. 1(3): 311-343 (1993) - [j10]Anthony Finkelstein, Jeff Kramer, Samson Abramsky, Krysia Broda, Sophia Drossopoulou, Susan Eisenbach:
An Integrated Engineering Study Scheme in Computing. Comput. J. 36(4): 320-334 (1993) - [j9]Samson Abramsky, C.-H. Luke Ong:
Full Abstraction in the Lazy Lambda Calculus. Inf. Comput. 105(2): 159-267 (1993) - [j8]Samson Abramsky, Steven Vickers:
Quantales, Observational Logic and Process Semantics. Math. Struct. Comput. Sci. 3(2): 161-227 (1993) - [j7]Samson Abramsky:
Computational Interpretations of Linear Logic. Theor. Comput. Sci. 111(1&2): 3-57 (1993) - [c17]Samson Abramsky:
Interaction Categories. Theory and Formal Methods 1993: 57-69 - [c16]Ian Mackie, Leopoldo Román, Samson Abramsky:
An Internal Language for Autonomous Categories. Theory and Formal Methods 1993: 235-246 - 1992
- [b2]Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum:
Handbook of logic in computer science. Volume 2. Background: Computational structures. Clarendon Press 1992, ISBN 0198537611, pp. I-X, 1-571 - [b1]Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum:
Handbook of logic in computer science. Volume 1. Background: Mathematical structures. Clarendon Press 1992, ISBN 0198537352, pp. I-XII, 1-827 - [c15]Samson Abramsky, Radha Jagadeesan:
Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract). FSTTCS 1992: 291-301 - [c14]Samson Abramsky, Radha Jagadeesan:
New Foundations for the Geometry of Interaction. LICS 1992: 211-222 - 1991
- [j6]Samson Abramsky:
Domain Theory in Logical Form. Ann. Pure Appl. Log. 51(1-2): 1-77 (1991) - [j5]Samson Abramsky:
A Domain Equation for Bisimulation. Inf. Comput. 92(2): 161-218 (1991) - [c13]Samson Abramsky, Thomas P. Jensen:
A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions. POPL 1991: 49-54 - [e5]David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné, David E. Rydeheard:
Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings. Lecture Notes in Computer Science 530, Springer 1991, ISBN 3-540-54495-X [contents] - [e4]Samson Abramsky, T. S. E. Maibaum:
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). Lecture Notes in Computer Science 493, Springer 1991, ISBN 3-540-53982-4 [contents] - [e3]Samson Abramsky, T. S. E. Maibaum:
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). Lecture Notes in Computer Science 494, Springer 1991, ISBN 3-540-53981-6 [contents] - 1990
- [j4]Samson Abramsky:
Abstract Interpretation, Logical Relations and Kan Extensions. J. Log. Comput. 1(1): 5-40 (1990) - [c12]Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky:
Foundations of object-based concurrent programming (panel session). OOPSLA/ECOOP Addendum 1990: 9-14 - [c11]Gul Agha, Samson Abramsky, Carl Hewitt, Robin Milner, Peter Wegner, Akinori Yonezawa:
Foundations of Concurrent Object-Oriented Programming (Panel). OOPSLA/ECOOP 1990: 100 - [c10]Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky:
OOPSLA panel on object-based concurrent programming. OOPSLA/ECOOP Workshop on Object-based Concurrent Programming 1990: 3-15
1980 – 1989
- 1989
- [c9]Samson Abramsky:
Observational Logic and Process Semantics (Abstract). Logic at Botik 1989: 1 - [c8]Samson Abramsky:
A Generalized Kahn Principle for Abstract Asynchronous Networks. Mathematical Foundations of Programming Semantics 1989: 1-21 - 1988
- [j3]David A. Fuller, Samson Abramsky:
Mixed Computation of Prolog Programs. New Gener. Comput. 6(2&3): 119-141 (1988) - 1987
- [j2]Samson Abramsky:
Observation Equivalence as a Testing Equivalence. Theor. Comput. Sci. 53: 225-241 (1987) - [c7]Samson Abramsky:
Domain Theory in Logical Form. LICS 1987: 47-53 - [e2]Samson Abramsky, Chris Hankin:
Abstract Interpretation of Declarative Languages. Ellis Horwood 1987, ISBN 0-7458-0109-9 - 1986
- [j1]Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky:
Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3): 249-278 (1986) - [e1]David H. Pitt, Samson Abramsky, Axel Poigné, David E. Rydeheard:
Category Theory and Computer Programming, Tutorial and Workshop, Guildford, UK, September 16-20, 1985 Proceedings. Lecture Notes in Computer Science 240, Springer 1986, ISBN 3-540-17162-2 [contents] - 1985
- [c6]Samson Abramsky:
Introduction. CTCS 1985: 3-6 - [c5]Samson Abramsky, R. Sykes:
Secd-m: a Virtual Machine for Applicative Programming. FPCA 1985: 81-98 - [c4]Samson Abramsky:
Strictness analysis and polymorphic invariance. Programs as Data Objects 1985: 1-23 - [c3]Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky:
The theory of strictness analysis for higher order functions. Programs as Data Objects 1985: 42-62 - 1983
- [c2]Samson Abramsky:
Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. FCT 1983: 1-13 - [c1]Samson Abramsky:
On Semantic Foundations for Applicative Multiprogramming. ICALP 1983: 1-14
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-18 00:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
