Samson Abramsky : Publications

A Categorical Quantum Logic

S. Abramsky and R. Duncan

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

Details about A Categorical Quantum Logic | BibTeX data for A Categorical Quantum Logic | Download  (pdf) of A Categorical Quantum Logic

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.

Details about A Categorical Semantics of Quantum Protocols | BibTeX data for A Categorical Semantics of Quantum Protocols | Download  (ps) of A Categorical Semantics of Quantum Protocols

A Categorical semantics of Quantum Protocols

Samson Abramsky and Bob Coecke

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

Details about A Categorical semantics of Quantum Protocols | BibTeX data for A Categorical semantics of Quantum Protocols | Download  (ps) of A Categorical semantics of Quantum Protocols

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.

Details about A Compositional Game Semantics for Multi−Agent Logics of Partial Information | BibTeX data for A Compositional Game Semantics for Multi−Agent Logics of Partial Information | Download  (pdf) of A Compositional Game Semantics for Multi−Agent Logics of Partial Information

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.

Details about A Cook's Tour of the Finitary Non−Well−Founded Sets | BibTeX data for A Cook's Tour of the Finitary Non−Well−Founded Sets | Download  (pdf) of A Cook's Tour of the Finitary Non−Well−Founded Sets

A Domain Equation for Bisimulation

S. Abramsky

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

Details about A Domain Equation for Bisimulation | BibTeX data for A Domain Equation for Bisimulation | Download  (ps.gz) of A Domain Equation for Bisimulation

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.

Details about A Fully Complete PER Model for ML Polymorphic Types | BibTeX data for A Fully Complete PER Model for ML Polymorphic Types | Download  (ps) of A Fully Complete PER Model for ML Polymorphic Types

A Game Semantics for Generic Polymorphism

S. Abramsky and R. Jagadeesan

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

Details about A Game Semantics for Generic Polymorphism | BibTeX data for A Game Semantics for Generic Polymorphism | Download  (pdf) of A Game Semantics for Generic Polymorphism

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.

Details about A Game semantics for Generic Polymorphism | BibTeX data for A Game semantics for Generic Polymorphism | Download  (ps) of A Game semantics for Generic Polymorphism

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.

Details about A Generalized Kahn Principle for Abstract Asynchronous Networks | BibTeX data for A Generalized Kahn Principle for Abstract Asynchronous Networks | Download  (ps.gz) of A Generalized Kahn Principle for Abstract Asynchronous Networks

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.

Details about A Relational Approach to Strictness Analysis for Higher−Order Polymorphic Functions | BibTeX data for A Relational Approach to Strictness Analysis for Higher−Order Polymorphic Functions

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.

Details about A Specification Structure for Deadlock−freedom of Synchronous Processes | BibTeX data for A Specification Structure for Deadlock−freedom of Synchronous Processes | Download  (ps) of A Specification Structure for Deadlock−freedom of Synchronous Processes

A Structural Approach To Reversible Computation

S. Abramsky

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

Details about A Structural Approach To Reversible Computation | BibTeX data for A Structural Approach To Reversible Computation | Download  (pdf) of A Structural Approach To Reversible Computation

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.

Details about A Structural Approach to Reversible Computation | BibTeX data for A Structural Approach to Reversible Computation | Download  (ps.gz) of A Structural Approach to Reversible Computation

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.

Details about A Type−theoretic Approach to Deadlock−freedom of Asynchronous Systems | BibTeX data for A Type−theoretic Approach to Deadlock−freedom of Asynchronous Systems | Download  (ps) of A Type−theoretic Approach to Deadlock−freedom of Asynchronous Systems

A complete characterization of All−versus−Nothing arguments for stabilizer states

Samson Abramsky‚ Rui Soares Barbosa‚ Giovanni Carù and Simon Perdrix

In Philosophical Transactions of the Royal Society of London A: Mathematical‚ Physical and Engineering Sciences‚ Theme Issue on ‘Second quantum revolution: foundational questions'. Vol. 375. No. 2106. 2017.

E−print: arXiv:1705.08459 [quant−ph]

Details about A complete characterization of All−versus−Nothing arguments for stabilizer states | BibTeX data for A complete characterization of All−versus−Nothing arguments for stabilizer states | DOI (10.1098/rsta.2016.0385) | Link to A complete characterization of All−versus−Nothing arguments for stabilizer states

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.

