University of Oxford Logo University of OxfordDepartment of Computer Science - Home

Samson Abramsky : Publications

By dateBy titleBy typeBibtex

[1]

Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics

S. Abramsky‚ G. Gottlob and P. Kolaitis

In Artificial Intelligence (IJCAI '13)‚ 2013 23rd International Joint Conference on. Pages 440−446. AAAI Press. 2013.

[2]

Logical Bell Inequalities

Samson Abramsky and Lucien Hardy

In Physical Review A. Vol. 85. No. ARTN 062114. Pages 1−11. 2012.

[3]

The Sheaf−Theoretic Structure of Non−Locality and Contextuality

S. Abramsky and A. Brandenburger

In New Journal of Physics. Vol. 13. Pages 113036−113075. 2011.

[4]

Robin Milner's Work on Concurrency

S. Abramsky

In Electronic Notes in Theoretical Computer Science. Vol. 265. Pages 5–10. 2010.

[5]

Introduction to categories and categorical logic

S. Abramsky and N. Tzevelekos

In New Structures for Physics. Springer. 2010.

[6]

Coalgebras‚ chu spaces‚ and representations of physical systems

S. Abramsky

In Logic in Computer Science (LICS)‚ 2010 25th Annual IEEE Symposium on. Pages 411–420. IEEE. 2010.

[7]

From CSP to Game Semantics

S. Abramsky

In Reflections on the Work of C.A.R. Hoare. Pages 33–45. Springer. 2010.

[8]

Big Toy Models: Representing Physical Systems As Chu Spaces

Samson Abramsky

No. RR−09−08. OUCL. September, 2009.

[9]

Coalgebras‚ Chu Spaces‚ and Representations of Physical Systems

Samson Abramsky

No. RR−09−11. OUCL. October, 2009.

[10]

From IF to BI: A tale of dependence and separation ()

S. Abramsky and J. V "a "an "anen

In Synthese. Vol. 167. No. 2. Pages 207–230. 2009.

[11]

Game Semantics for Access Control

S. Abramsky and R. Jagadeesan

In Electronic Notes in Theoretical Computer Science. Vol. 249. Pages 135–156. 2009.

[12]

Petri Nets‚ Discrete Physics‚ and Distributed Quantum Computation

Samson Abramsky

In Pierpaolo Degano‚ Rocco De Nicola and Jose Meseguer, editors, Concurrency‚ Graphs and Models‚ Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday.. Vol. 5065 of Lecture Notes in Computer Science. Pages 527–543. Springer. 2008.

[13]

A Compositional Game Semantics for Multi−Agent Logics of Partial Information

Samson Abramsky

Vol. 1 of Texts in Logic and Games. Pages 11–48. Amsterdam University Press. 2007.

[14]

Physics from Computer Science

S. Abramsky and B. Coecke

In International Journal of Unconventional Computing. Vol. 3. No. 3. Pages 179−197. 2007.

[15]

Temperley−Lieb algebra: From knot theory to logic and computation via quantum mechanics

S. Abramsky

In Goong Chen‚ Louis Kauffman and Sam Lomonaco, editors, Mathematics of Quantum Computing and Technology. Pages 415−458. Taylor and Francis. 2007.

[16]

Event Domains‚ Stable Functions and Proof Nets

S. Abramsky

In Plotkin Festschrift. Vol. 172 of Electronic Notes in Theoretical Computer Science. Pages 33−67. 2007.

[17]

A Categorical Quantum Logic

S. Abramsky and R. Duncan

In Mathematical Structures in Computer Science‚ 16. Pages 469−489. 2006.

[18]

What are the fundamental structures of concurrency? We still don't know!

S. Abramsky

In Electronic Notes in Theoretical Computer Science‚ 162. Pages 37−41. 2006.

[19]

Socially Responsive‚ Environmentally Friendly Logic

S. Abramsky

In Tuomo Aho and Ahti−Veikko Pietarinen, editors, Truth and Games: Essays in Honour of Gabriel Sandu. Pages 17−46. Acta Philosophica Fennica‚ Societas Philosophicas Fennica‚ Helsinki. 2006.

[20]

What are the fundamental structures of concurrency? We still don't know!

S. Abramsky

In Algebraic process calculi: the first 25 years and beyond. Pages 1−5. June, 2005.

[21]

Linear realizability and full completeness for typed lambda−calculi

S. Abramsky and M. Lenisa

In Annals of Pure and Applied Logic. Vol. 134. Pages 122−168. 2005.

[22]

A Game Semantics for Generic Polymorphism

S. Abramsky and R. Jagadeesan

In Annals of Pure and Applied Logic. Vol. 133. Pages 3−37. 2005.

[23]

Abstract Physical Traces

S. Abramsky and B. Coecke

In Theory and Applications of Categories. Vol. 14. Pages 111−124. 2005.

[24]

A Structural Approach To Reversible Computation

S. Abramsky

In Theoretical Computer Science. Vol. 347. No. 3. Pages 441−464. 2005.

[25]

A Cook's Tour of the Finitary Non−Well−Founded Sets

S. Abramsky

In Sergei Artemov‚ Howard Barringer‚ Artur d'Avila Garcez‚ Luis C. Lamb and John Woods, editors, We Will Show Them: Essays in honour of Dov Gabbay. Vol. 1. Pages 1−18. College Publications. 2005.

[26]

Abstract Scalars‚ Loops‚ and Free Traced and Strongly Compact Closed Categories

S. Abramsky

In Proceedings of CALCO 2005. Vol. 3629 of Springer Lecture Notes in Computer Science. Pages 1−31. 2005.

[27]

A Categorical semantics of Quantum Protocols

Samson Abramsky and Bob Coecke

No. RR−04−02. Oxford University Computing Laboratory. February, 2004.

[28]

Applying Game Semantics to Compositional Software Modelling and verification

S. Abramsky‚ D. Ghica‚ L. Ong and A. Murawski

In TACAS 2004: Tools and Algorithms for the Construction and Analysis of Systems‚ 10 International Conference. Vol. 2988. Pages 421−435. Springer LNCS. 2004.

[29]

Nominal games and Full Abstraction for the Nu−Calculus

S. Abramsky‚ D. Ghica‚ A. Murawski‚ C.−H. Ong and I. Stark

In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004. Pages 150−159. IEEE Computer Society. 2004.

[30]

A Categorical Semantics of Quantum Protocols

S. Abramsky and B. Coecke

In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004. Pages 415−425. IEEE Computer Society. 2004.

[31]

High−Level Methods for Quantum Computation and Information

S. Abramsky

In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004. Pages 410−414. IEEE Computer Society. 2004.

[32]

A game semantics for generic polymorphism

Samson Abramsky and Radha Jagadeesan

No. RR−03−02. Oxford University Computing Laboratory. January, 2003.

[33]

A Game semantics for Generic Polymorphism

S. Abramsky and R. Jagadeesan

In A. D. Gordon, editor, Foundations of Software Science and Computational Structures‚ 6th International Conference‚ FOSSACS 2003. Vol. 2620 of Springer Lecture Notes in Computer Science. Pages 1−22. 2003.

[34]

Algorithmic Game Semantics and Component−Based Verification

S. Abramsky‚ D. R. Ghica‚ L. Ong and A. Murawski

In Proceedings of SAVBCS 2003: Specification and Verification of Component−Based Systems‚ Workshop at ESEC/FASE 2003. Pages 66−74. 2003.

published as Technical Report 03−11‚ Department of Computer Science‚ Iowa State University

[35]

Physical Traces: Quantum vs. Classical Information Processing

S. Abramsky and B. Coecke

In Electronic Notes in Theoretical Computer Science. Vol. 69. Pages 1−26. 2003.

[36]

Sequentiality vs. concurrency in games and logic

S. Abramsky

In Mathematical Structures in Computer Science. Vol. 13. Pages 531−565. 2003.

[37]

Geometry of Interaction and linear combinatory algebras

S. Abramsky‚ E. Haghverdi and P. Scott

In Mathematical Structures in Computer Science. Vol. 12. Pages 625−665. 2002.

[38]

A fully abstract denotational semantics for the calculus of higher−order communicating systems

B. Thomsen and S. Abramsky

In Theoretical Computer Science. Vol. 254. Pages 557−589. 2001.

[39]

Fully Complete Minimal PER Models for the Simply Typed λ−calculus

S. Abramsky and M. Lenisa

In CSL 2001 Conference Proceedings. Vol. 2142 of Springer LNCS. Pages 442−457. 2001.

[40]

Algorithmic Game Semantics: A Tutorial Introduction

S. Abramsky

In H. Schichtenberg and R. Steinbrüggen, editors, Proceedings of the NATO Advanced Study Institute‚ Marktober− dorf. Chapter Proof and System Reliability. Pages 21−47. Kluwer Academic Publishers. 2001.

[41]

A Structural Approach to Reversible Computation

S. Abramsky

In D. Beauquier and Y. Matiyasevich, editors, LCCS 2001: Proceedings of the International Workshop on Logic and Complexity in Computer Science. Pages 1−16. 2001.

[42]

The Handbook of Logic in Computer Science

S. Abramsky‚ D. Gabbay and T. S. E. Maibaum, editors

Oxford University Press. 2000.

Volumes 1 and 2—Background: Mathematical Structures and Back− ground: Computational Structures—published in 1992. Volumes 3 and 4—Semantic Structures and Semantic Modelling— published in 1995. Volume 5—Logic and Algebraic Methods

[43]

Axiomatizing Fully Complete Models for ML Polymorphic Types

S. Abramsky and M. Lenisa

In M. Nielsen and B. Rovan, editors, Proceedings of the International Symposium on Mathematical Foundations of Computer Science. Vol. 1893 of Springer Lecture Notes in Computer Science. Pages 141−151. Springer−Verlag. 2000.

[44]

A Fully Complete PER Model for ML Polymorphic Types

S. Abramsky and M. Lenisa

In P. Clote and H. Schwichtenberg, editors, Proceedings of the Fourteenth International Workshop on Computer Science Logic. Vol. 1862 of Springer Lecture Notes in Computer Science. Pages 140−155. Springer−Verlag. 2000.

[45]

Full Abstraction for PCF

S. Abramsky‚ R. Jagadeesan and P. Malacaria

In Information and Computation. Vol. 163. Pages 409−470. 2000.

[46]

Concurrent Interaction Games

S. Abramsky

In A. W. Roscoe J. Davies and J. Woodcock, editors, Millennial Perspectives in Computer Science. Pages 1−12. Palgrave. 2000.

[47]

Process Realizability

S. Abramsky

In F. L. Bauer and R. Steinbrüggen, editors, Foundations of Secure Computation: Proceedings of the 1999 Marktoberdorf Summer School. Pages 167−180. IOS Press. 2000.

[48]

Concurrent Games and Full Completeness

S. Abramsky and P.−A. Melliés

In Proceedings of the Fourteenth International Symposium on Logic in Computer Science. Pages 431−442. Computer Society Press of the IEEE. 1999.

[49]

Full Abstraction for Idealized Algol with passive expressions

S. Abramsky and G. McCusker

In Theoretical Computer Science. Vol. 227. Pages 3−42. 1999.

[50]

Game Semantics

S. Abramsky and G. McCusker

In H. Schwichtenberg and U. Berger, editors, Computational Logic: Proceedings of the 1997 Marktoberdorf Summer School. Pages 1−56. Springer−Verlag. 1999.

[51]

A Specification Structure for Deadlock−freedom of Synchronous Processes

S. Abramsky‚ S. J. Gay and R. Nagarajan

In Theoretical Computer Science. Vol. 222. Pages 1−53. 1999.

[52]

Nuclear and trace ideals in tensored *−categories

S. Abramsky‚ R. Blute and P. Panangaden

In J. Pure and Applied Algebra. Vol. 143. Pages 3−47. 1999.

[53]

Axioms for Definability and Full Completeness

S. Abramsky

In G. Plotkin‚ M. Tofte and C. Stirling, editors, Essays in Honour of Robin Milner. Pages 55−75. MIT Press. 1999.

[54]

Call−by−value games

S. Abramsky and G. McCusker

In M. Nielsen and W. Thomas, editors, Proceedings of the Eleventh International Workshop on Computer Science Logic. Vol. 1414 of Springer Lecture Notes in Computer Science. Pages 1−17. Springer−Verlag. 1998.

[55]

A fully abstract game semantics for general references

S. Abramsky‚ K. Honda and G. McCusker

In Proceedings of the Thirteenth International Symposium on Logic in Computer Science. Pages 334−344. Computer Society Press of the IEEE. 1998.

[56]

Specifying Processes

S. Abramsky and D. Pavlovic

In E. Moggi and G. Rosolini, editors, Proceedings of the International Symposium on Category Theory In Computer Science. Vol. 1290 of Springer Lecture Notes in Computer Science. Pages 147−158. Springer−Verlag. 1997.

[57]

Linearity‚ Sharing and State: a fully abstract game semantics for Idealized Algol

S. Abramsky and G. McCusker

In P. O'Hearn and R. D. Tennent, editors, Algol−like Languages. Pages 317−348. Birkhauser. 1997.

[58]

A Type−theoretic Approach to Deadlock−freedom of Asynchronous Systems

S. Abramsky‚ S. Gay and R. Nagarajan

In M. Abadi and T. Ito, editors, Theoretical Aspects of Computer Software. Vol. 1281 of Springer Lecture Notes in Computer Science. Pages 295−320. Springer−Verlag. 1997.

[59]

Games in the Semantics of Programming Languages

S. Abramsky

In P. Dekker‚ M. Stokhof and Y. Venema, editors, Proceedings of the 11th Amsterdam Colloquium. Pages 1−6. ILLC‚ Dept. of Philosophy‚ University of Amsterdam. 1997.

[60]

Game Semantics for Programming Languages

S. Abramsky

In I. Privara and P. Ruzicka, editors, 22nd International Symposium on Mathematical Foundations of Computer Science. Vol. 1295 of Springer Lecture Notes in Computer Science. Pages 3−4. Springer−Verlag. 1997.

[61]

Semantics of Interaction: an introduction to Game Semantics

S. Abramsky

In P. Dybjer and A. Pitts, editors, Proceedings of the 1996 CLiCS Summer School‚ Isaac Newton Institute. Pages 1−31. Cambridge University Press. 1997.

[62]

Specification Structures and Propositions−as−Types for Concurrency

S. Abramsky‚ S. Gay and R. Nagarajan

In G. Birtwistle and F. Moller, editors, Logics for Concurrency: Structure vs. Automata—Proceedings of the VI I Ith Banff Higher Order Workshop. Pages 5−40. Springer−Verlag. 1996.

[63]

Interaction Categories and the Foundations of Typed Concurrent Programming

S. Abramsky‚ S. Gay and R. Nagarajan

In M. Broy, editor, Proceedings of the 1994 Marktoberdorf Summer Sxhool on Deductive Program Design. Pages 35−113. Springer−Verlag. 1996.

[64]

Retracing some paths in process algebra

S. Abramsky

In U. Montanari and V. Sassone, editors, CONCUR '96: Concurrency Theory‚ 7th International Conference. Pages 1−17. Springer−Verlag. 1996.

[65]

Games for recursive types

S. Abramsky and G. McCusker

In C. L. Hankin, editor, Proceedings of the 1994 Workshop on Theory and Formal Methods. Pages 1−20. Imperial College Press. 1995.

[66]

Games and Full Abstraction for the Lazy λ−calculus

S. Abramsky and G. McCusker

In D. Kozen, editor, Proceedings of the Tenth Annual Symposium on Logic in Computer Science. Pages 234−243. IEEE Computer Society Press. 1995.

[67]

Domain Theory

S. Abramsky and A. Jung

In S. Abramsky‚ D. Gabbay and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science. Pages 1−168. Oxford University Press. 1994.

[68]

Full Abstraction for PCF (Extended Abstract)

S. Abramsky‚ R. Jagadeesan and P. Malacaria

In M. Hagiya and J. C. Mitchell, editors, Theoretical Aspects of Computer Software. Pages 1−15. Springer−Verlag. 1994.

[69]

Games and Full Completeness for Multiplicative Linear Logic

S. Abramsky and R. Jagadeesan

In Journal of Symbolic Logic. Vol. 59. No. 2. Pages 543−574. 1994.

[70]

New Foundations for the Geometry of Interaction

S. Abramsky and R. Jagadeesan

In Information and Computation‚ 111(1). Pages 53−119. 1994.

[71]

Proofs as Processes

S. Abramsky

In J. Theoretical Computer Science. Vol. 135. Pages 5−9. 1994.

[72]

Interaction Categories and Communicating Sequential Processes

S. Abramsky

In A. W. Roscoe, editor, A Classical Mind: Essays in honour of C. A. R. Hoare. Pages 1−16. Prentice Hall International. 1994.

[73]

An Internal Language for Autonomous Categories

I. Mackie‚ L. Roman and S. Abramsky

In Journal of Applied Categorical Structures. Vol. 1. Pages 311−343. 1993.

[74]

An Integrated Engineering Study Scheme in Computing

A. Finkelstein‚ J. Kramer‚ S. Abramsky‚ K. Broda‚ S. Drossopoulou and S. Eisenbach

In Computer Journal‚ 36(4). Pages 320−334. 1993.

[75]

Quantales‚ Observational Logic and Process Semantics

S. Abramsky and S. J. Vickers

In Mathematical Structures in Computer Science. Vol. 3. Pages 161−227. 1993.

[76]

Full Abstraction in the Lazy λ−calculus

S. Abramsky and C.−H. L. Ong

In Information and Computation‚ 105(2). Pages 159−268. 1993.

[77]

Interaction Categories (Extended Abstract)

S. Abramsky

In G. L. Burn‚ S. J. Gay and M. D. Ryan, editors, Theory and Formal Methods 1993. Pages 57−69. Springer−Verlag. 1993.

[78]

Computational Interpretations of Linear logic

S. Abramsky

In J. Theoretical Computer Science‚ 111. Pages 3−57. 1993.

[79]

Games and Full Completeness for Multiplicative Linear Logic

S. Abramsky and R. Jagadeesan

In R. Shyamsundar, editor, Foundations of Software Technology and Theoretical Computer Science. Pages 291−301. Springer−Verlag. 1992.

[80]

New Foundations for the Geometry of Interaction

S. Abramsky and R. Jagadeesan

In Symposium on Logic in Computer Science. Pages 211−222. Computer Society Press of the IEEE. 1992.

[81]

Proceedings of TAPSOFT 91

S. Abramsky and T. S. E. Maibaum, editors

Vol. 493−494. Springer Lecture Notes in Computer Science. 1991.

[82]

A Relational Approach to Strictness Analysis for Higher−Order Polymorphic Functions

S. Abramsky and T. Jensen

In ACM Symposium on Principles of Programming Languages. Pages 49−55. ACM Press. 1991.

[83]

A Domain Equation for Bisimulation

S. Abramsky

In J. Information and Computation. Vol. 92. No. 2. Pages 161−218. 1991.

[84]

Domain Theory in Logical Form

S. Abramsky

In Annals of Pure and Applied Logic. Vol. 51. Pages 1−77. 1991.

[85]

A Generalized Kahn Principle for Abstract Asynchronous Networks

S. Abramsky

In M. Mislove, editor, Symposium on Mathematical Foundations of Programming Language Semantics. Pages 1−21. Springer−Verlag. 1990.

[86]

Abstract Interpretation‚ Logical Relations and Kan Extensions

S. Abramsky

In J. Logic and Computation‚ 1(1). Pages 5−41. 1990.

[87]

The Lazy λ−Calculus

S. Abramsky

In D. Turner, editor, Research Topics in Functional Programming. Pages 65−117. Addison Wesley. 1990.

[88]

Observational Logic and Process Semantics (Abstract)

S. Abramsky

In A. Meyer and M. Taitslin, editors, Logic at Botik 89. Springer−Verlag. 1989.

[89]

Partial evaluation and MIX compilation in PROLOG

D. Fuller and S. Abramsky

In New Generation Computing. Vol. 6. Pages 119−143. 1988.

[90]

Abstract Interpretation for Declarative Languages

S. Abramsky and Chris Hankin, editors

Ellis Horwood. 1987.

[91]

Introduction to Abstract Interpretation

S. Abramsky and C. Hankin

In S.Abramsky and C. Hankin, editors, Abstract Interpretation for Declarative Languages. Chapter 1. Pages 9−31. Ellis Horwood. 1987.

[92]

Domain Theory in Logical Form

S. Abramsky

In Symposium on Logic in Computer Science. Pages 47−53. Computer Society Press of the IEEE. 1987.

[93]

Observation Equivalence as a Testing Equivalence

S. Abramsky

In J. Theoretical Computer Science. Chapter 53. Pages 225−241. 1987.

[94]

Domain Theory and the Logic of Observable Properties

Samson Abramsky

PhD Thesis 1987.

[95]

Category Theory and Computer Programming

S. Abramsky‚ D. Pitt‚ A. Poigné and D. Rydeheard), editors

