[an error occurred while processing this directive]<meta name="keywords" content="Department of Computer Science, publications, by type, Samson Abramsky"></meta><meta name="description" content="Publications, by type, Department of Computer Science, Oxford, Samson Abramsky"></meta><title>Department of Computer Science, University of Oxford: Samson Abramsky : Publications
</title><style type="text/css">
			  .btn-toolbar::after, .btn-toolbar::before
			  {
			    content: " ";
			    display: table;
			  }

			
			.btn-toolbar
			{
			    margin-bottom: 2em;
			}

			  .btn-toolbar::after, .btn-group::after
			  {
			    clear: both;
			  }


			.btn-toolbar .btn, .btn-toolbar .btn-group
			  {
			    float: left;
			}
			
			.btn-group
			  {
			    display: inline-block;
			    position: relative;
			    vertical-align: middle;
			}

			  .btn-group > .btn:first-child:not(:last-child)
			  {
			    border-bottom-right-radius: 0;
			    border-top-right-radius: 0;
			}
			
			.btn-group > .btn:first-child
			  {
			    margin-left: 0;
			}

			.btn-group > .btn
			  {
			    float: left;
			    position: relative;
			}

			  .btn-group > .btn:not(:first-child):not(:last-child)
			  {
			    border-radius: 0;
			}
			
			  .btn-group > .btn:last-child:not(:first-child)
			  {
			    border-bottom-left-radius: 0;
			    border-top-left-radius: 0;
			}
			
			.btn-group .btn + .btn, .btn-group .btn + .btn-group, .btn-group .btn-group + .btn, .btn-group .btn-group + .btn-group
			  {
			    margin-left: -2px;
			}
			</style>[an error occurred while processing this directive]<div class="content-width"><ol class="breadcrumb text-uppercase"><li><a href="/">Home</a></li><li><a href="/aboutus/">About Us</a></li><li><a href="/people/">People</a></li><li><a href="/people/emeritusfaculty.html">Emeritus Faculty</a></li><li><a href="/people/Samson.Abramsky"><span itemprop="name">Samson Abramsky</span></a></li><li class="active">Publications</li></ol></div><!-- MOBILE NAVIGATION --><div class="content-width space-below mobile-menu-placeholder visible-xs visible-sm"></div><!-- COLUMNS --><div class="container-fluid content-width"><div class="row"><div class="col-xs-12 col-md-9 col-md-push-3" id="maincontent"><!-- CONTENT (Column 2) --><div class="page-title"><h1>Samson Abramsky : Publications
</h1></div><div role="toolbar" class="btn-toolbar"><div class="btn-group"><a href="/people/publications/date/Samson.Abramsky.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By date</a><a href="/people/publications/title/Samson.Abramsky.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By title</a><a href="/people/publications/type/Samson.Abramsky.html" aria-hidden="true" type="button" class="btn btn-oxford-blue"><span class="glyphicon glyphicon-sort-by-attributes"></span> By type</a><a href="/people/publications/bibtex/Samson.Abramsky.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-file"></span> BibTex</a></div></div><p></p><h2>
      Books
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The Handbook of Logic in Computer Science </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; D. Gabbay and T. S. E. Maibaum, editors  </em> </p>
	
	<p class="publicationDetails"> Oxford University Press.
        2000.
        </p> <p
            class="publicationNote"> Volumes 1 and 2&#x2014;Background: Mathematical Structures and Back&#x2212; ground: Computational Structures&#x2014;published in 1992. Volumes 3 and 4&#x2014;Semantic Structures and Semantic Modelling&#x2014; published in 1995. Volume 5&#x2014;Logic and Algebraic Methods</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1808-abstract.html">
			Details <span class="sr-only" > about <em> The Handbook of Logic in Computer Science  </em></span> </a> |
			<a href="/publications/publication1808.bib">
			BibTeX  <span class="sr-only" > data for <em> The Handbook of Logic in Computer Science  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[2] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Proceedings of TAPSOFT 91 </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and T. S. E. Maibaum, editors  </em> </p>
	
	<p class="publicationDetails"> 
            Vol. 493&#x2212;494.
        Springer Lecture Notes in Computer Science.
        1991.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1807-abstract.html">
			Details <span class="sr-only" > about <em> Proceedings of TAPSOFT 91  </em></span> </a> |
			<a href="/publications/publication1807.bib">
			BibTeX  <span class="sr-only" > data for <em> Proceedings of TAPSOFT 91  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[3] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Abstract Interpretation for Declarative Languages </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and Chris Hankin, editors  </em> </p>
	
	<p class="publicationDetails"> Ellis Horwood.
        1987.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1806-abstract.html">
			Details <span class="sr-only" > about <em> Abstract Interpretation for Declarative Languages  </em></span> </a> |
			<a href="/publications/publication1806.bib">
			BibTeX  <span class="sr-only" > data for <em> Abstract Interpretation for Declarative Languages  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[4] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Category Theory and Computer Programming </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; D. Pitt&#x201a; A. Poign&#xe9; and D. Rydeheard), editors  </em> </p>
	
	<p class="publicationDetails"> Springer.
        1986.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1805-abstract.html">
			Details <span class="sr-only" > about <em> Category Theory and Computer Programming  </em></span> </a> |
			<a href="/publications/publication1805.bib">
			BibTeX  <span class="sr-only" > data for <em> Category Theory and Computer Programming  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1007/3-540-17162-2">
		DOI (10.1007/3-540-17162-2)
		</a> 
		
		</div> 
	</div> 
	
        </li></ul><h2>
      Book chapters
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            From CSP to Game Semantics </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Reflections on the Work of C.A.R. Hoare</em>.
        
                Pages 33&#x2013;45.
            Springer.
        2010.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication4577-abstract.html">
			Details <span class="sr-only" > about <em> From CSP to Game Semantics  </em></span> </a> |
			<a href="/publications/publication4577.bib">
			BibTeX  <span class="sr-only" > data for <em> From CSP to Game Semantics  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li></ul><h2>
      Journal papers
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A complete characterization of All&#x2212;versus&#x2212;Nothing arguments for stabilizer states </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky&#x201a; Rui Soares Barbosa&#x201a; Giovanni Car&#xf9; and Simon Perdrix  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Philosophical Transactions of the Royal Society of London A: Mathematical&#x201a; Physical and Engineering Sciences&#x201a; Theme Issue on &#x2018;Second quantum revolution: foundational questions'</em>.
        
            Vol. 375.
        
            No. 2106.
        2017.
        </p> <p
            class="publicationNote"> E&#x2212;print: arXiv:1705.08459 [quant&#x2212;ph]</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication11738-abstract.html">
			Details <span class="sr-only" > about <em> A complete characterization of All&#x2212;versus&#x2212;Nothing arguments for stabilizer states  </em></span> </a> |
			<a href="/publications/publication11738.bib">
			BibTeX  <span class="sr-only" > data for <em> A complete characterization of All&#x2212;versus&#x2212;Nothing arguments for stabilizer states  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1098/rsta.2016.0385">
		DOI (10.1098/rsta.2016.0385)
		</a> 
					| <a href="http://rsta.royalsocietypublishing.org/content/375/2106/201603853"> Link <span class="sr-only" > to <em> A complete characterization of All&#x2212;versus&#x2212;Nothing arguments for stabilizer states  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[2] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Contextual fraction as a measure of contextuality </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky&#x201a; Rui Soares Barbosa and Shane Mansfield  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Physical Review Letters</em>.
        
            Vol. 119.
        
            No. 050504.
        2017.
        </p> <p
            class="publicationNote"> E&#x2212;print: arXiv:1705.07918 [quant&#x2212;ph]; Earlier version (&#x201c;Quantifying contextuality via linear programming&#x201d;) accepted for communication to 13th International Conference on Quantum Physics and Logic (QPL 2016).</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication11742-abstract.html">
			Details <span class="sr-only" > about <em> Contextual fraction as a measure of contextuality  </em></span> </a> |
			<a href="/publications/publication11742.bib">
			BibTeX  <span class="sr-only" > data for <em> Contextual fraction as a measure of contextuality  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1103/PhysRevLett.119.050504">
		DOI (10.1103/PhysRevLett.119.050504)
		</a> 
					| <a href="https://link.aps.org/doi/10.1103/PhysRevLett.119.050504"> Link <span class="sr-only" > to <em> Contextual fraction as a measure of contextuality  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[3] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Possibilities determine the combinatorial structure of probability polytopes </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky&#x201a; Rui Soares Barbosa&#x201a; Kohei Kishida&#x201a; Raymond Lal and Shane Mansfield  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Journal of Mathematical Psychology&#x201a; Special Issue on Foundations of Probability (in press)</em>.
        2016.
        </p> <p
            class="publicationNote"> E&#x2212;print: arXiv:1603.07735 [quant&#x2212;ph]</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication10468-abstract.html">
			Details <span class="sr-only" > about <em> Possibilities determine the combinatorial structure of probability polytopes  </em></span> </a> |
			<a href="/publications/publication10468.bib">
			BibTeX  <span class="sr-only" > data for <em> Possibilities determine the combinatorial structure of probability polytopes  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1016/j.jmp.2016.03.006">
		DOI (10.1016/j.jmp.2016.03.006)
		</a> 
					| <a href="http://www.sciencedirect.com/science/article/pii/S0022249616300013"> Link <span class="sr-only" > to <em> Possibilities determine the combinatorial structure of probability polytopes  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[4] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Logical Bell Inequalities </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky and Lucien Hardy  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Physical Review A</em>.
        
            Vol. 85.
        
            No. ARTN 062114.
        
                Pages 1&#x2212;11.
            2012.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7962-abstract.html">
			Details <span class="sr-only" > about <em> Logical Bell Inequalities  </em></span> </a> |
			<a href="/publications/publication7962.bib">
			BibTeX  <span class="sr-only" > data for <em> Logical Bell Inequalities  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1103/PhysRevA.85.062114">
		DOI (10.1103/PhysRevA.85.062114)
		</a> 
					| <a href="http://link.aps.org/doi/10.1103/PhysRevA.85.062114"> Link <span class="sr-only" > to <em> Logical Bell Inequalities  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[5] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The Sheaf&#x2212;Theoretic Structure of Non&#x2212;Locality and Contextuality </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and A. Brandenburger  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>New Journal of Physics</em>.
        
            Vol. 13.
        
                Pages 113036&#x2212;113075.
            2011.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7961-abstract.html">
			Details <span class="sr-only" > about <em> The Sheaf&#x2212;Theoretic Structure of Non&#x2212;Locality and Contextuality  </em></span> </a> |
			<a href="/publications/publication7961.bib">
			BibTeX  <span class="sr-only" > data for <em> The Sheaf&#x2212;Theoretic Structure of Non&#x2212;Locality and Contextuality  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1088/1367-2630/13/11/113036">
		DOI (10.1088/1367-2630/13/11/113036)
		</a> 
					| <a href="http://iopscience.iop.org/1367-2630/13/11/113036"> Link <span class="sr-only" > to <em> The Sheaf&#x2212;Theoretic Structure of Non&#x2212;Locality and Contextuality  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[6] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Robin Milner's Work on Concurrency </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Electronic Notes in Theoretical Computer Science</em>.
        
            Vol. 265.
        
                Pages 5&#x2013;10.
            2010.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication4580-abstract.html">
			Details <span class="sr-only" > about <em> Robin Milner's Work on Concurrency  </em></span> </a> |
			<a href="/publications/publication4580.bib">
			BibTeX  <span class="sr-only" > data for <em> Robin Milner's Work on Concurrency  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[7] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Introduction to categories and categorical logic </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and N. Tzevelekos  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>New Structures for Physics. Springer</em>.
        2010.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication4576-abstract.html">
			Details <span class="sr-only" > about <em> Introduction to categories and categorical logic  </em></span> </a> |
			<a href="/publications/publication4576.bib">
			BibTeX  <span class="sr-only" > data for <em> Introduction to categories and categorical logic  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[8] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            From IF to BI: A tale of dependence and separation () </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and J. V