Details about A fully abstract denotational semantics for the calculus of higher−order communicating systems | BibTeX data for A fully abstract denotational semantics for the calculus of higher−order communicating systems

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.

Details about A fully abstract game semantics for general references | BibTeX data for A fully abstract game semantics for general references | Download  (ps.gz) of A fully abstract game semantics for general references

A game semantics for generic polymorphism

Samson Abramsky and Radha Jagadeesan

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

Details about A game semantics for generic polymorphism | BibTeX data for A game semantics for generic polymorphism | Download  (ps.gz) of A game semantics for generic polymorphism

Abstract Interpretation for Declarative Languages

S. Abramsky and Chris Hankin, editors

Ellis Horwood. 1987.

Details about Abstract Interpretation for Declarative Languages | BibTeX data for Abstract Interpretation for Declarative Languages

Abstract Interpretation‚ Logical Relations and Kan Extensions

S. Abramsky

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

Details about Abstract Interpretation‚ Logical Relations and Kan Extensions | BibTeX data for Abstract Interpretation‚ Logical Relations and Kan Extensions

Abstract Physical Traces

S. Abramsky and B. Coecke

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

Details about Abstract Physical Traces | BibTeX data for Abstract Physical Traces | Download  (ps) of Abstract Physical Traces

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.

Details about Abstract Scalars‚ Loops‚ and Free Traced and Strongly Compact Closed Categories | BibTeX data for Abstract Scalars‚ Loops‚ and Free Traced and Strongly Compact Closed Categories | Download  (pdf) of Abstract Scalars‚ Loops‚ and Free Traced and Strongly Compact Closed Categories

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

Details about Algorithmic Game Semantics and Component−Based Verification | BibTeX data for Algorithmic Game Semantics and Component−Based Verification | Download  (pdf) of Algorithmic Game Semantics and Component−Based Verification | Download (pdf) of Algorithmic Game Semantics and Component−Based Verification

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.

Details about Algorithmic Game Semantics: A Tutorial Introduction | BibTeX data for Algorithmic Game Semantics: A Tutorial Introduction | Download  (ps) of Algorithmic Game Semantics: A Tutorial Introduction

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.

Details about An Integrated Engineering Study Scheme in Computing | BibTeX data for An Integrated Engineering Study Scheme in Computing

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.

Details about An Internal Language for Autonomous Categories | BibTeX data for An Internal Language for Autonomous Categories

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.

Details about Applying Game Semantics to Compositional Software Modelling and verification | BibTeX data for Applying Game Semantics to Compositional Software Modelling and verification

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.

Details about Axiomatizing Fully Complete Models for ML Polymorphic Types | BibTeX data for Axiomatizing Fully Complete Models for ML Polymorphic Types | Download  (ps) of Axiomatizing Fully Complete Models for ML Polymorphic Types

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.

Details about Axioms for Definability and Full Completeness | BibTeX data for Axioms for Definability and Full Completeness | Download  (ps.gz) of Axioms for Definability and Full Completeness

Big Toy Models: Representing Physical Systems As Chu Spaces

Samson Abramsky

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

Details about Big Toy Models: Representing Physical Systems As Chu Spaces | BibTeX data for Big Toy Models: Representing Physical Systems As Chu Spaces | Download  (pdf) of Big Toy Models: Representing Physical Systems As Chu Spaces

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.

Details about Call−by−value games | BibTeX data for Call−by−value games | Download  (ps.gz) of Call−by−value games

Category Theory and Computer Programming

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

Springer. 1986.

Details about Category Theory and Computer Programming | BibTeX data for Category Theory and Computer Programming | DOI (10.1007/3-540-17162-2)

Coalgebras‚ Chu Spaces‚ and Representations of Physical Systems

Samson Abramsky

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

Details about Coalgebras‚ Chu Spaces‚ and Representations of Physical Systems | BibTeX data for Coalgebras‚ Chu Spaces‚ and Representations of Physical Systems | Download  (pdf) of Coalgebras‚ Chu Spaces‚ and Representations of Physical Systems

Computational Interpretations of Linear logic

S. Abramsky

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

Details about Computational Interpretations of Linear logic | BibTeX data for Computational Interpretations of Linear logic | Download  (ps.gz) of Computational Interpretations of Linear logic

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.

Details about Concurrent Games and Full Completeness | BibTeX data for Concurrent Games and Full Completeness | Download  (pdf) of Concurrent Games and Full Completeness

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.

