@techreport{RR-09-11,
  abstract = "We revisit our earlier work on the representation of quantum systems as Chu spaces, and investigate the use of coalgebra as an alternative framework. On the one hand, coalgebras allow the dynamics of repeated measurement to be captured, and provide mathematical tools such as final coalgebras, bisimulation and coalgebraic logic. However, the standard coalgebraic framework does not accommodate contravariance, and is too rigid to allow physical symmetries to be represented. We introduce a fibrational structure on coalgebras in which contravariance is represented by indexing. We use this structure to give a universal semantics for quantum systems based on a final coalgebra construction. We characterize equality in this semantics as projective equivalence. We also define an analogous indexed structure for Chu spaces, and use this to obtain a novel categorical description of the category of Chu spaces. We use the indexed structures of Chu spaces and coalgebras over a common base to define a truncation functor from coalgebras to Chu spaces. This truncation functor is used to lift the full and faithful representation of the groupoid of physical symmetries on Hilbert spaces into Chu spaces, obtained in our previous work, to the coalgebraic semantics.",
  author = "Samson Abramsky",
  institution = "OUCL",
  month = "October",
  number = "RR-09-11",
  pages = "26",
  title = "Coalgebras, Chu Spaces, and Representations of Physical Systems",
  year = "2009",
}


    
      @techreport{RR-09-08,
  abstract = "We pursue a model-oriented rather than axiomatic approach to the foundations of Quantum Mechanics, with the idea that new models can often suggest new axioms. This approach has often been fruitful in Logic and Theoretical Computer Science. Rather than seeking to construct a simplified toy model, we aim for a 'big toy model', in which both quantum and classical systems can be faithfully represented&emdash;as well as, possibly, more exotic kinds of systems. To this end, we show how Chu spaces can be used to represent physical systems of various kinds. In particular, we show how quantum systems can be represented as Chu spaces over the unit interval in such a way that the Chu morphisms correspond exactly to the physically meaningful symmetries of the systems&emdash;the unitaries and antiunitaries. In this way we obtain a full and faithful functor from the groupoid of Hilbert spaces and their symmetries to Chu spaces. We also consider whether it is possible to use a finite value set rather than the unit interval; we show that two values do not suffice, but three do. We also show a connection between Chu spaces and coalgebras, and make some comparisons between the two frameworks.",
  author = "Samson Abramsky",
  institution = "OUCL",
  month = "September",
  number = "RR-09-08",
  pages = "19",
  title = "Big Toy Models: Representing Physical Systems As Chu Spaces",
  year = "2009",
}


    
      @inproceedings{Mon08,
  author = "Samson Abramsky",
  booktitle = "Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday.",
  editor = "Pierpaolo Degano and Rocco De Nicola and Jose Meseguer",
  pages = "527--543",
  publisher = "Springer",
  series = "Lecture Notes in Computer Science",
  title = "Petri Nets, Discrete Physics, and Distributed Quantum Computation",
  volume = "5065",
  year = "2008",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'booktitle' field 
@inproceedings{TLG07,
  author = "Samson Abramsky",
  editor = "J. van Bentham and D. Gabbay and B. Lowe",
  journal = "Interactive Logic",
  pages = "11--48",
  publisher = "Amsterdam University Press",
  series = "Texts in Logic and Games",
  title = "A Compositional Game Semantics for Multi-Agent Logics of Partial Information",
  volume = "1",
  year = "2007",
}


    
      @inproceedings{paper84,
  author = "S. Abramsky and B. Coecke",
  booktitle = "International Journal of Unconventional Computing",
  number = "3",
  pages = "179-197",
  title = "Physics from Computer Science",
  volume = "3",
  year = "2007",
}


    
      @inproceedings{paper85,
  author = "S. Abramsky",
  booktitle = "Mathematics of Quantum Computing and Technology",
  editor = "Goong Chen and Louis Kauffman and Sam Lomonaco",
  pages = "415-458",
  publisher = "Taylor and Francis",
  title = "Temperley-Lieb algebra: From knot theory to logic and computation via quantum mechanics",
  year = "2007",
}


    
      @inproceedings{paper83,
  author = "S. Abramsky",
  booktitle = "Plotkin Festschrift",
  pages = "33-67",
  series = "Electronic Notes in Theoretical Computer Science",
  title = "Event Domains, Stable Functions and Proof Nets",
  volume = "172",
  year = "2007",
}


    
      @inproceedings{paper81,
  author = "S. Abramsky and R. Duncan",
  booktitle = "Mathematical Structures in Computer Science, 16",
  pages = "469-489",
  title = "A Categorical Quantum Logic",
  year = "2006",
}


    
      @inproceedings{paper82,
  author = "S. Abramsky",
  booktitle = "Electronic Notes in Theoretical Computer Science, 162",
  pages = "37-41",
  title = "What are the fundamental structures of concurrency? We still don't know!",
  year = "2006",
}


    
      @inproceedings{paper80,
  author = "S. Abramsky",
  booktitle = "Truth and Games: Essays in Honour of Gabriel Sandu",
  editor = "Aho, Tuomo and Ahti-Veikko Pietarinen",
  pages = "17-46",
  publisher = "Acta Philosophica Fennica, Societas Philosophicas Fennica, Helsinki",
  title = "Socially Responsive, Environmentally Friendly Logic",
  year = "2006",
}


    
      @inproceedings{paper75,
  author = "S. Abramsky and M. Lenisa",
  booktitle = "Annals of Pure and Applied Logic",
  pages = "122-168",
  title = "Linear realizability and full completeness for typed lambda-calculi",
  volume = "134",
  year = "2005",
}


    
      @inproceedings{paper73,
  author = "S. Abramsky and R. Jagadeesan",
  booktitle = "Annals of Pure and Applied Logic",
  pages = "3-37",
  title = "A Game Semantics for Generic Polymorphism",
  volume = "133",
  year = "2005",
}


    
      @inproceedings{paper74,
  author = "S. Abramsky and B. Coecke",
  booktitle = "Theory and Applications of Categories",
  pages = "111-124",
  title = "Abstract Physical Traces",
  volume = "14",
  year = "2005",
}


    
      @inproceedings{paper79,
  author = "S. Abramsky",
  booktitle = "Theoretical Computer Science",
  number = "3",
  pages = "441-464",
  title = "A Structural Approach To Reversible Computation",
  volume = "347",
  year = "2005",
}


    
      @inproceedings{paper78,
  author = "S. Abramsky",
  booktitle = "We Will Show Them: Essays in honour of Dov Gabbay",
  editor = "Sergei Artemov and Howard Barringer and Artur d'Avila Garcez and Luis C. Lamb and John Woods",
  pages = "1-18",
  publisher = "College Publications",
  title = "A Cook's Tour of the Finitary Non-Well-Founded Sets",
  volume = "1",
  year = "2005",
}


    
      @inproceedings{paper77,
  author = "S. Abramsky",
  booktitle = "Proceedings of {CALCO} 2005",
  pages = "1-31",
  series = "Springer Lecture Notes in Computer Science",
  title = "Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories",
  volume = "3629",
  year = "2005",
}


    
      @inproceedings{paper76,
  author = "S. Abramsky",
  booktitle = "Algebraic process calculi: the first 25 years and beyond",
  month = "June",
  pages = "1-5",
  series = "{BRICS} Notes Series NS-05-03",
  title = "What are the fundamental structures of concurrency? We still don't know!",
  year = "2005",
}


    
      @techreport{RR-04-02,
  abstract = "We study quantum information and computation from a novel point of view. Our approach is based on recasting the standard axiomatic presentation of quantum mechanics, due to von Neumann, at a more abstract level, of compact closed categories with biproducts. We show how the essential structures found in key quantum information protocols such as teleportation, logic-gate teleportation, and entanglement-swapping can be captured at this abstract level. Moreover, from the combination of the --apparently purely qualitative-- structures of compact closure and biproducts there emerge 'scalars' and a 'Born rule'. This abstract and structural point of view opens up new possibilities for describing and reasoning about quantum systems. It also shows the degrees of axiomatic freedom: we can show what requirements are placed on the (semi)ring of scalars C(I,I), where C is the category and I is the tensor unit, in order to perform various protocols such as teleportation. Our formalism captures both the information-flow aspect of the protocols (see quant-ph/0402014), and the branching due to quantum indeterminism. This contrasts with the standard accounts, in which the classical information flows are 'outside' the usual quantum-mechanical formalism.",
  author = "Samson Abramsky and Bob Coecke",
  institution = "Oxford University Computing Laboratory",
  month = "February",
  number = "RR-04-02",
  title = "A Categorical semantics of Quantum Protocols",
  year = "2004",
}


    
      @inproceedings{paper69,
  author = "S. Abramsky and D. Ghica and L. Ong and A. Murawski",
  booktitle = "{TACAS 2004}: Tools and Algorithms for the Construction and Analysis of Systems, 10 International Conference",
  pages = "421-435",
  publisher = "Springer {LNCS}",
  title = "Applying Game Semantics to Compositional Software Modelling and verification",
  volume = "2988",
  year = "2004",
}


    
      @inproceedings{paper70,
  author = "S. Abramsky and D. Ghica and A. Murawski and C.-H. Ong and I. Stark",
  booktitle = "Proceedings of the 19th Annual {IEEE} Symposium on Logic in Computer Science: LICS 2004",
  pages = "150-159",
  publisher = "{IEEE} Computer Society",
  title = "Nominal games and Full Abstraction for the Nu-Calculus",
  year = "2004",
}


    
      @inproceedings{paper72,
  author = "S. Abramsky and B. Coecke",
  booktitle = "Proceedings of the 19th Annual {IEEE} Symposium on Logic in Computer Science: {LICS} 2004",
  pages = "415-425",
  publisher = "{IEEE} Computer Society",
  title = "A Categorical Semantics of Quantum Protocols",
  year = "2004",
}


    
      @inproceedings{paper71,
  author = "S. Abramsky",
  booktitle = "Proceedings of the 19th Annual {IEEE} Symposium on Logic in Computer Science: {LICS} 2004",
  pages = "410-414",
  publisher = "{IEEE} Computer Society",
  title = "High-Level Methods for Quantum Computation and Information",
  year = "2004",
}


    
      @techreport{RR-03-02,
  abstract = "<p>Genericity is the idea that the same program can work at many different data types. Longo, Milsted and Soloviev proposed to capture the inability of generic programs to probe the structure of their instances by the following equational principle: if two generic programs, viewed as terms of type forall X. A[X], are equal at any given instance A[T], then they are equal at all instances. They proved that this rule is admissible in a certain extension of System F, but finding a semantically motivated model satisfying this principle remained an open problem.</p><p>In the present paper, we construct a categorical model of polymorphism, based on game semantics, which contains a large collection of generic types. This model builds on two novel constructions:</p><p>1. A direct interpretation of variable types as games, with a natural notion of substitution of games. This allows moves in games A[T] to be decomposed into the generic part from A, and the part pertaining to the instance T. This leads to a simple and natural notion of generic strategy.</p><p>2. A &quot;relative polymorphic product&quot; Pi_i(A, B) which expresses quantification over the type variable X_i in the variable type A with respect to a &quot;universe&quot; which is explicitly given as an additional parameter B. We then solve a recursive equation involving this relative product to obtain a universe in a suitably &quot;absolute&quot; sense.</p><p>Full Completeness for ML types (universal closures of quantifier-free types) is proved for this model.</p>",
  author = "Samson Abramsky and Radha Jagadeesan",
  institution = "Oxford University Computing Laboratory",
  month = "January",
  number = "RR-03-02",
  title = "A game semantics for generic polymorphism",
  year = "2003",
}


    
      @inproceedings{paper66,
  author = "S. Abramsky and R. Jagadeesan",
  booktitle = "Foundations of Software Science and Computational Structures, 6th International Conference, {FOSSACS} 2003",
  editor = "A. D. Gordon",
  pages = "1-22",
  series = "Springer Lecture Notes in Computer Science",
  title = "A Game semantics for Generic Polymorphism",
  volume = "2620",
  year = "2003",
}


    
      @inproceedings{paper68,
  author = "S. Abramsky and D. R. Ghica and L. Ong and A. Murawski",
  booktitle = "Proceedings of {SAVBCS} 2003: Specification and Verification of Component-Based Systems, Workshop at {ESEC/FASE} 2003",
  note = "published as Technical Report 03-11, Department of Computer Science, Iowa State University",
  pages = "66-74",
  title = "Algorithmic Game Semantics and Component-Based Verification",
  url = "http://www.cs.iastate.edu/~leavens/SAVBCS/2003/papers/SAVCBS03.pdf",
  year = "2003",
}


    
      @inproceedings{paper65,
  author = "S. Abramsky and B. Coecke",
  booktitle = "Electronic Notes in Theoretical Computer Science",
  pages = "1-26",
  title = "Physical Traces: Quantum vs. Classical Information Processing",
  url = "http://www1.elsevier.com/gej-ng/31/29/23/131/23/24/69002.pdf",
  volume = "69",
  year = "2003",
}


    
      @inproceedings{paper67,
  author = "S. Abramsky",
  booktitle = "Mathematical Structures in Computer Science",
  pages = "531-565",
  title = "Sequentiality vs. concurrency in games and logic",
  volume = "13",
  year = "2003",
}


    
      @inproceedings{paper64,
  author = "S. Abramsky and E. Haghverdi and P. Scott",
  booktitle = "Mathematical Structures in Computer Science",
  pages = "625-665",
  title = "Geometry of Interaction and linear combinatory algebras",
  volume = "12",
  year = "2002",
}


    
      @inproceedings{paper60,
  author = "B. Thomsen and S. Abramsky",
  booktitle = "Theoretical Computer Science",
  pages = "557-589",
  title = "A fully abstract denotational semantics for the calculus of higher-order communicating systems",
  volume = "254",
  year = "2001",
}


    
      @inproceedings{paper61,
  author = "S. Abramsky and M. Lenisa",
  booktitle = "CSL 2001 Conference Proceedings",
  pages = "442-457",
  series = "Springer {LNCS}",
  title = "Fully Complete Minimal {PER} Models for the Simply Typed {\lambda}-calculus",
  volume = "2142",
  year = "2001",
}


    
      @inproceedings{paper63,
  author = "S. Abramsky",
  booktitle = "Proceedings of the {NATO} Advanced Study Institute, Marktober- dorf",
  chapter = "Proof and System Reliability",
  editor = "H. Schichtenberg and R. Steinbr{\"u}ggen",
  pages = "21-47",
  publisher = "Kluwer Academic Publishers",
  title = "Algorithmic Game Semantics: A Tutorial Introduction",
  year = "2001",
}


    
      @inproceedings{paper62,
  author = "S. Abramsky",
  booktitle = "LCCS 2001: Proceedings of the International Workshop on Logic and Complexity in Computer Science",
  editor = "D. Beauquier and Y. Matiyasevich",
  pages = "1-16",
  series = "LACL",
  title = "A Structural Approach to Reversible Computation",
  year = "2001",
}


    
      @book{book4,
  editor = "S. Abramsky and D. Gabbay and T. S. E. Maibaum",
  note = "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",
  publisher = "Oxford University Press",
  title = "The Handbook of Logic in Computer Science",
  year = "2000",
}


    
      @inproceedings{paper59,
  author = "S. Abramsky and M. Lenisa",
  booktitle = "Proceedings of the International Symposium on Mathematical Foundations of Computer Science",
  editor = "M. Nielsen and B. Rovan",
  pages = "141-151",
  publisher = "Springer-Verlag",
  series = "Springer Lecture Notes in Computer Science",
  title = "Axiomatizing Fully Complete Models for {ML} Polymorphic Types",
  volume = "1893",
  year = "2000",
}


    
      @inproceedings{paper58,
  author = "S. Abramsky and M. Lenisa",
  booktitle = "Proceedings of the Fourteenth International Workshop on Computer Science Logic",
  editor = "P. Clote and H. Schwichtenberg",
  pages = "140-155",
  publisher = "Springer-Verlag",
  series = "Springer Lecture Notes in Computer Science",
  title = "A Fully Complete {PER} Model for {ML} Polymorphic Types",
  volume = "1862",
  year = "2000",
}


    
      @inproceedings{paper57,
  author = "S. Abramsky and R. Jagadeesan and P. Malacaria",
  booktitle = "Information and Computation",
  pages = "409-470",
  title = "Full Abstraction for {PCF}",
  volume = "163",
  year = "2000",
}


    
      @inproceedings{paper56,
  author = "S. Abramsky",
  booktitle = "Millennial Perspectives in Computer Science",
  editor = "J. Davies, A. W. Roscoe and J. Woodcock",
  pages = "1-12",
  publisher = "Palgrave",
  title = "Concurrent Interaction Games",
  year = "2000",
}


    
      @inproceedings{paper55,
  author = "S. Abramsky",
  booktitle = "Foundations of Secure Computation: Proceedings of the 1999 Marktoberdorf Summer School",
  editor = "F. L. Bauer and R. Steinbr{\"u}ggen",
  pages = "167-180",
  publisher = "{IOS} Press",
  title = "Process Realizability",
  year = "2000",
}


    
      @inproceedings{paper54,
  author = "S. Abramsky and P.-A. Melli{\'e}s",
  booktitle = "Proceedings of the Fourteenth International Symposium on Logic in Computer Science",
  pages = "431-442",
  publisher = "Computer Society Press of the {IEEE}",
  title = "Concurrent Games and Full Completeness",
  year = "1999",
}


    
      @inproceedings{paper52,
  author = "S. Abramsky and G. McCusker",
  booktitle = "Theoretical Computer Science",
  pages = "3-42",
  title = "Full Abstraction for Idealized Algol with passive expressions",
  volume = "227",
  year = "1999",
}


    
      @inproceedings{paper49,
  author = "S. Abramsky and G. McCusker",
  booktitle = "Computational Logic: Proceedings of the 1997 Marktoberdorf Summer School",
  editor = "H. Schwichtenberg and U. Berger",
  pages = "1-56",
  publisher = "Springer-Verlag",
  title = "Game Semantics",
  year = "1999",
}


    
      @inproceedings{paper51,
  author = "S. Abramsky and S. J. Gay and R. Nagarajan",
  booktitle = "Theoretical Computer Science",
  pages = "1-53",
  title = "A Specification Structure for Deadlock-freedom of Synchronous Processes",
  volume = "222",
  year = "1999",
}


    
      @inproceedings{paper50,
  author = "S. Abramsky and R. Blute and P. Panangaden",
  booktitle = "J. Pure and Applied Algebra",
  pages = "3-47",
  title = "Nuclear and trace ideals in tensored {*-categories}",
  volume = "143",
  year = "1999",
}


    
      @inproceedings{paper48,
  author = "S. Abramsky",
  booktitle = "Essays in Honour of Robin Milner",
  editor = "G. Plotkin and M. Tofte and C. Stirling",
  pages = "55-75",
  publisher = "MIT Press",
  title = "Axioms for Definability and Full Completeness",
  year = "1999",
}


    
      @inproceedings{paper46,
  author = "S. Abramsky and G. McCusker",
  booktitle = "Proceedings of the Eleventh International Workshop on Computer Science Logic",
  editor = "M. Nielsen and W. Thomas",
  pages = "1-17",
  publisher = "Springer-Verlag",
  series = "Springer Lecture Notes in Computer Science",
  title = "Call-by-value games",
  volume = "1414",
  year = "1998",
}


    
      @inproceedings{paper47,
  author = "S. Abramsky and K. Honda and G. McCusker",
  booktitle = "Proceedings of the Thirteenth International Symposium on Logic in Computer Science",
  pages = "334-344",
  publisher = "Computer Society Press of the IEEE",
  title = "A fully abstract game semantics for general references",
  year = "1998",
}


    
      @inproceedings{paper42,
  author = "S. Abramsky and D. Pavlovic",
  booktitle = "Proceedings of the International Symposium on Category Theory In Computer Science",
  editor = "E. Moggi and G. Rosolini",
  pages = "147-158",
  publisher = "Springer-Verlag",
  series = "Springer Lecture Notes in Computer Science",
  title = "Specifying Processes",
  volume = "1290",
  year = "1997",
}


    
      @inproceedings{paper41,
  author = "S. Abramsky and G. McCusker",
  booktitle = "Algol-like Languages",
  editor = "P. O'Hearn and R. D. Tennent",
  pages = "317-348",
  publisher = "Birkhauser",
  title = "Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol",
  year = "1997",
}


    
      @inproceedings{paper44,
  author = "S. Abramsky and S. Gay and R. Nagarajan",
  booktitle = "Theoretical Aspects of Computer Software",
  editor = "M. Abadi and T. Ito",
  pages = "295-320",
  publisher = "Springer-Verlag",
  series = "Springer Lecture Notes in Computer Science",
  title = "A Type-theoretic Approach to Deadlock-freedom of Asynchronous Systems",
  volume = "1281",
  year = "1997",
}


    
      @inproceedings{paper45,
  author = "S. Abramsky",
  booktitle = "Proceedings of the 11th Amsterdam Colloquium",
  editor = "P. Dekker and M. Stokhof and Y. Venema",
  pages = "1-6",
  publisher = "ILLC, Dept. of Philosophy, University of Amsterdam",
  title = "Games in the Semantics of Programming Languages",
  year = "1997",
}


    
      @inproceedings{paper43,
  author = "S. Abramsky",
  booktitle = "22nd International Symposium on Mathematical Foundations of Computer Science",
  editor = "I. Privara and P. Ruzicka",
  pages = "3-4",
  publisher = "Springer-Verlag",
  series = "Springer Lecture Notes in Computer Science",
  title = "Game Semantics for Programming Languages",
  volume = "1295",
  year = "1997",
}


    
      @inproceedings{paper40,
  author = "S. Abramsky",
  booktitle = "Proceedings of the 1996 {CLiCS} Summer School, Isaac Newton Institute",
  editor = "P. Dybjer and A. Pitts",
  pages = "1-31",
  publisher = "Cambridge University Press",
  title = "Semantics of Interaction: an introduction to Game Semantics",
  year = "1997",
}


    
      @inproceedings{paper38,
  author = "S. Abramsky and S. Gay and R. Nagarajan",
  booktitle = "Logics for Concurrency: Structure vs. Automata---Proceedings of the VI I Ith Banff Higher Order Workshop",
  editor = "G. Birtwistle and F. Moller",
  pages = "5-40",
  publisher = "Springer-Verlag",
  title = "Specification Structures and Propositions-as-Types for Concurrency",
  year = "1996",
}


    
      @inproceedings{paper37,
  author = "S. Abramsky and S. Gay and R. Nagarajan",
  booktitle = "Proceedings of the 1994 Marktoberdorf Summer Sxhool on Deductive Program Design",
  editor = "M. Broy",
  pages = "35-113",
  publisher = "Springer-Verlag",
  title = "Interaction Categories and the Foundations of Typed Concurrent Programming",
  year = "1996",
}


    
      @inproceedings{paper39,
  author = "S. Abramsky",
  booktitle = "{CONCUR '96}: Concurrency Theory, 7th International Conference",
  editor = "U. Montanari and V. Sassone",
  pages = "1-17",
  publisher = "Springer-Verlag",
  title = "Retracing some paths in process algebra",
  year = "1996",
}


    
      @inproceedings{paper36,
  author = "S. Abramsky and G. McCusker",
  booktitle = "Proceedings of the 1994 Workshop on Theory and Formal Methods",
  editor = "C. L. Hankin",
  pages = "1-20",
  publisher = "Imperial College Press",
  title = "Games for recursive types",
  year = "1995",
}


    
      @inproceedings{paper35,
  author = "S. Abramsky and G. McCusker",
  booktitle = "Proceedings of the Tenth Annual Symposium on Logic in Computer Science",
  editor = "D. Kozen",
  pages = "234-243",
  publisher = "IEEE Computer Society Press",
  title = "Games and Full Abstraction for the Lazy {\lambda}-calculus",
  year = "1995",
}


    
      @inproceedings{paper30,
  author = "S. Abramsky and A. Jung",
  booktitle = "Handbook of Logic in Computer Science",
  editor = "S. Abramsky and D. Gabbay and T. S. E. Maibaum",
  pages = "1-168",
  publisher = "Oxford University Press",
  title = "Domain Theory",
  year = "1994",
}


    
      @inproceedings{paper34,
  author = "S. Abramsky and R. Jagadeesan and P. Malacaria",
  booktitle = "Theoretical Aspects of Computer Software",
  editor = "M. Hagiya and J. C. Mitchell",
  pages = "1-15",
  publisher = "Springer-Verlag",
  title = "Full Abstraction for {PCF} (Extended Abstract)",
  year = "1994",
}


    
      @inproceedings{paper32,
  author = "S. Abramsky and R. Jagadeesan",
  booktitle = "Journal of Symbolic Logic",
  number = "2",
  pages = "543-574",
  title = "Games and Full Completeness for Multiplicative Linear Logic",
  volume = "59",
  year = "1994",
}


    
      @inproceedings{paper31,
  author = "S. Abramsky and R. Jagadeesan",
  booktitle = "Information and Computation, 111(1)",
  pages = "53-119",
  title = "New Foundations for the Geometry of Interaction",
  year = "1994",
}


    
      @inproceedings{paper33,
  author = "S. Abramsky",
  booktitle = "J. Theoretical Computer Science",
  pages = "5-9",
  title = "Proofs as Processes",
  volume = "135",
  year = "1994",
}


    
      @inproceedings{paper29,
  author = "S. Abramsky",
  booktitle = "A Classical Mind: Essays in honour of C. A. R. Hoare",
  editor = "A. W. Roscoe",
  pages = "1-16",
  publisher = "Prentice Hall International",
  title = "Interaction Categories and Communicating Sequential Processes",
  year = "1994",
}


    
      @inproceedings{paper27,
  author = "I. Mackie and L. Roman and S. Abramsky",
  booktitle = "Journal of Applied Categorical Structures",
  pages = "311-343",
  title = "An Internal Language for Autonomous Categories",
  volume = "1",
  year = "1993",
}


    
      @inproceedings{paper26,
  author = "A. Finkelstein and J. Kramer and S. Abramsky and K. Broda and S. Drossopoulou and S. Eisenbach",
  booktitle = "Computer Journal, 36(4)",
  pages = "320-334",
  title = "An Integrated Engineering Study Scheme in Computing",
  year = "1993",
}


    
      @inproceedings{paper24,
  author = "S. Abramsky and S. J. Vickers",
  booktitle = "Mathematical Structures in Computer Science",
  pages = "161-227",
  title = "Quantales, Observational Logic and Process Semantics",
  volume = "3",
  year = "1993",
}


    
      @inproceedings{paper23,
  author = "S. Abramsky and C.-H. L. Ong",
  booktitle = "Information and Computation, 105(2)",
  pages = "159-268",
  title = "Full Abstraction in the Lazy {\lambda}-calculus",
  year = "1993",
}


    
      @inproceedings{paper28,
  author = "S. Abramsky",
  booktitle = "Theory and Formal Methods 1993",
  editor = "G. L. Burn and S. J. Gay and M. D. Ryan",
  pages = "57-69",
  publisher = "Springer-Verlag",
  title = "Interaction Categories (Extended Abstract)",
  year = "1993",
}


    
      @inproceedings{paper25,
  author = "S. Abramsky",
  booktitle = "J. Theoretical Computer Science, 111",
  pages = "3-57",
  title = "Computational Interpretations of Linear logic",
  year = "1993",
}


    
      @inproceedings{paper22,
  author = "S. Abramsky and R. Jagadeesan",
  booktitle = "Foundations of Software Technology and Theoretical Computer Science",
  editor = "R. Shyamsundar",
  pages = "291-301",
  publisher = "Springer-Verlag",
  title = "Games and Full Completeness for Multiplicative Linear Logic",
  year = "1992",
}


    
      @inproceedings{paper21,
  author = "S. Abramsky and R. Jagadeesan",
  booktitle = "Symposium on Logic in Computer Science",
  pages = "211-222",
  publisher = "Computer Society Press of the {IEEE}",
  title = "New Foundations for the Geometry of Interaction",
  year = "1992",
}


    
      @book{book3,
  editor = "S. Abramsky and T. S. E. Maibaum",
  publisher = "Springer Lecture Notes in Computer Science",
  title = "Proceedings of {TAPSOFT} 91",
  volume = "493-494",
  year = "1991",
}


    
      @inproceedings{paper20,
  author = "S. Abramsky and T. Jensen",
  booktitle = "{ACM} Symposium on Principles of Programming Languages",
  pages = "49-55",
  publisher = "{ACM} Press",
  title = "A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions",
  year = "1991",
}


    
      @inproceedings{paper19,
  author = "S. Abramsky",
  booktitle = "J. Information and Computation",
  number = "2",
  pages = "161-218",
  title = "A Domain Equation for Bisimulation",
  volume = "92",
  year = "1991",
}


    
      @inproceedings{paper18,
  author = "S. Abramsky",
  booktitle = "Annals of Pure and Applied Logic",
  pages = "1-77",
  title = "Domain Theory in Logical Form",
  volume = "51",
  year = "1991",
}


    
      @inproceedings{paper17,
  author = "S. Abramsky",
  booktitle = "Symposium on Mathematical Foundations of Programming Language Semantics",
  editor = "M. Mislove",
  pages = "1-21",
  publisher = "Springer-Verlag",
  title = "A Generalized Kahn Principle for Abstract Asynchronous Networks",
  year = "1990",
}


    
      @inproceedings{paper16,
  author = "S. Abramsky",
  booktitle = "J. Logic and Computation, 1(1)",
  pages = "5-41",
  title = "Abstract Interpretation, Logical Relations and Kan Extensions",
  year = "1990",
}


    
      @inproceedings{paper15,
  author = "S. Abramsky",
  booktitle = "Research Topics in Functional Programming",
  editor = "D. Turner",
  pages = "65-117",
  publisher = "Addison Wesley",
  title = "{The Lazy {\lambda}-Calculus}",
  year = "1990",
}


    
      @inproceedings{paper14,
  author = "S. Abramsky",
  booktitle = "Logic at {Botik} 89",
  editor = "A. Meyer and M. Taitslin",
  publisher = "Springer-Verlag",
  title = "Observational Logic and Process Semantics (Abstract)",
  year = "1989",
}


    
      @inproceedings{paper13,
  author = "D. Fuller and S. Abramsky",
  booktitle = "New Generation Computing",
  pages = "119-143",
  title = "Partial evaluation and {MIX} compilation in {PROLOG}",
  volume = "6",
  year = "1988",
}


    
      Warning - the bibtex entry below may be invalid: 
Missing 'school' field
@phdthesis{AbramskyThesis,
  author = "Samson Abramsky",
  institution = "University of London",
  title = "Domain Theory and the Logic of Observable Properties",
  year = "1987",
}


    
      @book{book2,
  editor = "S. Abramsky and Chris Hankin",
  publisher = "Ellis Horwood",
  title = "Abstract Interpretation for Declarative Languages",
  year = "1987",
}


    
      @inproceedings{paper10,
  author = "S. Abramsky and C. Hankin",
  booktitle = "Abstract Interpretation for Declarative Languages",
  chapter = "1",
  editor = "S.Abramsky and C. Hankin",
  pages = "9-31",
  publisher = "Ellis Horwood",
  title = "Introduction to Abstract Interpretation",
  year = "1987",
}


    
      @inproceedings{paper12,
  author = "S. Abramsky",
  booktitle = "Symposium on Logic in Computer Science",
  pages = "47-53",
  publisher = "Computer Society Press of the {IEEE}",
  title = "Domain Theory in Logical Form",
  year = "1987",
}


    
      @inproceedings{paper11,
  author = "S. Abramsky",
  booktitle = "J. Theoretical Computer Science",
  chapter = "53",
  pages = "225-241",
  title = "Observation Equivalence as a Testing Equivalence",
  year = "1987",
}


    
      @book{book1,
  editor = "S. Abramsky and D. Pitt and A. Poign{\'e} and D. Rydeheard)",
  publisher = "Springer",
  title = "Category Theory and Computer Programming",
  year = "1986",
}


    
      @inproceedings{paper9,
  author = "G. Burn and C. Hankin and S. Abramsky",
  booktitle = "Programs as Data Objects",
  editor = "H. Ganzinger and N. Jones",
  pages = "42-62",
  publisher = "Springer-Verlag",
  title = "The Theory of Strictness Analysis for Higher Order Functions",
  year = "1986",
}


    
      @inproceedings{paper7,
  author = "G. Burn and C. Hankin and S. Abramsky",
  booktitle = "Science of Computer Programming 7",
  pages = "249-278",
  title = "Strictness Analysis for Higher Order Functions",
  year = "1986",
}


    
      @inproceedings{paper8,
  author = "S. Abramsky",
  booktitle = "Programs as Data Objects",
  editor = "H. Ganzinger and N. Jones",
  pages = "1-23",
  publisher = "Springer-Verlag",
  title = "Strictness Analysis and Polymorphic Invariance",
  year = "1986",
}


    
      @inproceedings{paper6,
  author = "S. Abramsky and R. Sykes",
  booktitle = "Functional Languages and Computer Architecture",
  editor = "J.-P. Jouannaud",
  pages = "81-98",
  publisher = "Springer-Verlag",
  title = "{SECD-M}: a virtual machine for applicative multiprogramming",
  year = "1985",
}


    
      @inproceedings{paper5,
  author = "S. Abramsky",
  booktitle = "Distributed Systems",
  editor = "F. Chambers and D. Duce and G. Jones",
  pages = "307-319",
  publisher = "Academic Press",
  title = "Reasoning about concurrent systems: a functional approach",
  year = "1984",
}


    
      @inproceedings{paper2,
  author = "S. Abramsky and R. Bornat",
  booktitle = "Distributed Computing Systems: Synchronization, Control and Coordination",
  editor = "Y. Paker and J.-P. Verjus",
  pages = "163-189",
  publisher = "Academic Press",
  title = "Pascal-m: a language for the design of loosely coupled distributed systems",
  year = "1983",
}


    
      @inproceedings{paper4,
  author = "S. Abramsky",
  booktitle = "Foundations of Computation Theory",
  editor = "M. Karpinski",
  pages = "1-13",
  publisher = "Springer-Verlag",
  title = "Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming",
  year = "1983",
}


    
      @inproceedings{paper3,
  author = "S. Abramsky",
  booktitle = "Automata, Languages and Programming",
  editor = "J. Diaz",
  pages = "1-14",
  publisher = "Springer-Verlag",
  title = "Semantic Foundations for Applicative Multiprogramming",
  year = "1983",
}


    
      @inproceedings{paper1,
  author = "S. Abramsky and S. Cook",
  booktitle = "Office Information Systems",
  editor = "N. Naffah",
  publisher = "North Holland",
  title = "Pascal-m in Office Information Systems",
  year = "1982",
}