"a
"an
"anen  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Synthese</em>.
        
            Vol. 167.
        
            No. 2.
        
                Pages 207&#x2013;230.
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication4581-abstract.html">
			Details <span class="sr-only" > about <em> From IF to BI: A tale of dependence and separation ()  </em></span> </a> |
			<a href="/publications/publication4581.bib">
			BibTeX  <span class="sr-only" > data for <em> From IF to BI: A tale of dependence and separation ()  </em></span>   </a>
			
			
					| <a href="http://arxiv.org/pdf/1102.1388v1"> Link <span class="sr-only" > to <em> From IF to BI: A tale of dependence and separation ()  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[9] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Game Semantics for Access Control </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Jagadeesan  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Electronic Notes in Theoretical Computer Science</em>.
        
            Vol. 249.
        
                Pages 135&#x2013;156.
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication4578-abstract.html">
			Details <span class="sr-only" > about <em> Game Semantics for Access Control  </em></span> </a> |
			<a href="/publications/publication4578.bib">
			BibTeX  <span class="sr-only" > data for <em> Game Semantics for Access Control  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li></ul><h2>
      Conference papers
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Minimum quantum resources for strong non&#x2212;locality </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky&#x201a; Rui Soares Barbosa&#x201a; Giovanni Car&#xf9;&#x201a; Nadish de Silva&#x201a; Kohei Kishida and Shane Mansfield  </em> </p>
	
	<p class="publicationDetails"> 
            In Mark M. Wilde, editor,
             
            <em>
            Proceedings of 12th Conference on the Theory of Quantum Computation&#x201a; Communication and Cryptography (TQC 2017)</em>.
        
            Vol. 73
                of Leibniz International Proceedings in Informatics (LIPIcs).
        
                Pages 9:1&#x2013;9:20.
            Dagstuhl&#x201a; Germany.
        2018.
        Schloss Dagstuhl&#x2013;Leibniz&#x2212;Zentrum fuer Informatik.
        </p> <p
            class="publicationNote"> Accepted for communication at 14th International Conference on Quantum Physics and Logic (QPL 2017); E&#x2212;print: arXiv:1705.09312 [quant&#x2212;ph]</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication12402-abstract.html">
			Details <span class="sr-only" > about <em> Minimum quantum resources for strong non&#x2212;locality  </em></span> </a> |
			<a href="/publications/publication12402.bib">
			BibTeX  <span class="sr-only" > data for <em> Minimum quantum resources for strong non&#x2212;locality  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.4230/LIPIcs.TQC.2017.9">
		DOI (10.4230/LIPIcs.TQC.2017.9)
		</a> 
					| <a href="http://drops.dagstuhl.de/opus/volltexte/2018/8582"> Link <span class="sr-only" > to <em> Minimum quantum resources for strong non&#x2212;locality  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[2] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The quantum monad on relational structures </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky&#x201a; Rui Soares Barbosa&#x201a; Nadish de Silva and Octavio Zapata  </em> </p>
	
	<p class="publicationDetails"> 
            In Kim G. Larsen&#x201a; Hans L. Bodlaender and Jean&#x2212;Fran&#xe7;ois Raskin, editors,
             
            <em>
            Proceedings of 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)</em>.
        
            Vol. 83
                of Leibniz International Proceedings in Informatics (LIPIcs).
        
                Pages 35:1&#x2013;35:19.
            Dagstuhl&#x201a; Germany.
        2017.
        Schloss Dagstuhl&#x2013;Leibniz&#x2212;Zentrum f&#xfc;r Informatik.
        </p> <p
            class="publicationNote"> E&#x2212;print: arXiv:1705.07310 [cs.LO]</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication11740-abstract.html">
			Details <span class="sr-only" > about <em> The quantum monad on relational structures  </em></span> </a> |
			<a href="/publications/publication11740.bib">
			BibTeX  <span class="sr-only" > data for <em> The quantum monad on relational structures  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.4230/LIPIcs.MFCS.2017.35">
		DOI (10.4230/LIPIcs.MFCS.2017.35)
		</a> 
					| <a href="http://drops.dagstuhl.de/opus/volltexte/2017/8129"> Link <span class="sr-only" > to <em> The quantum monad on relational structures  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[3] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Contextuality&#x201a; cohomology and paradox </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky&#x201a; Rui Soares Barbosa&#x201a; Kohei Kishida&#x201a; Raymond Lal and Shane Mansfield  </em> </p>
	
	<p class="publicationDetails"> 
            In Stephan Kreutzer, editor,
             
            <em>
            Proceedings of 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)</em>.
        
            Vol. 41
                of Leibniz International Proceedings in Informatics (LIPIcs).
        
                Pages 211&#x2013;228.
            Dagstuhl&#x201a; Germany.
        2015.
        Schloss Dagstuhl&#x2013;Leibniz&#x2212;Zentrum f&#xfc;r Informatik.
        </p> <p
            class="publicationNote"> E&#x2212;print: arXiv:1502.03097 [quant&#x2212;ph]</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication10469-abstract.html">
			Details <span class="sr-only" > about <em> Contextuality&#x201a; cohomology and paradox  </em></span> </a> |
			<a href="/publications/publication10469.bib">
			BibTeX  <span class="sr-only" > data for <em> Contextuality&#x201a; cohomology and paradox  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.4230/LIPIcs.CSL.2015.211">
		DOI (10.4230/LIPIcs.CSL.2015.211)
		</a> 
					| <a href="http://drops.dagstuhl.de/opus/volltexte/2015/5416"> Link <span class="sr-only" > to <em> Contextuality&#x201a; cohomology and paradox  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[4] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; G. Gottlob and P. Kolaitis  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Artificial Intelligence (IJCAI '13)&#x201a; 2013 23rd International Joint Conference on</em>.
        
                Pages 440&#x2212;446.
            AAAI Press.
        2013.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication7965-abstract.html">
			Details <span class="sr-only" > about <em> Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics  </em></span> </a> |
			<a href="/publications/publication7965.bib">
			BibTeX  <span class="sr-only" > data for <em> Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics  </em></span>   </a>
			
			
					| <a href="http://ijcai.org/papers13/Papers/IJCAI13-073.pdf"> Download (pdf)  <span class="sr-only" > of <em> Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics  </em></span>   </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[5] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The cohomology of non&#x2212;locality and contextuality </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky&#x201a; Shane Mansfield and Rui Soares Barbosa  </em> </p>
	
	<p class="publicationDetails"> 
            In Bart Jacobs&#x201a; Peter Selinger and Bas Spitters, editors,
             
            <em>
            Proceedings of 8th International Workshop on Quantum Physics and Logic (QPL 2011)</em>.
        
            Vol. 95
                of Electronic Proceedings in Theoretical Computer Science.
        
                Pages 1&#x2013;14.
            2012.
        </p> <p
            class="publicationNote"> E&#x2212;print: arXiv:1111.3620 [quant&#x2212;ph]</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication12403-abstract.html">
			Details <span class="sr-only" > about <em> The cohomology of non&#x2212;locality and contextuality  </em></span> </a> |
			<a href="/publications/publication12403.bib">
			BibTeX  <span class="sr-only" > data for <em> The cohomology of non&#x2212;locality and contextuality  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.4204/EPTCS.95.1">
		DOI (10.4204/EPTCS.95.1)
		</a> 
					| <a href="http://arXiv.org/pdf/1111.3620.pdf"> Download (pdf)  <span class="sr-only" > of <em> The cohomology of non&#x2212;locality and contextuality  </em></span>   </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[6] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Coalgebras&#x201a; chu spaces&#x201a; and representations of physical systems </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Logic in Computer Science (LICS)&#x201a; 2010 25th Annual IEEE Symposium on</em>.
        
                Pages 411&#x2013;420.
            IEEE.
        2010.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication4579-abstract.html">
			Details <span class="sr-only" > about <em> Coalgebras&#x201a; chu spaces&#x201a; and representations of physical systems  </em></span> </a> |
			<a href="/publications/publication4579.bib">
			BibTeX  <span class="sr-only" > data for <em> Coalgebras&#x201a; chu spaces&#x201a; and representations of physical systems  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1109/LICS.2010.35">
		DOI (10.1109/LICS.2010.35)
		</a> 
					| <a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5571745"> Link <span class="sr-only" > to <em> Coalgebras&#x201a; chu spaces&#x201a; and representations of physical systems  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[7] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Petri Nets&#x201a; Discrete Physics&#x201a; and Distributed Quantum Computation </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In Pierpaolo Degano&#x201a; Rocco De Nicola and Jose Meseguer, editors,
             
            <em>
            Concurrency&#x201a; Graphs and Models&#x201a; Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday.</em>.
        
            Vol. 5065
                of Lecture Notes in Computer Science.
        
                Pages 527&#x2013;543.
            Springer.
        2008.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication82-abstract.html">
			Details <span class="sr-only" > about <em> Petri Nets&#x201a; Discrete Physics&#x201a; and Distributed Quantum Computation  </em></span> </a> |
			<a href="/publications/publication82.bib">
			BibTeX  <span class="sr-only" > data for <em> Petri Nets&#x201a; Discrete Physics&#x201a; and Distributed Quantum Computation  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/381/fest.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Petri Nets&#x201a; Discrete Physics&#x201a; and Distributed Quantum Computation  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[8] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Compositional Game Semantics for Multi&#x2212;Agent Logics of Partial Information </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            Vol. 1
                of Texts in Logic and Games.
        
                Pages 11&#x2013;48.
            Amsterdam University Press.
        2007.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication2316-abstract.html">
			Details <span class="sr-only" > about <em> A Compositional Game Semantics for Multi&#x2212;Agent Logics of Partial Information  </em></span> </a> |
			<a href="/publications/publication2316.bib">
			BibTeX  <span class="sr-only" > data for <em> A Compositional Game Semantics for Multi&#x2212;Agent Logics of Partial Information  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/347/admproc.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> A Compositional Game Semantics for Multi&#x2212;Agent Logics of Partial Information  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[9] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Physics from Computer Science </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and B. Coecke  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            International Journal of Unconventional Computing</em>.
        
            Vol. 3.
        
            No. 3.
        
                Pages 179&#x2212;197.
            2007.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1855-abstract.html">
			Details <span class="sr-only" > about <em> Physics from Computer Science  </em></span> </a> |
			<a href="/publications/publication1855.bib">
			BibTeX  <span class="sr-only" > data for <em> Physics from Computer Science  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/349/YORKIJUC.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Physics from Computer Science  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[10] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Temperley&#x2212;Lieb algebra: From knot theory to logic and computation via quantum mechanics </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In Goong Chen&#x201a; Louis Kauffman and Sam Lomonaco, editors,
             
            <em>
            Mathematics of Quantum Computing and Technology</em>.
        
                Pages 415&#x2212;458.
            Taylor and Francis.
        2007.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1892-abstract.html">
			Details <span class="sr-only" > about <em> Temperley&#x2212;Lieb algebra: From knot theory to logic and computation via quantum mechanics  </em></span> </a> |
			<a href="/publications/publication1892.bib">
			BibTeX  <span class="sr-only" > data for <em> Temperley&#x2212;Lieb algebra: From knot theory to logic and computation via quantum mechanics  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/286/final.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Temperley&#x2212;Lieb algebra: From knot theory to logic and computation via quantum mechanics  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[11] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Event Domains&#x201a; Stable Functions and Proof Nets </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Plotkin Festschrift</em>.
        
            Vol. 172
                of Electronic Notes in Theoretical Computer Science.
        
                Pages 33&#x2212;67.
            2007.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1893-abstract.html">
			Details <span class="sr-only" > about <em> Event Domains&#x201a; Stable Functions and Proof Nets  </em></span> </a> |
			<a href="/publications/publication1893.bib">
			BibTeX  <span class="sr-only" > data for <em> Event Domains&#x201a; Stable Functions and Proof Nets  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/348/fest.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Event Domains&#x201a; Stable Functions and Proof Nets  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[12] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Categorical Quantum Logic </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Duncan  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Mathematical Structures in Computer Science&#x201a; 16</em>.
        
                Pages 469&#x2212;489.
            2006.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1850-abstract.html">
			Details <span class="sr-only" > about <em> A Categorical Quantum Logic  </em></span> </a> |
			<a href="/publications/publication1850.bib">
			BibTeX  <span class="sr-only" > data for <em> A Categorical Quantum Logic  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/344/cql.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> A Categorical Quantum Logic  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[13] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            What are the fundamental structures of concurrency? We still don't know! </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Electronic Notes in Theoretical Computer Science&#x201a; 162</em>.
        
                Pages 37&#x2212;41.
            2006.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1890-abstract.html">
			Details <span class="sr-only" > about <em> What are the fundamental structures of concurrency? We still don't know!  </em></span> </a> |
			<a href="/publications/publication1890.bib">
			BibTeX  <span class="sr-only" > data for <em> What are the fundamental structures of concurrency? We still don't know!  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/346/bertinoro05.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> What are the fundamental structures of concurrency? We still don't know!  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[14] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Socially Responsive&#x201a; Environmentally Friendly Logic </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In Tuomo Aho and Ahti&#x2212;Veikko Pietarinen, editors,
             
            <em>
            Truth and Games: Essays in Honour of Gabriel Sandu</em>.
        
                Pages 17&#x2212;46.
            Acta Philosophica Fennica&#x201a; Societas Philosophicas Fennica&#x201a; Helsinki.
        2006.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1891-abstract.html">
			Details <span class="sr-only" > about <em> Socially Responsive&#x201a; Environmentally Friendly Logic  </em></span> </a> |
			<a href="/publications/publication1891.bib">
			BibTeX  <span class="sr-only" > data for <em> Socially Responsive&#x201a; Environmentally Friendly Logic  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/345/sandu.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Socially Responsive&#x201a; Environmentally Friendly Logic  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[15] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Linear realizability and full completeness for typed lambda&#x2212;calculi </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and M. Lenisa  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Annals of Pure and Applied Logic</em>.
        
            Vol. 134.
        
                Pages 122&#x2212;168.
            2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1829-abstract.html">
			Details <span class="sr-only" > about <em> Linear realizability and full completeness for typed lambda&#x2212;calculi  </em></span> </a> |
			<a href="/publications/publication1829.bib">
			BibTeX  <span class="sr-only" > data for <em> Linear realizability and full completeness for typed lambda&#x2212;calculi  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/342/marina.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Linear realizability and full completeness for typed lambda&#x2212;calculi  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[16] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Game Semantics for Generic Polymorphism </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Jagadeesan  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Annals of Pure and Applied Logic</em>.
        
            Vol. 133.
        
                Pages 3&#x2212;37.
            2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1839-abstract.html">
			Details <span class="sr-only" > about <em> A Game Semantics for Generic Polymorphism  </em></span> </a> |
			<a href="/publications/publication1839.bib">
			BibTeX  <span class="sr-only" > data for <em> A Game Semantics for Generic Polymorphism  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/338/generic.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> A Game Semantics for Generic Polymorphism  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[17] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Abstract Physical Traces </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and B. Coecke  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Theory and Applications of Categories</em>.
        
            Vol. 14.
        
                Pages 111&#x2212;124.
            2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1854-abstract.html">
			Details <span class="sr-only" > about <em> Abstract Physical Traces  </em></span> </a> |
			<a href="/publications/publication1854.bib">
			BibTeX  <span class="sr-only" > data for <em> Abstract Physical Traces  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/340/apt.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Abstract Physical Traces  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[18] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Structural Approach To Reversible Computation </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Theoretical Computer Science</em>.
        
            Vol. 347.
        
            No. 3.
        
                Pages 441&#x2212;464.
            2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1886-abstract.html">
			Details <span class="sr-only" > about <em> A Structural Approach To Reversible Computation  </em></span> </a> |
			<a href="/publications/publication1886.bib">
			BibTeX  <span class="sr-only" > data for <em> A Structural Approach To Reversible Computation  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/339/revised.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> A Structural Approach To Reversible Computation  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[19] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Cook's Tour of the Finitary Non&#x2212;Well&#x2212;Founded Sets </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In Sergei Artemov&#x201a; Howard Barringer&#x201a; Artur d'Avila Garcez&#x201a; Luis C. Lamb and John Woods, editors,
             
            <em>
            We Will Show Them: Essays in honour of Dov Gabbay</em>.
        
            Vol. 1.
        
                Pages 1&#x2212;18.
            College Publications.
        2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1887-abstract.html">
			Details <span class="sr-only" > about <em> A Cook's Tour of the Finitary Non&#x2212;Well&#x2212;Founded Sets  </em></span> </a> |
			<a href="/publications/publication1887.bib">
			BibTeX  <span class="sr-only" > data for <em> A Cook's Tour of the Finitary Non&#x2212;Well&#x2212;Founded Sets  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/337/dg05.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> A Cook's Tour of the Finitary Non&#x2212;Well&#x2212;Founded Sets  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[20] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Abstract Scalars&#x201a; Loops&#x201a; and Free Traced and Strongly Compact Closed Categories </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of CALCO 2005</em>.
        
            Vol. 3629
                of Springer Lecture Notes in Computer Science.
        
                Pages 1&#x2212;31.
            2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1888-abstract.html">
			Details <span class="sr-only" > about <em> Abstract Scalars&#x201a; Loops&#x201a; and Free Traced and Strongly Compact Closed Categories  </em></span> </a> |
			<a href="/publications/publication1888.bib">
			BibTeX  <span class="sr-only" > data for <em> Abstract Scalars&#x201a; Loops&#x201a; and Free Traced and Strongly Compact Closed Categories  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/341/calco05.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Abstract Scalars&#x201a; Loops&#x201a; and Free Traced and Strongly Compact Closed Categories  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[21] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            What are the fundamental structures of concurrency? We still don't know! </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Algebraic process calculi: the first 25 years and beyond</em>.
        
                Pages 1&#x2212;5.
            June,
            2005.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1889-abstract.html">
			Details <span class="sr-only" > about <em> What are the fundamental structures of concurrency? We still don't know!  </em></span> </a> |
			<a href="/publications/publication1889.bib">
			BibTeX  <span class="sr-only" > data for <em> What are the fundamental structures of concurrency? We still don't know!  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/343/bertinoro05.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> What are the fundamental structures of concurrency? We still don't know!  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[22] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Applying Game Semantics to Compositional Software Modelling and verification </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; D. Ghica&#x201a; L. Ong and A. Murawski  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            TACAS 2004: Tools and Algorithms for the Construction and Analysis of Systems&#x201a; 10 International Conference</em>.
        
            Vol. 2988.
        
                Pages 421&#x2212;435.
            Springer LNCS.
        2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1844-abstract.html">
			Details <span class="sr-only" > about <em> Applying Game Semantics to Compositional Software Modelling and verification  </em></span> </a> |
			<a href="/publications/publication1844.bib">
			BibTeX  <span class="sr-only" > data for <em> Applying Game Semantics to Compositional Software Modelling and verification  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[23] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Nominal games and Full Abstraction for the Nu&#x2212;Calculus </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; D. Ghica&#x201a; A. Murawski&#x201a; C.&#x2212;H. Ong and I. Stark  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004</em>.
        
                Pages 150&#x2212;159.
            IEEE Computer Society.
        2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1845-abstract.html">
			Details <span class="sr-only" > about <em> Nominal games and Full Abstraction for the Nu&#x2212;Calculus  </em></span> </a> |
			<a href="/publications/publication1845.bib">
			BibTeX  <span class="sr-only" > data for <em> Nominal games and Full Abstraction for the Nu&#x2212;Calculus  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/336/nominalgames.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Nominal games and Full Abstraction for the Nu&#x2212;Calculus  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[24] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Categorical Semantics of Quantum Protocols </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and B. Coecke  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004</em>.
        
                Pages 415&#x2212;425.
            IEEE Computer Society.
        2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1853-abstract.html">
			Details <span class="sr-only" > about <em> A Categorical Semantics of Quantum Protocols  </em></span> </a> |
			<a href="/publications/publication1853.bib">
			BibTeX  <span class="sr-only" > data for <em> A Categorical Semantics of Quantum Protocols  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/333/csqp.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> A Categorical Semantics of Quantum Protocols  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[25] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            High&#x2212;Level Methods for Quantum Computation and Information </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004</em>.
        
                Pages 410&#x2212;414.
            IEEE Computer Society.
        2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1885-abstract.html">
			Details <span class="sr-only" > about <em> High&#x2212;Level Methods for Quantum Computation and Information  </em></span> </a> |
			<a href="/publications/publication1885.bib">
			BibTeX  <span class="sr-only" > data for <em> High&#x2212;Level Methods for Quantum Computation and Information  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/335/hlmqci.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> High&#x2212;Level Methods for Quantum Computation and Information  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[26] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Game semantics for Generic Polymorphism </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Jagadeesan  </em> </p>
	
	<p class="publicationDetails"> 
            In A. D. Gordon, editor,
             
            <em>
            Foundations of Software Science and Computational Structures&#x201a; 6th International Conference&#x201a; FOSSACS 2003</em>.
        
            Vol. 2620
                of Springer Lecture Notes in Computer Science.
        
                Pages 1&#x2212;22.
            2003.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1838-abstract.html">
			Details <span class="sr-only" > about <em> A Game semantics for Generic Polymorphism  </em></span> </a> |
			<a href="/publications/publication1838.bib">
			BibTeX  <span class="sr-only" > data for <em> A Game semantics for Generic Polymorphism  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/329/fossacs04.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> A Game semantics for Generic Polymorphism  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[27] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Algorithmic Game Semantics and Component&#x2212;Based Verification </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; D. R. Ghica&#x201a; L. Ong and A. Murawski  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of SAVBCS 2003: Specification and Verification of Component&#x2212;Based Systems&#x201a; Workshop at ESEC/FASE 2003</em>.
        
                Pages 66&#x2212;74.
            2003.
        </p> <p
            class="publicationNote"> published as Technical Report 03&#x2212;11&#x201a; Department of Computer Science&#x201a; Iowa State University</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1843-abstract.html">
			Details <span class="sr-only" > about <em> Algorithmic Game Semantics and Component&#x2212;Based Verification  </em></span> </a> |
			<a href="/publications/publication1843.bib">
			BibTeX  <span class="sr-only" > data for <em> Algorithmic Game Semantics and Component&#x2212;Based Verification  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/330/agscbv.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Algorithmic Game Semantics and Component&#x2212;Based Verification  </em></span>

					    </a>


				    
					| <a href="http://www.cs.iastate.edu/~leavens/SAVBCS/2003/papers/SAVCBS03.pdf"> Download (pdf)  <span class="sr-only" > of <em> Algorithmic Game Semantics and Component&#x2212;Based Verification  </em></span>   </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[28] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Physical Traces: Quantum vs. Classical Information Processing </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and B. Coecke  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Electronic Notes in Theoretical Computer Science</em>.
        
            Vol. 69.
        
                Pages 1&#x2212;26.
            2003.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1852-abstract.html">
			Details <span class="sr-only" > about <em> Physical Traces: Quantum vs. Classical Information Processing  </em></span> </a> |
			<a href="/publications/publication1852.bib">
			BibTeX  <span class="sr-only" > data for <em> Physical Traces: Quantum vs. Classical Information Processing  </em></span>   </a>
			
			
					| <a href="http://www1.elsevier.com/gej-ng/31/29/23/131/23/24/69002.pdf"> Download (pdf)  <span class="sr-only" > of <em> Physical Traces: Quantum vs. Classical Information Processing  </em></span>   </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[29] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Sequentiality vs. concurrency in games and logic </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Mathematical Structures in Computer Science</em>.
        
            Vol. 13.
        
                Pages 531&#x2212;565.
            2003.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1884-abstract.html">
			Details <span class="sr-only" > about <em> Sequentiality vs. concurrency in games and logic  </em></span> </a> |
			<a href="/publications/publication1884.bib">
			BibTeX  <span class="sr-only" > data for <em> Sequentiality vs. concurrency in games and logic  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/332/seqcon.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Sequentiality vs. concurrency in games and logic  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[30] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Geometry of Interaction and linear combinatory algebras </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; E. Haghverdi and P. Scott  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Mathematical Structures in Computer Science</em>.
        
            Vol. 12.
        
                Pages 625&#x2212;665.
            2002.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1842-abstract.html">
			Details <span class="sr-only" > about <em> Geometry of Interaction and linear combinatory algebras  </em></span> </a> |
			<a href="/publications/publication1842.bib">
			BibTeX  <span class="sr-only" > data for <em> Geometry of Interaction and linear combinatory algebras  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/328/ahs.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Geometry of Interaction and linear combinatory algebras  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[31] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A fully abstract denotational semantics for the calculus of higher&#x2212;order communicating systems </strong> </p>
	    <p class="publicationAuthors"> <em> B. Thomsen and S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Theoretical Computer Science</em>.
        
            Vol. 254.
        
                Pages 557&#x2212;589.
            2001.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1809-abstract.html">
			Details <span class="sr-only" > about <em> A fully abstract denotational semantics for the calculus of higher&#x2212;order communicating systems  </em></span> </a> |
			<a href="/publications/publication1809.bib">
			BibTeX  <span class="sr-only" > data for <em> A fully abstract denotational semantics for the calculus of higher&#x2212;order communicating systems  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[32] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Fully Complete Minimal PER Models for the Simply Typed &#x03bb;&#x2212;calculus </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and M. Lenisa  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            CSL 2001 Conference Proceedings</em>.
        
            Vol. 2142
                of Springer LNCS.
        
                Pages 442&#x2212;457.
            2001.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1828-abstract.html">
			Details <span class="sr-only" > about <em> Fully Complete Minimal PER Models for the Simply Typed &#x03bb;&#x2212;calculus  </em></span> </a> |
			<a href="/publications/publication1828.bib">
			BibTeX  <span class="sr-only" > data for <em> Fully Complete Minimal PER Models for the Simply Typed &#x03bb;&#x2212;calculus  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/327/ml3.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Fully Complete Minimal PER Models for the Simply Typed &#x03bb;&#x2212;calculus  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[33] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Algorithmic Game Semantics: A Tutorial Introduction </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In H. Schichtenberg and R. Steinbr&#xfc;ggen, editors,
             
            <em>
            Proceedings of the NATO Advanced Study Institute&#x201a; Marktober&#x2212; dorf</em>.
        
                Chapter Proof and System Reliability.
            
                Pages 21&#x2212;47.
            Kluwer Academic Publishers.
        2001.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1882-abstract.html">
			Details <span class="sr-only" > about <em> Algorithmic Game Semantics: A Tutorial Introduction  </em></span> </a> |
			<a href="/publications/publication1882.bib">
			BibTeX  <span class="sr-only" > data for <em> Algorithmic Game Semantics: A Tutorial Introduction  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/326/mdorf01.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Algorithmic Game Semantics: A Tutorial Introduction  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[34] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Structural Approach to Reversible Computation </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In D. Beauquier and Y. Matiyasevich, editors,
             
            <em>
            LCCS 2001: Proceedings of the International Workshop on Logic and Complexity in Computer Science</em>.
        
                Pages 1&#x2212;16.
            2001.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1883-abstract.html">
			Details <span class="sr-only" > about <em> A Structural Approach to Reversible Computation  </em></span> </a> |
			<a href="/publications/publication1883.bib">
			BibTeX  <span class="sr-only" > data for <em> A Structural Approach to Reversible Computation  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/325/rev.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> A Structural Approach to Reversible Computation  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[35] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Axiomatizing Fully Complete Models for ML Polymorphic Types </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and M. Lenisa  </em> </p>
	
	<p class="publicationDetails"> 
            In M. Nielsen and B. Rovan, editors,
             
            <em>
            Proceedings of the International Symposium on Mathematical Foundations of Computer Science</em>.
        
            Vol. 1893
                of Springer Lecture Notes in Computer Science.
        
                Pages 141&#x2212;151.
            Springer&#x2212;Verlag.
        2000.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1826-abstract.html">
			Details <span class="sr-only" > about <em> Axiomatizing Fully Complete Models for ML Polymorphic Types  </em></span> </a> |
			<a href="/publications/publication1826.bib">
			BibTeX  <span class="sr-only" > data for <em> Axiomatizing Fully Complete Models for ML Polymorphic Types  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/321/ml2.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Axiomatizing Fully Complete Models for ML Polymorphic Types  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[36] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Fully Complete PER Model for ML Polymorphic Types </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and M. Lenisa  </em> </p>
	
	<p class="publicationDetails"> 
            In P. Clote and H. Schwichtenberg, editors,
             
            <em>
            Proceedings of the Fourteenth International Workshop on Computer Science Logic</em>.
        
            Vol. 1862
                of Springer Lecture Notes in Computer Science.
        
                Pages 140&#x2212;155.
            Springer&#x2212;Verlag.
        2000.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1827-abstract.html">
			Details <span class="sr-only" > about <em> A Fully Complete PER Model for ML Polymorphic Types  </em></span> </a> |
			<a href="/publications/publication1827.bib">
			BibTeX  <span class="sr-only" > data for <em> A Fully Complete PER Model for ML Polymorphic Types  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/320/ml1.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> A Fully Complete PER Model for ML Polymorphic Types  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[37] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Full Abstraction for PCF </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; R. Jagadeesan and P. Malacaria  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Information and Computation</em>.
        
            Vol. 163.
        
                Pages 409&#x2212;470.
            2000.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1833-abstract.html">
			Details <span class="sr-only" > about <em> Full Abstraction for PCF  </em></span> </a> |
			<a href="/publications/publication1833.bib">
			BibTeX  <span class="sr-only" > data for <em> Full Abstraction for PCF  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/323/pcf.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Full Abstraction for PCF  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[38] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Concurrent Interaction Games </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In A. W. Roscoe J. Davies and J. Woodcock, editors,
             
            <em>
            Millennial Perspectives in Computer Science</em>.
        
                Pages 1&#x2212;12.
            Palgrave.
        2000.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1880-abstract.html">
			Details <span class="sr-only" > about <em> Concurrent Interaction Games  </em></span> </a> |
			<a href="/publications/publication1880.bib">
			BibTeX  <span class="sr-only" > data for <em> Concurrent Interaction Games  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/322/cig.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Concurrent Interaction Games  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[39] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Process Realizability </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In F. L. Bauer and R. Steinbr&#xfc;ggen, editors,
             
            <em>
            Foundations of Secure Computation: Proceedings of the 1999 Marktoberdorf Summer School</em>.
        
                Pages 167&#x2212;180.
            IOS Press.
        2000.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1881-abstract.html">
			Details <span class="sr-only" > about <em> Process Realizability  </em></span> </a> |
			<a href="/publications/publication1881.bib">
			BibTeX  <span class="sr-only" > data for <em> Process Realizability  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/324/pr209.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Process Realizability  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[40] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Concurrent Games and Full Completeness </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and P.&#x2212;A. Melli&#xe9;s  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Fourteenth International Symposium on Logic in Computer Science</em>.
        
                Pages 431&#x2212;442.
            Computer Society Press of the IEEE.
        1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1819-abstract.html">
			Details <span class="sr-only" > about <em> Concurrent Games and Full Completeness  </em></span> </a> |
			<a href="/publications/publication1819.bib">
			BibTeX  <span class="sr-only" > data for <em> Concurrent Games and Full Completeness  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/316/cg.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Concurrent Games and Full Completeness  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[41] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Full Abstraction for Idealized Algol with passive expressions </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and G. McCusker  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Theoretical Computer Science</em>.
        
            Vol. 227.
        
                Pages 3&#x2212;42.
            1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1824-abstract.html">
			Details <span class="sr-only" > about <em> Full Abstraction for Idealized Algol with passive expressions  </em></span> </a> |
			<a href="/publications/publication1824.bib">
			BibTeX  <span class="sr-only" > data for <em> Full Abstraction for Idealized Algol with passive expressions  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/317/passive.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Full Abstraction for Idealized Algol with passive expressions  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[42] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Game Semantics </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and G. McCusker  </em> </p>
	
	<p class="publicationDetails"> 
            In H. Schwichtenberg and U. Berger, editors,
             
            <em>
            Computational Logic: Proceedings of the 1997 Marktoberdorf Summer School</em>.
        
                Pages 1&#x2212;56.
            Springer&#x2212;Verlag.
        1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1825-abstract.html">
			Details <span class="sr-only" > about <em> Game Semantics  </em></span> </a> |
			<a href="/publications/publication1825.bib">
			BibTeX  <span class="sr-only" > data for <em> Game Semantics  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/318/mdorf97.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Game Semantics  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[43] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Specification Structure for Deadlock&#x2212;freedom of Synchronous Processes </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; S. J. Gay and R. Nagarajan  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Theoretical Computer Science</em>.
        
            Vol. 222.
        
                Pages 1&#x2212;53.
            1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1846-abstract.html">
			Details <span class="sr-only" > about <em> A Specification Structure for Deadlock&#x2212;freedom of Synchronous Processes  </em></span> </a> |
			<a href="/publications/publication1846.bib">
			BibTeX  <span class="sr-only" > data for <em> A Specification Structure for Deadlock&#x2212;freedom of Synchronous Processes  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/314/agn4.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> A Specification Structure for Deadlock&#x2212;freedom of Synchronous Processes  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[44] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Nuclear and trace ideals in tensored *&#x2212;categories </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; R. Blute and P. Panangaden  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            J. Pure and Applied Algebra</em>.
        
            Vol. 143.
        
                Pages 3&#x2212;47.
            1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1858-abstract.html">
			Details <span class="sr-only" > about <em> Nuclear and trace ideals in tensored *&#x2212;categories  </em></span> </a> |
			<a href="/publications/publication1858.bib">
			BibTeX  <span class="sr-only" > data for <em> Nuclear and trace ideals in tensored *&#x2212;categories  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/319/abp.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Nuclear and trace ideals in tensored *&#x2212;categories  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[45] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Axioms for Definability and Full Completeness </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In G. Plotkin&#x201a; M. Tofte and C. Stirling, editors,
             
            <em>
            Essays in Honour of Robin Milner</em>.
        
                Pages 55&#x2212;75.
            MIT Press.
        1999.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1879-abstract.html">
			Details <span class="sr-only" > about <em> Axioms for Definability and Full Completeness  </em></span> </a> |
			<a href="/publications/publication1879.bib">
			BibTeX  <span class="sr-only" > data for <em> Axioms for Definability and Full Completeness  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/315/axiomatic.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Axioms for Definability and Full Completeness  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[46] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Call&#x2212;by&#x2212;value games </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and G. McCusker  </em> </p>
	
	<p class="publicationDetails"> 
            In M. Nielsen and W. Thomas, editors,
             
            <em>
            Proceedings of the Eleventh International Workshop on Computer Science Logic</em>.
        
            Vol. 1414
                of Springer Lecture Notes in Computer Science.
        
                Pages 1&#x2212;17.
            Springer&#x2212;Verlag.
        1998.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1823-abstract.html">
			Details <span class="sr-only" > about <em> Call&#x2212;by&#x2212;value games  </em></span> </a> |
			<a href="/publications/publication1823.bib">
			BibTeX  <span class="sr-only" > data for <em> Call&#x2212;by&#x2212;value games  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/313/cbvgames.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Call&#x2212;by&#x2212;value games  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[47] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A fully abstract game semantics for general references </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; K. Honda and G. McCusker  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Thirteenth International Symposium on Logic in Computer Science</em>.
        
                Pages 334&#x2212;344.
            Computer Society Press of the IEEE.
        1998.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1840-abstract.html">
			Details <span class="sr-only" > about <em> A fully abstract game semantics for general references  </em></span> </a> |
			<a href="/publications/publication1840.bib">
			BibTeX  <span class="sr-only" > data for <em> A fully abstract game semantics for general references  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/312/lics98.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> A fully abstract game semantics for general references  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[48] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Specifying Processes </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and D. Pavlovic  </em> </p>
	
	<p class="publicationDetails"> 
            In E. Moggi and G. Rosolini, editors,
             
            <em>
            Proceedings of the International Symposium on Category Theory In Computer Science</em>.
        
            Vol. 1290
                of Springer Lecture Notes in Computer Science.
        
                Pages 147&#x2212;158.
            Springer&#x2212;Verlag.
        1997.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1817-abstract.html">
			Details <span class="sr-only" > about <em> Specifying Processes  </em></span> </a> |
			<a href="/publications/publication1817.bib">
			BibTeX  <span class="sr-only" > data for <em> Specifying Processes  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/311/ap.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Specifying Processes  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[49] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Linearity&#x201a; Sharing and State: a fully abstract game semantics for Idealized Algol </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and G. McCusker  </em> </p>
	
	<p class="publicationDetails"> 
            In P. O'Hearn and R. D. Tennent, editors,
             
            <em>
            Algol&#x2212;like Languages</em>.
        
                Pages 317&#x2212;348.
            Birkhauser.
        1997.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1822-abstract.html">
			Details <span class="sr-only" > about <em> Linearity&#x201a; Sharing and State: a fully abstract game semantics for Idealized Algol  </em></span> </a> |
			<a href="/publications/publication1822.bib">
			BibTeX  <span class="sr-only" > data for <em> Linearity&#x201a; Sharing and State: a fully abstract game semantics for Idealized Algol  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/309/lss.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Linearity&#x201a; Sharing and State: a fully abstract game semantics for Idealized Algol  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[50] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Type&#x2212;theoretic Approach to Deadlock&#x2212;freedom of Asynchronous Systems </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; S. Gay and R. Nagarajan  </em> </p>
	
	<p class="publicationDetails"> 
            In M. Abadi and T. Ito, editors,
             
            <em>
            Theoretical Aspects of Computer Software</em>.
        
            Vol. 1281
                of Springer Lecture Notes in Computer Science.
        
                Pages 295&#x2212;320.
            Springer&#x2212;Verlag.
        1997.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1849-abstract.html">
			Details <span class="sr-only" > about <em> A Type&#x2212;theoretic Approach to Deadlock&#x2212;freedom of Asynchronous Systems  </em></span> </a> |
			<a href="/publications/publication1849.bib">
			BibTeX  <span class="sr-only" > data for <em> A Type&#x2212;theoretic Approach to Deadlock&#x2212;freedom of Asynchronous Systems  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/307/agn1.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> A Type&#x2212;theoretic Approach to Deadlock&#x2212;freedom of Asynchronous Systems  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[51] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Games in the Semantics of Programming Languages </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In P. Dekker&#x201a; M. Stokhof and Y. Venema, editors,
             
            <em>
            Proceedings of the 11th Amsterdam Colloquium</em>.
        
                Pages 1&#x2212;6.
            ILLC&#x201a; Dept. of Philosophy&#x201a; University of Amsterdam.
        1997.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1876-abstract.html">
			Details <span class="sr-only" > about <em> Games in the Semantics of Programming Languages  </em></span> </a> |
			<a href="/publications/publication1876.bib">
			BibTeX  <span class="sr-only" > data for <em> Games in the Semantics of Programming Languages  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/308/AC.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Games in the Semantics of Programming Languages  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[52] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Game Semantics for Programming Languages </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In I. Privara and P. Ruzicka, editors,
             
            <em>
            22nd International Symposium on Mathematical Foundations of Computer Science</em>.
        
            Vol. 1295
                of Springer Lecture Notes in Computer Science.
        
                Pages 3&#x2212;4.
            Springer&#x2212;Verlag.
        1997.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1877-abstract.html">
			Details <span class="sr-only" > about <em> Game Semantics for Programming Languages  </em></span> </a> |
			<a href="/publications/publication1877.bib">
			BibTeX  <span class="sr-only" > data for <em> Game Semantics for Programming Languages  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[53] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Semantics of Interaction: an introduction to Game Semantics </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In P. Dybjer and A. Pitts, editors,
             
            <em>
            Proceedings of the 1996 CLiCS Summer School&#x201a; Isaac Newton Institute</em>.
        
                Pages 1&#x2212;31.
            Cambridge University Press.
        1997.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1878-abstract.html">
			Details <span class="sr-only" > about <em> Semantics of Interaction: an introduction to Game Semantics  </em></span> </a> |
			<a href="/publications/publication1878.bib">
			BibTeX  <span class="sr-only" > data for <em> Semantics of Interaction: an introduction to Game Semantics  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/310/coursenotes.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Semantics of Interaction: an introduction to Game Semantics  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[54] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Specification Structures and Propositions&#x2212;as&#x2212;Types for Concurrency </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; S. Gay and R. Nagarajan  </em> </p>
	
	<p class="publicationDetails"> 
            In G. Birtwistle and F. Moller, editors,
             
            <em>
            Logics for Concurrency: Structure vs. Automata&#x2014;Proceedings of the VI I Ith Banff Higher Order Workshop</em>.
        
                Pages 5&#x2212;40.
            Springer&#x2212;Verlag.
        1996.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1847-abstract.html">
			Details <span class="sr-only" > about <em> Specification Structures and Propositions&#x2212;as&#x2212;Types for Concurrency  </em></span> </a> |
			<a href="/publications/publication1847.bib">
			BibTeX  <span class="sr-only" > data for <em> Specification Structures and Propositions&#x2212;as&#x2212;Types for Concurrency  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/306/agn3.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Specification Structures and Propositions&#x2212;as&#x2212;Types for Concurrency  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[55] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Interaction Categories and the Foundations of Typed Concurrent Programming </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; S. Gay and R. Nagarajan  </em> </p>
	
	<p class="publicationDetails"> 
            In M. Broy, editor,
             
            <em>
            Proceedings of the 1994 Marktoberdorf Summer Sxhool on Deductive Program Design</em>.
        
                Pages 35&#x2212;113.
            Springer&#x2212;Verlag.
        1996.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1848-abstract.html">
			Details <span class="sr-only" > about <em> Interaction Categories and the Foundations of Typed Concurrent Programming  </em></span> </a> |
			<a href="/publications/publication1848.bib">
			BibTeX  <span class="sr-only" > data for <em> Interaction Categories and the Foundations of Typed Concurrent Programming  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/304/agn2.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Interaction Categories and the Foundations of Typed Concurrent Programming  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[56] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Retracing some paths in process algebra </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In U. Montanari and V. Sassone, editors,
             
            <em>
            CONCUR '96: Concurrency Theory&#x201a; 7th International Conference</em>.
        
                Pages 1&#x2212;17.
            Springer&#x2212;Verlag.
        1996.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1875-abstract.html">
			Details <span class="sr-only" > about <em> Retracing some paths in process algebra  </em></span> </a> |
			<a href="/publications/publication1875.bib">
			BibTeX  <span class="sr-only" > data for <em> Retracing some paths in process algebra  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/305/concur.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Retracing some paths in process algebra  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[57] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Games for recursive types </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and G. McCusker  </em> </p>
	
	<p class="publicationDetails"> 
            In C. L. Hankin, editor,
             
            <em>
            Proceedings of the 1994 Workshop on Theory and Formal Methods</em>.
        
                Pages 1&#x2212;20.
            Imperial College Press.
        1995.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1820-abstract.html">
			Details <span class="sr-only" > about <em> Games for recursive types  </em></span> </a> |
			<a href="/publications/publication1820.bib">
			BibTeX  <span class="sr-only" > data for <em> Games for recursive types  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/303/rectypes.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Games for recursive types  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[58] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Games and Full Abstraction for the Lazy &#x03bb;&#x2212;calculus </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and G. McCusker  </em> </p>
	
	<p class="publicationDetails"> 
            In D. Kozen, editor,
             
            <em>
            Proceedings of the Tenth Annual Symposium on Logic in Computer Science</em>.
        
                Pages 234&#x2212;243.
            IEEE Computer Society Press.
        1995.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1821-abstract.html">
			Details <span class="sr-only" > about <em> Games and Full Abstraction for the Lazy &#x03bb;&#x2212;calculus  </em></span> </a> |
			<a href="/publications/publication1821.bib">
			BibTeX  <span class="sr-only" > data for <em> Games and Full Abstraction for the Lazy &#x03bb;&#x2212;calculus  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[59] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Domain Theory </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and A. Jung  </em> </p>
	
	<p class="publicationDetails"> 
            In S. Abramsky&#x201a; D. Gabbay and T. S. E. Maibaum, editors,
             
            <em>
            Handbook of Logic in Computer Science</em>.
        
                Pages 1&#x2212;168.
            Oxford University Press.
        1994.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1830-abstract.html">
			Details <span class="sr-only" > about <em> Domain Theory  </em></span> </a> |
			<a href="/publications/publication1830.bib">
			BibTeX  <span class="sr-only" > data for <em> Domain Theory  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/298/handbook.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Domain Theory  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[60] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Full Abstraction for PCF (Extended Abstract) </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky&#x201a; R. Jagadeesan and P. Malacaria  </em> </p>
	
	<p class="publicationDetails"> 
            In M. Hagiya and J. C. Mitchell, editors,
             
            <em>
            Theoretical Aspects of Computer Software</em>.
        
                Pages 1&#x2212;15.
            Springer&#x2212;Verlag.
        1994.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1832-abstract.html">
			Details <span class="sr-only" > about <em> Full Abstraction for PCF (Extended Abstract)  </em></span> </a> |
			<a href="/publications/publication1832.bib">
			BibTeX  <span class="sr-only" > data for <em> Full Abstraction for PCF (Extended Abstract)  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[61] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Games and Full Completeness for Multiplicative Linear Logic </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Jagadeesan  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Journal of Symbolic Logic</em>.
        
            Vol. 59.
        
            No. 2.
        
                Pages 543&#x2212;574.
            1994.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1836-abstract.html">
			Details <span class="sr-only" > about <em> Games and Full Completeness for Multiplicative Linear Logic  </em></span> </a> |
			<a href="/publications/publication1836.bib">
			BibTeX  <span class="sr-only" > data for <em> Games and Full Completeness for Multiplicative Linear Logic  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/299/gfc.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Games and Full Completeness for Multiplicative Linear Logic  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[62] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            New Foundations for the Geometry of Interaction </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Jagadeesan  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Information and Computation&#x201a; 111(1)</em>.
        
                Pages 53&#x2212;119.
            1994.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1837-abstract.html">
			Details <span class="sr-only" > about <em> New Foundations for the Geometry of Interaction  </em></span> </a> |
			<a href="/publications/publication1837.bib">
			BibTeX  <span class="sr-only" > data for <em> New Foundations for the Geometry of Interaction  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/300/nfgoi.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> New Foundations for the Geometry of Interaction  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[63] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Proofs as Processes </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            J. Theoretical Computer Science</em>.
        
            Vol. 135.
        
                Pages 5&#x2212;9.
            1994.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1873-abstract.html">
			Details <span class="sr-only" > about <em> Proofs as Processes  </em></span> </a> |
			<a href="/publications/publication1873.bib">
			BibTeX  <span class="sr-only" > data for <em> Proofs as Processes  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/301/pasp.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Proofs as Processes  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[64] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Interaction Categories and Communicating Sequential Processes </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In A. W. Roscoe, editor,
             
            <em>
            A Classical Mind: Essays in honour of C. A. R. Hoare</em>.
        
                Pages 1&#x2212;16.
            Prentice Hall International.
        1994.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1874-abstract.html">
			Details <span class="sr-only" > about <em> Interaction Categories and Communicating Sequential Processes  </em></span> </a> |
			<a href="/publications/publication1874.bib">
			BibTeX  <span class="sr-only" > data for <em> Interaction Categories and Communicating Sequential Processes  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[65] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            An Internal Language for Autonomous Categories </strong> </p>
	    <p class="publicationAuthors"> <em> I. Mackie&#x201a; L. Roman and S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Journal of Applied Categorical Structures</em>.
        
            Vol. 1.
        
                Pages 311&#x2212;343.
            1993.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1810-abstract.html">
			Details <span class="sr-only" > about <em> An Internal Language for Autonomous Categories  </em></span> </a> |
			<a href="/publications/publication1810.bib">
			BibTeX  <span class="sr-only" > data for <em> An Internal Language for Autonomous Categories  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[66] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            An Integrated Engineering Study Scheme in Computing </strong> </p>
	    <p class="publicationAuthors"> <em> A. Finkelstein&#x201a; J. Kramer&#x201a; S. Abramsky&#x201a; K. Broda&#x201a; S. Drossopoulou and S. Eisenbach  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Computer Journal&#x201a; 36(4)</em>.
        
                Pages 320&#x2212;334.
            1993.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1812-abstract.html">
			Details <span class="sr-only" > about <em> An Integrated Engineering Study Scheme in Computing  </em></span> </a> |
			<a href="/publications/publication1812.bib">
			BibTeX  <span class="sr-only" > data for <em> An Integrated Engineering Study Scheme in Computing  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[67] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Quantales&#x201a; Observational Logic and Process Semantics </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and S. J. Vickers  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Mathematical Structures in Computer Science</em>.
        
            Vol. 3.
        
                Pages 161&#x2212;227.
            1993.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1815-abstract.html">
			Details <span class="sr-only" > about <em> Quantales&#x201a; Observational Logic and Process Semantics  </em></span> </a> |
			<a href="/publications/publication1815.bib">
			BibTeX  <span class="sr-only" > data for <em> Quantales&#x201a; Observational Logic and Process Semantics  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/297/av.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> Quantales&#x201a; Observational Logic and Process Semantics  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[68] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Full Abstraction in the Lazy &#x03bb;&#x2212;calculus </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and C.&#x2212;H. L. Ong  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Information and Computation&#x201a; 105(2)</em>.
        
                Pages 159&#x2212;268.
            1993.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1818-abstract.html">
			Details <span class="sr-only" > about <em> Full Abstraction in the Lazy &#x03bb;&#x2212;calculus  </em></span> </a> |
			<a href="/publications/publication1818.bib">
			BibTeX  <span class="sr-only" > data for <em> Full Abstraction in the Lazy &#x03bb;&#x2212;calculus  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[69] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Interaction Categories (Extended Abstract) </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In G. L. Burn&#x201a; S. J. Gay and M. D. Ryan, editors,
             
            <em>
            Theory and Formal Methods 1993</em>.
        
                Pages 57&#x2212;69.
            Springer&#x2212;Verlag.
        1993.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1871-abstract.html">
			Details <span class="sr-only" > about <em> Interaction Categories (Extended Abstract)  </em></span> </a> |
			<a href="/publications/publication1871.bib">
			BibTeX  <span class="sr-only" > data for <em> Interaction Categories (Extended Abstract)  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[70] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Computational Interpretations of Linear logic </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            J. Theoretical Computer Science&#x201a; 111</em>.
        
                Pages 3&#x2212;57.
            1993.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1872-abstract.html">
			Details <span class="sr-only" > about <em> Computational Interpretations of Linear logic  </em></span> </a> |
			<a href="/publications/publication1872.bib">
			BibTeX  <span class="sr-only" > data for <em> Computational Interpretations of Linear logic  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/296/cill.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> Computational Interpretations of Linear logic  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[71] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Games and Full Completeness for Multiplicative Linear Logic </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Jagadeesan  </em> </p>
	
	<p class="publicationDetails"> 
            In R. Shyamsundar, editor,
             
            <em>
            Foundations of Software Technology and Theoretical Computer Science</em>.
        
                Pages 291&#x2212;301.
            Springer&#x2212;Verlag.
        1992.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1834-abstract.html">
			Details <span class="sr-only" > about <em> Games and Full Completeness for Multiplicative Linear Logic  </em></span> </a> |
			<a href="/publications/publication1834.bib">
			BibTeX  <span class="sr-only" > data for <em> Games and Full Completeness for Multiplicative Linear Logic  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[72] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            New Foundations for the Geometry of Interaction </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Jagadeesan  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Symposium on Logic in Computer Science</em>.
        
                Pages 211&#x2212;222.
            Computer Society Press of the IEEE.
        1992.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1835-abstract.html">
			Details <span class="sr-only" > about <em> New Foundations for the Geometry of Interaction  </em></span> </a> |
			<a href="/publications/publication1835.bib">
			BibTeX  <span class="sr-only" > data for <em> New Foundations for the Geometry of Interaction  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[73] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Relational Approach to Strictness Analysis for Higher&#x2212;Order Polymorphic Functions </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and T. Jensen  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            ACM Symposium on Principles of Programming Languages</em>.
        
                Pages 49&#x2212;55.
            ACM Press.
        1991.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1831-abstract.html">
			Details <span class="sr-only" > about <em> A Relational Approach to Strictness Analysis for Higher&#x2212;Order Polymorphic Functions  </em></span> </a> |
			<a href="/publications/publication1831.bib">
			BibTeX  <span class="sr-only" > data for <em> A Relational Approach to Strictness Analysis for Higher&#x2212;Order Polymorphic Functions  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[74] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Domain Equation for Bisimulation </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            J. Information and Computation</em>.
        
            Vol. 92.
        
            No. 2.
        
                Pages 161&#x2212;218.
            1991.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1869-abstract.html">
			Details <span class="sr-only" > about <em> A Domain Equation for Bisimulation  </em></span> </a> |
			<a href="/publications/publication1869.bib">
			BibTeX  <span class="sr-only" > data for <em> A Domain Equation for Bisimulation  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/294/bisim.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> A Domain Equation for Bisimulation  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[75] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Domain Theory in Logical Form </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Annals of Pure and Applied Logic</em>.
        
            Vol. 51.
        
                Pages 1&#x2212;77.
            1991.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1870-abstract.html">
			Details <span class="sr-only" > about <em> Domain Theory in Logical Form  </em></span> </a> |
			<a href="/publications/publication1870.bib">
			BibTeX  <span class="sr-only" > data for <em> Domain Theory in Logical Form  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/295/dtlf.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Domain Theory in Logical Form  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[76] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Generalized Kahn Principle for Abstract Asynchronous Networks </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In M. Mislove, editor,
             
            <em>
            Symposium on Mathematical Foundations of Programming Language Semantics</em>.
        
                Pages 1&#x2212;21.
            Springer&#x2212;Verlag.
        1990.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1866-abstract.html">
			Details <span class="sr-only" > about <em> A Generalized Kahn Principle for Abstract Asynchronous Networks  </em></span> </a> |
			<a href="/publications/publication1866.bib">
			BibTeX  <span class="sr-only" > data for <em> A Generalized Kahn Principle for Abstract Asynchronous Networks  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/292/gkp.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> A Generalized Kahn Principle for Abstract Asynchronous Networks  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[77] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Abstract Interpretation&#x201a; Logical Relations and Kan Extensions </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            J. Logic and Computation&#x201a; 1(1)</em>.
        
                Pages 5&#x2212;41.
            1990.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1867-abstract.html">
			Details <span class="sr-only" > about <em> Abstract Interpretation&#x201a; Logical Relations and Kan Extensions  </em></span> </a> |
			<a href="/publications/publication1867.bib">
			BibTeX  <span class="sr-only" > data for <em> Abstract Interpretation&#x201a; Logical Relations and Kan Extensions  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[78] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The Lazy &#x03bb;&#x2212;Calculus </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In D. Turner, editor,
             
            <em>
            Research Topics in Functional Programming</em>.
        
                Pages 65&#x2212;117.
            Addison Wesley.
        1990.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1868-abstract.html">
			Details <span class="sr-only" > about <em> The Lazy &#x03bb;&#x2212;Calculus  </em></span> </a> |
			<a href="/publications/publication1868.bib">
			BibTeX  <span class="sr-only" > data for <em> The Lazy &#x03bb;&#x2212;Calculus  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/293/lazy.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> The Lazy &#x03bb;&#x2212;Calculus  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[79] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Observational Logic and Process Semantics (Abstract) </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In A. Meyer and M. Taitslin, editors,
             
            <em>
            Logic at Botik 89</em>.
        Springer&#x2212;Verlag.
        1989.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1865-abstract.html">
			Details <span class="sr-only" > about <em> Observational Logic and Process Semantics (Abstract)  </em></span> </a> |
			<a href="/publications/publication1865.bib">
			BibTeX  <span class="sr-only" > data for <em> Observational Logic and Process Semantics (Abstract)  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[80] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Partial evaluation and MIX compilation in PROLOG </strong> </p>
	    <p class="publicationAuthors"> <em> D. Fuller and S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            New Generation Computing</em>.
        
            Vol. 6.
        
                Pages 119&#x2212;143.
            1988.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1811-abstract.html">
			Details <span class="sr-only" > about <em> Partial evaluation and MIX compilation in PROLOG  </em></span> </a> |
			<a href="/publications/publication1811.bib">
			BibTeX  <span class="sr-only" > data for <em> Partial evaluation and MIX compilation in PROLOG  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[81] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Introduction to Abstract Interpretation </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and C. Hankin  </em> </p>
	
	<p class="publicationDetails"> 
            In S.Abramsky and C. Hankin, editors,
             
            <em>
            Abstract Interpretation for Declarative Languages</em>.
        
                Chapter 1.
            
                Pages 9&#x2212;31.
            Ellis Horwood.
        1987.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1841-abstract.html">
			Details <span class="sr-only" > about <em> Introduction to Abstract Interpretation  </em></span> </a> |
			<a href="/publications/publication1841.bib">
			BibTeX  <span class="sr-only" > data for <em> Introduction to Abstract Interpretation  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[82] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Domain Theory in Logical Form </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Symposium on Logic in Computer Science</em>.
        
                Pages 47&#x2212;53.
            Computer Society Press of the IEEE.
        1987.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1863-abstract.html">
			Details <span class="sr-only" > about <em> Domain Theory in Logical Form  </em></span> </a> |
			<a href="/publications/publication1863.bib">
			BibTeX  <span class="sr-only" > data for <em> Domain Theory in Logical Form  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/291/lics87.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Domain Theory in Logical Form  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[83] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Observation Equivalence as a Testing Equivalence </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            J. Theoretical Computer Science</em>.
        
                Chapter 53.
            
                Pages 225&#x2212;241.
            1987.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1864-abstract.html">
			Details <span class="sr-only" > about <em> Observation Equivalence as a Testing Equivalence  </em></span> </a> |
			<a href="/publications/publication1864.bib">
			BibTeX  <span class="sr-only" > data for <em> Observation Equivalence as a Testing Equivalence  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[84] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The Theory of Strictness Analysis for Higher Order Functions </strong> </p>
	    <p class="publicationAuthors"> <em> G. Burn&#x201a; C. Hankin and S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In H. Ganzinger and N. Jones, editors,
             
            <em>
            Programs as Data Objects</em>.
        
                Pages 42&#x2212;62.
            Springer&#x2212;Verlag.
        1986.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1813-abstract.html">
			Details <span class="sr-only" > about <em> The Theory of Strictness Analysis for Higher Order Functions  </em></span> </a> |
			<a href="/publications/publication1813.bib">
			BibTeX  <span class="sr-only" > data for <em> The Theory of Strictness Analysis for Higher Order Functions  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[85] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Strictness Analysis for Higher Order Functions </strong> </p>
	    <p class="publicationAuthors"> <em> G. Burn&#x201a; C. Hankin and S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Science of Computer Programming 7</em>.
        
                Pages 249&#x2212;278.
            1986.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1814-abstract.html">
			Details <span class="sr-only" > about <em> Strictness Analysis for Higher Order Functions  </em></span> </a> |
			<a href="/publications/publication1814.bib">
			BibTeX  <span class="sr-only" > data for <em> Strictness Analysis for Higher Order Functions  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[86] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Strictness Analysis and Polymorphic Invariance </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In H. Ganzinger and N. Jones, editors,
             
            <em>
            Programs as Data Objects</em>.
        
                Pages 1&#x2212;23.
            Springer&#x2212;Verlag.
        1986.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1862-abstract.html">
			Details <span class="sr-only" > about <em> Strictness Analysis and Polymorphic Invariance  </em></span> </a> |
			<a href="/publications/publication1862.bib">
			BibTeX  <span class="sr-only" > data for <em> Strictness Analysis and Polymorphic Invariance  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[87] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            SECD&#x2212;M: a virtual machine for applicative multiprogramming </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Sykes  </em> </p>
	
	<p class="publicationDetails"> 
            In J.&#x2212;P. Jouannaud, editor,
             
            <em>
            Functional Languages and Computer Architecture</em>.
        
                Pages 81&#x2212;98.
            Springer&#x2212;Verlag.
        1985.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1816-abstract.html">
			Details <span class="sr-only" > about <em> SECD&#x2212;M: a virtual machine for applicative multiprogramming  </em></span> </a> |
			<a href="/publications/publication1816.bib">
			BibTeX  <span class="sr-only" > data for <em> SECD&#x2212;M: a virtual machine for applicative multiprogramming  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[88] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Reasoning about concurrent systems: a functional approach </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In F. Chambers&#x201a; D. Duce and G. Jones, editors,
             
            <em>
            Distributed Systems</em>.
        
                Pages 307&#x2212;319.
            Academic Press.
        1984.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1861-abstract.html">
			Details <span class="sr-only" > about <em> Reasoning about concurrent systems: a functional approach  </em></span> </a> |
			<a href="/publications/publication1861.bib">
			BibTeX  <span class="sr-only" > data for <em> Reasoning about concurrent systems: a functional approach  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[89] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Pascal&#x2212;m: a language for the design of loosely coupled distributed systems </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and R. Bornat  </em> </p>
	
	<p class="publicationDetails"> 
            In Y. Paker and J.&#x2212;P. Verjus, editors,
             
            <em>
            Distributed Computing Systems: Synchronization&#x201a; Control and Coordination</em>.
        
                Pages 163&#x2212;189.
            Academic Press.
        1983.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1856-abstract.html">
			Details <span class="sr-only" > about <em> Pascal&#x2212;m: a language for the design of loosely coupled distributed systems  </em></span> </a> |
			<a href="/publications/publication1856.bib">
			BibTeX  <span class="sr-only" > data for <em> Pascal&#x2212;m: a language for the design of loosely coupled distributed systems  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[90] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Experiments&#x201a; Powerdomains and Fully Abstract Models for Applicative Multiprogramming </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In M. Karpinski, editor,
             
            <em>
            Foundations of Computation Theory</em>.
        
                Pages 1&#x2212;13.
            Springer&#x2212;Verlag.
        1983.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1859-abstract.html">
			Details <span class="sr-only" > about <em> Experiments&#x201a; Powerdomains and Fully Abstract Models for Applicative Multiprogramming  </em></span> </a> |
			<a href="/publications/publication1859.bib">
			BibTeX  <span class="sr-only" > data for <em> Experiments&#x201a; Powerdomains and Fully Abstract Models for Applicative Multiprogramming  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[91] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Semantic Foundations for Applicative Multiprogramming </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            In J. Diaz, editor,
             
            <em>
            Automata&#x201a; Languages and Programming</em>.
        
                Pages 1&#x2212;14.
            Springer&#x2212;Verlag.
        1983.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1860-abstract.html">
			Details <span class="sr-only" > about <em> Semantic Foundations for Applicative Multiprogramming  </em></span> </a> |
			<a href="/publications/publication1860.bib">
			BibTeX  <span class="sr-only" > data for <em> Semantic Foundations for Applicative Multiprogramming  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[92] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Pascal&#x2212;m in Office Information Systems </strong> </p>
	    <p class="publicationAuthors"> <em> S. Abramsky and S. Cook  </em> </p>
	
	<p class="publicationDetails"> 
            In N. Naffah, editor,
             
            <em>
            Office Information Systems</em>.
        North Holland.
        1982.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1851-abstract.html">
			Details <span class="sr-only" > about <em> Pascal&#x2212;m in Office Information Systems  </em></span> </a> |
			<a href="/publications/publication1851.bib">
			BibTeX  <span class="sr-only" > data for <em> Pascal&#x2212;m in Office Information Systems  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li></ul><h2>
      Technical reports
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Coalgebras&#x201a; Chu Spaces&#x201a; and Representations of Physical Systems </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            No. RR&#x2212;09&#x2212;11.
        OUCL.
        October,
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication3339-abstract.html">
			Details <span class="sr-only" > about <em> Coalgebras&#x201a; Chu Spaces&#x201a; and Representations of Physical Systems  </em></span> </a> |
			<a href="/publications/publication3339.bib">
			BibTeX  <span class="sr-only" > data for <em> Coalgebras&#x201a; Chu Spaces&#x201a; and Representations of Physical Systems  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/2506/RR-09-11.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Coalgebras&#x201a; Chu Spaces&#x201a; and Representations of Physical Systems  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[2] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Big Toy Models: Representing Physical Systems As Chu Spaces </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky  </em> </p>
	
	<p class="publicationDetails"> 
            No. RR&#x2212;09&#x2212;08.
        OUCL.
        September,
            2009.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication3244-abstract.html">
			Details <span class="sr-only" > about <em> Big Toy Models: Representing Physical Systems As Chu Spaces  </em></span> </a> |
			<a href="/publications/publication3244.bib">
			BibTeX  <span class="sr-only" > data for <em> Big Toy Models: Representing Physical Systems As Chu Spaces  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/2372/RR-09-08.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Big Toy Models: Representing Physical Systems As Chu Spaces  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[3] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Categorical semantics of Quantum Protocols </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky and Bob Coecke  </em> </p>
	
	<p class="publicationDetails"> 
            No. RR&#x2212;04&#x2212;02.
        Oxford University Computing Laboratory.
        February,
            2004.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication25-abstract.html">
			Details <span class="sr-only" > about <em> A Categorical semantics of Quantum Protocols  </em></span> </a> |
			<a href="/publications/publication25.bib">
			BibTeX  <span class="sr-only" > data for <em> A Categorical semantics of Quantum Protocols  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/704/RR-04-02.ps">Download
					     (ps)

					    <span class="sr-only" > of <em> A Categorical semantics of Quantum Protocols  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[4] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A game semantics for generic polymorphism </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky and Radha Jagadeesan  </em> </p>
	
	<p class="publicationDetails"> 
            No. RR&#x2212;03&#x2212;02.
        Oxford University Computing Laboratory.
        January,
            2003.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication2589-abstract.html">
			Details <span class="sr-only" > about <em> A game semantics for generic polymorphism  </em></span> </a> |
			<a href="/publications/publication2589.bib">
			BibTeX  <span class="sr-only" > data for <em> A game semantics for generic polymorphism  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/943/RR-03-02.ps.gz">Download
					     (ps.gz)

					    <span class="sr-only" > of <em> A game semantics for generic polymorphism  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li></ul><h2>
      Theses
      </h2><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Domain Theory and the Logic of Observable Properties </strong> </p>
	    <p class="publicationAuthors"> <em> Samson Abramsky  </em> </p>
	
	<p class="publicationDetails">  PhD Thesis 1987.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication1451-abstract.html">
			Details <span class="sr-only" > about <em> Domain Theory and the Logic of Observable Properties  </em></span> </a> |
			<a href="/publications/publication1451.bib">
			BibTeX  <span class="sr-only" > data for <em> Domain Theory and the Logic of Observable Properties  </em></span>   </a>
			
			

				     |
                			<a 
                			    href="http://www.cs.ox.ac.uk/files/350/thesis.pdf">Download
					     (pdf)

					    <span class="sr-only" > of <em> Domain Theory and the Logic of Observable Properties  </em></span>

					    </a>


				    
		
		</div> 
	</div> 
	
        </li></ul></div><div class="col-xs-12 col-md-3 col-md-pull-9 side-menu-col"><h2 class="side-menu-title text-uppercase"><a href="#">About Us</a></h2><ul class="side-menu"><li class="active mobile-menu-source"><a href="/people/">People</a><ul><li><a href="/people/faculty.html">Faculty</a></li><li><a href="/people/research.html">Research</a></li><li><a href="/people/students.html">Students</a></li><li><a href="/people/support.html">Professional Services</a></li><li><a href="/people/visitingprofessors.html">Visiting Professors</a></li><li class="active"><a href="/people/emeritusfaculty.html">Emeritus Faculty</a></li></ul></li><li><a href="/aboutus/vacancies/">Vacancies</a></li><li><a href="/aboutus/women-cs-oxford/index.html">Women in the department</a></li><li><a href="/aboutus/equality-diversity-inclusion/index.html">Equality, diversity and inclusion</a></li><li><a href="https://www.alumniweb.ox.ac.uk/cs/make-a-donation">Support Us</a></li><li><a href="/aboutus/cshistory.html">Our History</a></li><li><a href="/aboutus/contact.html">Contact Us</a></li></ul></div></div></div>[an error occurred while processing this directive]