Details about Concurrent Interaction Games | BibTeX data for Concurrent Interaction Games | Download  (ps) of Concurrent Interaction Games

Contextual fraction as a measure of contextuality

Samson Abramsky‚ Rui Soares Barbosa and Shane Mansfield

In Physical Review Letters. Vol. 119. No. 050504. 2017.

E−print: arXiv:1705.07918 [quant−ph]; Earlier version (“Quantifying contextuality via linear programming”) accepted for communication to 13th International Conference on Quantum Physics and Logic (QPL 2016).

Details about Contextual fraction as a measure of contextuality | BibTeX data for Contextual fraction as a measure of contextuality | DOI (10.1103/PhysRevLett.119.050504) | Link to Contextual fraction as a measure of contextuality

Contextuality‚ cohomology and paradox

Samson Abramsky‚ Rui Soares Barbosa‚ Kohei Kishida‚ Raymond Lal and Shane Mansfield

In Stephan Kreutzer, editor, Proceedings of 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Vol. 41 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 211–228. Dagstuhl‚ Germany. 2015. Schloss Dagstuhl–Leibniz−Zentrum für Informatik.

E−print: arXiv:1502.03097 [quant−ph]

Details about Contextuality‚ cohomology and paradox | BibTeX data for Contextuality‚ cohomology and paradox | DOI (10.4230/LIPIcs.CSL.2015.211) | Link to Contextuality‚ cohomology and paradox

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.

Details about Domain Theory | BibTeX data for Domain Theory | Download  (pdf) of Domain Theory

Domain Theory and the Logic of Observable Properties

Samson Abramsky

PhD Thesis 1987.

Details about Domain Theory and the Logic of Observable Properties | BibTeX data for Domain Theory and the Logic of Observable Properties | Download  (pdf) of Domain Theory and the Logic of Observable Properties

Domain Theory in Logical Form

S. Abramsky

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

Details about Domain Theory in Logical Form | BibTeX data for Domain Theory in Logical Form | Download  (pdf) of Domain Theory in Logical Form

Domain Theory in Logical Form

S. Abramsky

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

Details about Domain Theory in Logical Form | BibTeX data for Domain Theory in Logical Form | Download  (pdf) of Domain Theory in Logical Form

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.

Details about Event Domains‚ Stable Functions and Proof Nets | BibTeX data for Event Domains‚ Stable Functions and Proof Nets | Download  (pdf) of Event Domains‚ Stable Functions and Proof Nets

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.

Details about Experiments‚ Powerdomains and Fully Abstract Models for Applicative Multiprogramming | BibTeX data for Experiments‚ Powerdomains and Fully Abstract Models for Applicative Multiprogramming

Full Abstraction for Idealized Algol with passive expressions

S. Abramsky and G. McCusker

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

Details about Full Abstraction for Idealized Algol with passive expressions | BibTeX data for Full Abstraction for Idealized Algol with passive expressions | Download  (ps.gz) of Full Abstraction for Idealized Algol with passive expressions

Full Abstraction for PCF

S. Abramsky‚ R. Jagadeesan and P. Malacaria

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

Details about Full Abstraction for PCF | BibTeX data for Full Abstraction for PCF | Download  (pdf) of Full Abstraction for PCF

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.

Details about Full Abstraction for PCF (Extended Abstract) | BibTeX data for Full Abstraction for PCF (Extended Abstract)

Full Abstraction in the Lazy λ−calculus

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

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

Details about Full Abstraction in the Lazy λ−calculus | BibTeX data for Full Abstraction in the Lazy λ−calculus

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.

Details about Fully Complete Minimal PER Models for the Simply Typed λ−calculus | BibTeX data for Fully Complete Minimal PER Models for the Simply Typed λ−calculus | Download  (ps) of Fully Complete Minimal PER Models for the Simply Typed λ−calculus

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.

Details about Game Semantics | BibTeX data for Game Semantics | Download  (ps.gz) of Game Semantics

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.

Details about Game Semantics for Programming Languages | BibTeX data for Game Semantics for Programming Languages

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.

Details about Games and Full Abstraction for the Lazy λ−calculus | BibTeX data for Games and Full Abstraction for the Lazy λ−calculus

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.

Details about Games and Full Completeness for Multiplicative Linear Logic | BibTeX data for Games and Full Completeness for Multiplicative Linear Logic

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.