Springer. 1986.

[96]

The Theory of Strictness Analysis for Higher Order Functions

G. Burn‚ C. Hankin and S. Abramsky

In H. Ganzinger and N. Jones, editors, Programs as Data Objects. Pages 42−62. Springer−Verlag. 1986.

[97]

Strictness Analysis for Higher Order Functions

G. Burn‚ C. Hankin and S. Abramsky

In Science of Computer Programming 7. Pages 249−278. 1986.

[98]

Strictness Analysis and Polymorphic Invariance

S. Abramsky

In H. Ganzinger and N. Jones, editors, Programs as Data Objects. Pages 1−23. Springer−Verlag. 1986.

[99]

SECD−M: a virtual machine for applicative multiprogramming

S. Abramsky and R. Sykes

In J.−P. Jouannaud, editor, Functional Languages and Computer Architecture. Pages 81−98. Springer−Verlag. 1985.

[100]

Reasoning about concurrent systems: a functional approach

S. Abramsky

In F. Chambers‚ D. Duce and G. Jones, editors, Distributed Systems. Pages 307−319. Academic Press. 1984.

[101]

Pascal−m: a language for the design of loosely coupled distributed systems

S. Abramsky and R. Bornat

In Y. Paker and J.−P. Verjus, editors, Distributed Computing Systems: Synchronization‚ Control and Coordination. Pages 163−189. Academic Press. 1983.

[102]

Experiments‚ Powerdomains and Fully Abstract Models for Applicative Multiprogramming

S. Abramsky

In M. Karpinski, editor, Foundations of Computation Theory. Pages 1−13. Springer−Verlag. 1983.

[103]

Semantic Foundations for Applicative Multiprogramming

S. Abramsky

In J. Diaz, editor, Automata‚ Languages and Programming. Pages 1−14. Springer−Verlag. 1983.

[104]

Pascal−m in Office Information Systems

S. Abramsky and S. Cook

In N. Naffah, editor, Office Information Systems. North Holland. 1982.