
- Computational Interpretations of Linear Logic Samson Abramsky
- A Structural Approach to Reversible Computation Samson Abramsky
- Fully Complete Minimal PER Models for the Simply Typed -calculus ?
- A Game Semantics for Generic Polymorphism Samson Abramsky
- HighLevel Methods for Quantum Computation and Information Samson Abramsky
- Samson Abramsky Temperley-Lieb Algebra
- A Compositional Game Semantics for Multi-Agent Logics of Partial Information
- Games and Full Completeness for Multiplicative Linear Logic Samson Abramsky and Radha Jagadeesan
- Domain Theory and the Logic of Observable Samson Abramsky
- A fully abstract game semantics for general references Samson Abramsky Kohei Honda
- Electronic Notes in Theoretical Computer Science 3 (1996) URL: http://www.elsevier.nl/locate/entcs/volume3.html 13 pages
- CallbyValue Games Samson Abramsky 1 and Guy McCusker 2
- ALGORITHMIC GAME SEMANTICS A Tutorial Introduction
- Domain Theory Corrected and expanded version
- Games for recursive types Samson Abramsky and Guy McCusker
- A Typetheoretic Approach to Deadlockfreedom of Asynchronous Systems
- Sequentiality vs. Concurrency in Games and Logic Samson Abramsky
- Games in the Semantics of Programming Languages Samson Abramsky
- A Game Semantics for Generic Polymorphism Samson Abramsky 1? and Radha Jagadeesan 2??
- Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
- Axiomatizing Fully Complete Models for ML Polymorphic Types ?
- Deductive Program Design: Proceedings of the 1994 Marktoberdorf Summer School. NATO ASI Series F, SpringerVerlag, 1995.
- ducers i.e. Q, X,Y, q , #
- Specifying Interaction Categories D. Pavlovi'c \Lambda and S. Abramsky y
- Some basic topics in the theory of concurrency are studied from the point of view of denotational semantics, and particularly the \Domain theory in logical form" de-
- DOMAIN THEORY IN LOGICAL FORM (To appear in Proceedings of LICS `87)
- Process Realizability Samson Abramsky
- The Lazy Lambda Calculus Samson Abramsky
- Full Abstraction for Idealized Algol with Passive Expressions
- arXiv:quantph/0402130 A categorical semantics of quantum protocols
- What are the fundamental structures of concurrency? We still don't know!
- The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science
- Proofs as Processes Samson Abramsky
- Game Semantics Samson Abramsky
- From IF to BI A Tale of Dependence and Separation
- Socially Responsive, Environmentally Friendly Logic Samson Abramsky
- Programming Research Group GEOMETRY OF INTERACTION AND LINEAR
- Concurrent Games and Full Completeness Samson Abramsky
- Domain Theory In Logical Form Samson Abramsky
- Nominal Games and Full Abstraction for the Nu-Calculus S. Abramsky
- Nuclear and Trace Ideals in Tensored \LambdaCategories Samson Abramsky \Lambda
- Concurrent interaction games Samson Abramsky
- A Fully Complete PER Model for ML Polymorphic Types
- New Foundations for the Geometry of Interaction \Lambda Samson Abramsky Radha Jagadeesan
- Axioms for Definability and Full Completeness Samson Abramsky
- Math. Struct. in Computer Science (1993), vol. 3, pp. 161227 QUANTALES, OBSERVATIONAL LOGIC AND PROCESS
- A Specification Structure for DeadlockFreedom of Synchronous Processes
- Concurrent Games and Full Completeness Samson Abramsky
- A Generalized Kahn Principle for Abstract Asynchronous Samson Abramsky
- Specification Structures and PropositionsasTypes for Concurrency \Lambda
- Physics from Computer Science --a position statement --
- Domain Theory Corrected and expanded version
- ABSTRACT PHYSICAL TRACES SAMSON ABRAMSKY AND BOB COECKE
- Linear Realizability and Full Completeness for Typed Lambda-calculi
- The Lazy Lambda Calculus Samson Abramsky
- Full Abstraction for PCF1 Samson.Abramsky2
- Algorithmic Game Semantics and Component-Based Verification
- A Game Semantics for Generic Polymorphism Samson Abramsky
- A Cook's Tour of the Finitary Non-Well-Founded Sets Samson Abramsky
- A Structural Approach to Reversible Computation Samson Abramsky
- Under consideration for publication in Math. Struct. in Comp. Science A Categorical Quantum Logic