Details about Games and Full Completeness for Multiplicative Linear Logic | BibTeX data for Games and Full Completeness for Multiplicative Linear Logic | Download  (pdf) of Games and Full Completeness for Multiplicative Linear Logic

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.

Details about Games for recursive types | BibTeX data for Games for recursive types | Download  (ps.gz) of Games for recursive types

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.

Details about Games in the Semantics of Programming Languages | BibTeX data for Games in the Semantics of Programming Languages | Download  (ps.gz) of Games in the Semantics of Programming Languages

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.

Details about Geometry of Interaction and linear combinatory algebras | BibTeX data for Geometry of Interaction and linear combinatory algebras | Download  (ps) of Geometry of Interaction and linear combinatory algebras

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.

Details about High−Level Methods for Quantum Computation and Information | BibTeX data for High−Level Methods for Quantum Computation and Information | Download  (ps) of High−Level Methods for Quantum Computation and Information

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.

Details about Interaction Categories (Extended Abstract) | BibTeX data for Interaction Categories (Extended Abstract)

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.

Details about Interaction Categories and Communicating Sequential Processes | BibTeX data for Interaction Categories and Communicating Sequential Processes

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.

Details about Interaction Categories and the Foundations of Typed Concurrent Programming | BibTeX data for Interaction Categories and the Foundations of Typed Concurrent Programming | Download  (ps) of Interaction Categories and the Foundations of Typed Concurrent Programming

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.

Details about Introduction to Abstract Interpretation | BibTeX data for Introduction to Abstract Interpretation

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.

Details about Linear realizability and full completeness for typed lambda−calculi | BibTeX data for Linear realizability and full completeness for typed lambda−calculi | Download  (ps) of Linear realizability and full completeness for typed lambda−calculi

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.

Details about Linearity‚ Sharing and State: a fully abstract game semantics for Idealized Algol | BibTeX data for Linearity‚ Sharing and State: a fully abstract game semantics for Idealized Algol | Download  (ps.gz) of Linearity‚ Sharing and State: a fully abstract game semantics for Idealized Algol

Logical Bell Inequalities

Samson Abramsky and Lucien Hardy

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

Details about Logical Bell Inequalities | BibTeX data for Logical Bell Inequalities | DOI (10.1103/PhysRevA.85.062114) | Link to Logical Bell Inequalities

Minimum quantum resources for strong non−locality

Samson Abramsky‚ Rui Soares Barbosa‚ Giovanni Carù‚ Nadish de Silva‚ Kohei Kishida and Shane Mansfield

In Mark M. Wilde, editor, Proceedings of 12th Conference on the Theory of Quantum Computation‚ Communication and Cryptography (TQC 2017). Vol. 73 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 9:1–9:20. Dagstuhl‚ Germany. 2018. Schloss Dagstuhl–Leibniz−Zentrum fuer Informatik.

Accepted for communication at 14th International Conference on Quantum Physics and Logic (QPL 2017); E−print: arXiv:1705.09312 [quant−ph]

Details about Minimum quantum resources for strong non−locality | BibTeX data for Minimum quantum resources for strong non−locality | DOI (10.4230/LIPIcs.TQC.2017.9) | Link to Minimum quantum resources for strong non−locality

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.

Details about New Foundations for the Geometry of Interaction | BibTeX data for New Foundations for the Geometry of Interaction

New Foundations for the Geometry of Interaction

S. Abramsky and R. Jagadeesan

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

Details about New Foundations for the Geometry of Interaction | BibTeX data for New Foundations for the Geometry of Interaction | Download  (pdf) of New Foundations for the Geometry of Interaction

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.

Details about Nominal games and Full Abstraction for the Nu−Calculus | BibTeX data for Nominal games and Full Abstraction for the Nu−Calculus | Download  (pdf) of Nominal games and Full Abstraction for the Nu−Calculus

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.

Details about Nuclear and trace ideals in tensored *−categories | BibTeX data for Nuclear and trace ideals in tensored *−categories | Download  (ps) of Nuclear and trace ideals in tensored *−categories

Observation Equivalence as a Testing Equivalence

S. Abramsky

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

Details about Observation Equivalence as a Testing Equivalence | BibTeX data for Observation Equivalence as a Testing Equivalence

Observational Logic and Process Semantics (Abstract)

S. Abramsky

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

Details about Observational Logic and Process Semantics (Abstract) | BibTeX data for Observational Logic and Process Semantics (Abstract)

Partial evaluation and MIX compilation in PROLOG

D. Fuller and S. Abramsky

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

Details about Partial evaluation and MIX compilation in PROLOG | BibTeX data for Partial evaluation and MIX compilation in PROLOG

Pascal−m in Office Information Systems

S. Abramsky and S. Cook

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

Details about Pascal−m in Office Information Systems | BibTeX data for Pascal−m in Office Information Systems

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.

Details about Pascal−m: a language for the design of loosely coupled distributed systems | BibTeX data for Pascal−m: a language for the design of loosely coupled distributed systems

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.

Details about Petri Nets‚ Discrete Physics‚ and Distributed Quantum Computation | BibTeX data for Petri Nets‚ Discrete Physics‚ and Distributed Quantum Computation | Download  (pdf) of Petri Nets‚ Discrete Physics‚ and Distributed Quantum Computation

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.

Details about Physical Traces: Quantum vs. Classical Information Processing | BibTeX data for Physical Traces: Quantum vs. Classical Information Processing | Download (pdf) of Physical Traces: Quantum vs. Classical Information Processing

Physics from Computer Science

S. Abramsky and B. Coecke

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

Details about Physics from Computer Science | BibTeX data for Physics from Computer Science | Download  (pdf) of Physics from Computer Science

Possibilities determine the combinatorial structure of probability polytopes

Samson Abramsky‚ Rui Soares Barbosa‚ Kohei Kishida‚ Raymond Lal and Shane Mansfield

In Journal of Mathematical Psychology‚ Special Issue on Foundations of Probability (in press). 2016.

E−print: arXiv:1603.07735 [quant−ph]

Details about Possibilities determine the combinatorial structure of probability polytopes | BibTeX data for Possibilities determine the combinatorial structure of probability polytopes | DOI (10.1016/j.jmp.2016.03.006) | Link to Possibilities determine the combinatorial structure of probability polytopes

Proceedings of TAPSOFT 91

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

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

Details about Proceedings of TAPSOFT 91 | BibTeX data for Proceedings of TAPSOFT 91

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.

Details about Process Realizability | BibTeX data for Process Realizability | Download  (ps.gz) of Process Realizability

Proofs as Processes

S. Abramsky

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

Details about Proofs as Processes | BibTeX data for Proofs as Processes | Download  (ps) of Proofs as Processes

Quantales‚ Observational Logic and Process Semantics

S. Abramsky and S. J. Vickers

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

Details about Quantales‚ Observational Logic and Process Semantics | BibTeX data for Quantales‚ Observational Logic and Process Semantics | Download  (ps) of Quantales‚ Observational Logic and Process Semantics

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.

Details about Reasoning about concurrent systems: a functional approach | BibTeX data for Reasoning about concurrent systems: a functional approach

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.

Details about Retracing some paths in process algebra | BibTeX data for Retracing some paths in process algebra | Download  (ps.gz) of Retracing some paths in process algebra

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.

Details about Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics | BibTeX data for Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics | Download (pdf) of Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics

Semantic Foundations for Applicative Multiprogramming

S. Abramsky

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

Details about Semantic Foundations for Applicative Multiprogramming | BibTeX data for Semantic Foundations for Applicative Multiprogramming

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.

Details about Semantics of Interaction: an introduction to Game Semantics | BibTeX data for Semantics of Interaction: an introduction to Game Semantics | Download  (pdf) of Semantics of Interaction: an introduction to Game Semantics

Sequentiality vs. concurrency in games and logic

S. Abramsky

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

Details about Sequentiality vs. concurrency in games and logic | BibTeX data for Sequentiality vs. concurrency in games and logic | Download  (ps.gz) of Sequentiality vs. concurrency in games and logic

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.

Details about Socially Responsive‚ Environmentally Friendly Logic | BibTeX data for Socially Responsive‚ Environmentally Friendly Logic | Download  (pdf) of Socially Responsive‚ Environmentally Friendly Logic

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.

Details about Specification Structures and Propositions−as−Types for Concurrency | BibTeX data for Specification Structures and Propositions−as−Types for Concurrency | Download  (ps) of Specification Structures and Propositions−as−Types for Concurrency

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.

Details about Specifying Processes | BibTeX data for Specifying Processes | Download  (ps) of Specifying Processes

Strictness Analysis and Polymorphic Invariance

S. Abramsky

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

Details about Strictness Analysis and Polymorphic Invariance | BibTeX data for Strictness Analysis and Polymorphic Invariance

Strictness Analysis for Higher Order Functions

G. Burn‚ C. Hankin and S. Abramsky

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

Details about Strictness Analysis for Higher Order Functions | BibTeX data for Strictness Analysis for Higher Order Functions

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.

Details about Temperley−Lieb algebra: From knot theory to logic and computation via quantum mechanics | BibTeX data for Temperley−Lieb algebra: From knot theory to logic and computation via quantum mechanics | Download  (pdf) of Temperley−Lieb algebra: From knot theory to logic and computation via quantum mechanics

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

Details about The Handbook of Logic in Computer Science | BibTeX data for The Handbook of Logic in Computer Science

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.

Details about The Sheaf−Theoretic Structure of Non−Locality and Contextuality | BibTeX data for The Sheaf−Theoretic Structure of Non−Locality and Contextuality | DOI (10.1088/1367-2630/13/11/113036) | Link to The Sheaf−Theoretic Structure of Non−Locality and Contextuality

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.

Details about The Theory of Strictness Analysis for Higher Order Functions | BibTeX data for The Theory of Strictness Analysis for Higher Order Functions

The cohomology of non−locality and contextuality

Samson Abramsky‚ Shane Mansfield and Rui Soares Barbosa

In Bart Jacobs‚ Peter Selinger and Bas Spitters, editors, Proceedings of 8th International Workshop on Quantum Physics and Logic (QPL 2011). Vol. 95 of Electronic Proceedings in Theoretical Computer Science. Pages 1–14. 2012.

E−print: arXiv:1111.3620 [quant−ph]

Details about The cohomology of non−locality and contextuality | BibTeX data for The cohomology of non−locality and contextuality | DOI (10.4204/EPTCS.95.1) | Download (pdf) of The cohomology of non−locality and contextuality

The quantum monad on relational structures

Samson Abramsky‚ Rui Soares Barbosa‚ Nadish de Silva and Octavio Zapata

In Kim G. Larsen‚ Hans L. Bodlaender and Jean−François Raskin, editors, Proceedings of 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Vol. 83 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 35:1–35:19. Dagstuhl‚ Germany. 2017. Schloss Dagstuhl–Leibniz−Zentrum für Informatik.

E−print: arXiv:1705.07310 [cs.LO]

Details about The quantum monad on relational structures | BibTeX data for The quantum monad on relational structures | DOI (10.4230/LIPIcs.MFCS.2017.35) | Link to The quantum monad on relational structures

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.

Details about What are the fundamental structures of concurrency? We still don't know! | BibTeX data for What are the fundamental structures of concurrency? We still don't know! | Download  (pdf) of What are the fundamental structures of concurrency? We still don't know!

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.

Details about What are the fundamental structures of concurrency? We still don't know! | BibTeX data for What are the fundamental structures of concurrency? We still don't know! | Download  (pdf) of What are the fundamental structures of concurrency? We still don't know!

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.

Details about Coalgebras‚ chu spaces‚ and representations of physical systems | BibTeX data for Coalgebras‚ chu spaces‚ and representations of physical systems | DOI (10.1109/LICS.2010.35) | Link to Coalgebras‚ chu spaces‚ and representations of physical systems

From CSP to Game Semantics

S. Abramsky

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

Details about From CSP to Game Semantics | BibTeX data for From CSP to Game Semantics

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.

Details about From IF to BI: A tale of dependence and separation () | BibTeX data for From IF to BI: A tale of dependence and separation () | Link to From IF to BI: A tale of dependence and separation ()

Game Semantics for Access Control

S. Abramsky and R. Jagadeesan

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

Details about Game Semantics for Access Control | BibTeX data for Game Semantics for Access Control

Introduction to categories and categorical logic

S. Abramsky and N. Tzevelekos

In New Structures for Physics. Springer. 2010.

Details about Introduction to categories and categorical logic | BibTeX data for Introduction to categories and categorical logic

Robin Milner's Work on Concurrency

S. Abramsky

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

Details about Robin Milner's Work on Concurrency | BibTeX data for Robin Milner's Work on Concurrency

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.

Details about SECD−M: a virtual machine for applicative multiprogramming | BibTeX data for SECD−M: a virtual machine for applicative multiprogramming

The Lazy λ−Calculus

S. Abramsky

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

Details about The Lazy λ−Calculus | BibTeX data for The Lazy λ−Calculus | Download  (pdf) of The Lazy λ−Calculus