|
|
Samson Abramsky: Publications
by date |
by title |
by type |
bibtex
books
|
[1]
|
Category Theory and Computer Programming
S. Abramsky et al. , editors
Springer. 1986.
Details
|
BibTeX
|
|
[2]
|
Abstract Interpretation for Declarative Languages
S. Abramsky, Chris Hankin, editors
Ellis Horwood. 1987.
Details
|
BibTeX
|
|
[3]
|
Proceedings of TAPSOFT 91
S. Abramsky, T. S. E. Maibaum, editors
Vol. 493-494. Springer Lecture Notes in Computer Science. 1991.
Details
|
BibTeX
|
|
[4]
|
The Handbook of Logic in Computer Science
S. Abramsky, D. Gabbay and T. S. E. Maibaum, editors
Oxford University Press. 2000.
Volumes 1 and 2—-Background: Mathematical Structures and Back- ground: Computational Structures—-published in 1992. Volumes 3 and 4—-Semantic Structures and Semantic Modelling—- published in 1995. Volume 5—-Logic and Algebraic Methods.
Details
|
BibTeX
|
conference papers
|
[1]
|
Petri Nets, Discrete Physics, and Distributed Quantum Computation
Samson Abramsky
In Pierpaolo Degano, Rocco De Nicola and Jose Meseguer, editors, Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday. Vol. 5065 of Lecture Notes in Computer Science, pages 527—543. Springer, 2008.
Details
|
BibTeX
| Download (pdf) |
|
[2]
|
A Compositional Game Semantics for Multi-Agent Logics of Partial Information
Samson Abramsky
Vol. 1 of Texts in Logic and Games, pages 11—48. Amsterdam University Press, 2007.
Details
|
BibTeX
| Download (pdf) |
|
[3]
|
A fully abstract denotational semantics for the calculus of higher-order communicating systems
B. Thomsen, S. Abramsky
In Theoretical Computer Science Vol. 254, pages 557-589. 2001.
Details
|
BibTeX
|
|
[4]
|
An Internal Language for Autonomous Categories
I. Mackie, L. Roman and S. Abramsky
In Journal of Applied Categorical Structures Vol. 1, pages 311-343. 1993.
Details
|
BibTeX
|
|
[5]
|
Partial evaluation and MIX compilation in PROLOG
D. Fuller, S. Abramsky
In New Generation Computing Vol. 6, pages 119-143. 1988.
Details
|
BibTeX
|
|
[6]
|
An Integrated Engineering Study Scheme in Computing
A. Finkelstein et al.
In Computer Journal, 36(4) pages 320-334. 1993.
Details
|
BibTeX
|
|
[7]
|
The Theory of Strictness Analysis for Higher Order Functions
G. Burn, C. Hankin and S. Abramsky
In H. Ganzinger, N. Jones, editors, Programs as Data Objects pages 42-62. Springer-Verlag, 1986.
Details
|
BibTeX
|
|
[8]
|
Strictness Analysis for Higher Order Functions
G. Burn, C. Hankin and S. Abramsky
In Science of Computer Programming 7 pages 249-278. 1986.
Details
|
BibTeX
|
|
[9]
|
Quantales, Observational Logic and Process Semantics
S. Abramsky, S. J. Vickers
In Mathematical Structures in Computer Science Vol. 3, pages 161-227. 1993.
Details
|
BibTeX
| Download (ps) |
|
[10]
|
SECD-M: a virtual machine for applicative multiprogramming
S. Abramsky, R. Sykes
In J.-P. Jouannaud, editor, Functional Languages and Computer Architecture pages 81-98. Springer-Verlag, 1985.
Details
|
BibTeX
|
|
[11]
|
Specifying Processes
S. Abramsky, D. Pavlovic
In E. Moggi, G. Rosolini, editors, Proceedings of the International Symposium on Category Theory In Computer Science Vol. 1290 of Springer Lecture Notes in Computer Science, pages 147-158. Springer-Verlag, 1997.
Details
|
BibTeX
| Download (ps) |
|
[12]
|
Full Abstraction in the Lazy λ-calculus
S. Abramsky, C.-H. L. Ong
In Information and Computation, 105(2) pages 159-268. 1993.
Details
|
BibTeX
|
|
[13]
|
Concurrent Games and Full Completeness
S. Abramsky, P.-A. Melliés
In Proceedings of the Fourteenth International Symposium on Logic in Computer Science pages 431-442. Computer Society Press of the IEEE, 1999.
Details
|
BibTeX
| Download (pdf) |
|
[14]
|
Games for recursive types
S. Abramsky, G. McCusker
In C. L. Hankin, editor, Proceedings of the 1994 Workshop on Theory and Formal Methods pages 1-20. Imperial College Press, 1995.
Details
|
BibTeX
| Download (ps.gz) |
|
[15]
|
Games and Full Abstraction for the Lazy λ-calculus
S. Abramsky, G. McCusker
In D. Kozen, editor, Proceedings of the Tenth Annual Symposium on Logic in Computer Science pages 234-243. IEEE Computer Society Press, 1995.
Details
|
BibTeX
|
|
[16]
|
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol
S. Abramsky, G. McCusker
In P. O'Hearn, R. D. Tennent, editors, Algol-like Languages pages 317-348. Birkhauser, 1997.
Details
|
BibTeX
| Download (ps.gz) |
|
[17]
|
Call-by-value games
S. Abramsky, G. McCusker
In M. Nielsen, W. Thomas, editors, Proceedings of the Eleventh International Workshop on Computer Science Logic Vol. 1414 of Springer Lecture Notes in Computer Science, pages 1-17. Springer-Verlag, 1998.
Details
|
BibTeX
| Download (ps.gz) |
|
[18]
|
Full Abstraction for Idealized Algol with passive expressions
S. Abramsky, G. McCusker
In Theoretical Computer Science Vol. 227, pages 3-42. 1999.
Details
|
BibTeX
| Download (ps.gz) |
|
[19]
|
Game Semantics
S. Abramsky, G. McCusker
In H. Schwichtenberg, U. Berger, editors, Computational Logic: Proceedings of the 1997 Marktoberdorf Summer School pages 1-56. Springer-Verlag, 1999.
Details
|
BibTeX
| Download (ps.gz) |
|
[20]
|
Axiomatizing Fully Complete Models for ML Polymorphic Types
S. Abramsky, M. Lenisa
In M. Nielsen, B. Rovan, editors, Proceedings of the International Symposium on Mathematical Foundations of Computer Science Vol. 1893 of Springer Lecture Notes in Computer Science, pages 141-151. Springer-Verlag, 2000.
Details
|
BibTeX
| Download (ps) |
|
[21]
|
A Fully Complete PER Model for ML Polymorphic Types
S. Abramsky, M. Lenisa
In P. Clote, H. Schwichtenberg, editors, Proceedings of the Fourteenth International Workshop on Computer Science Logic Vol. 1862 of Springer Lecture Notes in Computer Science, pages 140-155. Springer-Verlag, 2000.
Details
|
BibTeX
| Download (ps) |
|
[22]
|
Fully Complete Minimal PER Models for the Simply Typed λ-calculus
S. Abramsky, M. Lenisa
In CSL 2001 Conference Proceedings Vol. 2142 of Springer LNCS, pages 442-457. 2001.
Details
|
BibTeX
| Download (ps) |
|
[23]
|
Linear realizability and full completeness for typed lambda-calculi
S. Abramsky, M. Lenisa
In Annals of Pure and Applied Logic Vol. 134, pages 122-168. 2005.
Details
|
BibTeX
| Download (ps) |
|
[24]
|
Domain Theory
S. Abramsky, A. Jung
In S. Abramsky, D. Gabbay and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science pages 1-168. Oxford University Press, 1994.
Details
|
BibTeX
| Download (pdf) |
|
[25]
|
A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions
S. Abramsky, T. Jensen
In ACM Symposium on Principles of Programming Languages pages 49-55. ACM Press, 1991.
Details
|
BibTeX
|
|
[26]
|
Full Abstraction for PCF (Extended Abstract)
S. Abramsky, R. Jagadeesan and P. Malacaria
In M. Hagiya, J. C. Mitchell, editors, Theoretical Aspects of Computer Software pages 1-15. Springer-Verlag, 1994.
Details
|
BibTeX
|
|
[27]
|
Full Abstraction for PCF
S. Abramsky, R. Jagadeesan and P. Malacaria
In Information and Computation Vol. 163, pages 409-470. 2000.
Details
|
BibTeX
| Download (pdf) |
|
[28]
|
Games and Full Completeness for Multiplicative Linear Logic
S. Abramsky, R. Jagadeesan
In R. Shyamsundar, editor, Foundations of Software Technology and Theoretical Computer Science pages 291-301. Springer-Verlag, 1992.
Details
|
BibTeX
|
|
[29]
|
New Foundations for the Geometry of Interaction
S. Abramsky, R. Jagadeesan
In Symposium on Logic in Computer Science pages 211-222. Computer Society Press of the IEEE, 1992.
Details
|
BibTeX
|
|
[30]
|
Games and Full Completeness for Multiplicative Linear Logic
S. Abramsky, R. Jagadeesan
In Journal of Symbolic Logic Vol. 59, No. 2, pages 543-574. 1994.
Details
|
BibTeX
| Download (pdf) |
|
[31]
|
New Foundations for the Geometry of Interaction
S. Abramsky, R. Jagadeesan
In Information and Computation, 111(1) pages 53-119. 1994.
Details
|
BibTeX
| Download (pdf) |
|
[32]
|
A Game semantics for Generic Polymorphism
S. Abramsky, R. Jagadeesan
In A. D. Gordon, editor, Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Vol. 2620 of Springer Lecture Notes in Computer Science, pages 1-22. 2003.
Details
|
BibTeX
| Download (ps) |
|
[33]
|
A Game Semantics for Generic Polymorphism
S. Abramsky, R. Jagadeesan
In Annals of Pure and Applied Logic Vol. 133, pages 3-37. 2005.
Details
|
BibTeX
| Download (pdf) |
|
[34]
|
A fully abstract game semantics for general references
S. Abramsky, K. Honda and G. McCusker
In Proceedings of the Thirteenth International Symposium on Logic in Computer Science pages 334-344. Computer Society Press of the IEEE, 1998.
Details
|
BibTeX
| Download (ps.gz) |
|
[35]
|
Introduction to Abstract Interpretation
S. Abramsky, C. Hankin
In S.Abramsky, C. Hankin, editors, Abstract Interpretation for Declarative Languages chapter 1, pages 9-31. Ellis Horwood, 1987.
Details
|
BibTeX
|
|
[36]
|
Geometry of Interaction and linear combinatory algebras
S. Abramsky, E. Haghverdi and P. Scott
In Mathematical Structures in Computer Science Vol. 12, pages 625-665. 2002.
Details
|
BibTeX
| Download (ps) |
|
[37]
|
Algorithmic Game Semantics and Component-Based Verification
S. Abramsky et al.
In Proceedings of SAVBCS 2003: Specification and Verification of Component-Based Systems, Workshop at ESEC/FASE 2003 pages 66-74. 2003.
published as Technical Report 03-11, Department of Computer Science, Iowa State University.
Details
|
BibTeX
| Download (pdf) |
|
[38]
|
Applying Game Semantics to Compositional Software Modelling and verification
S. Abramsky et al.
In TACAS 2004: Tools and Algorithms for the Construction and Analysis of Systems, 10 International Conference Vol. 2988, pages 421-435. Springer LNCS, 2004.
Details
|
BibTeX
|
|
[39]
|
Nominal games and Full Abstraction for the Nu-Calculus
S. Abramsky et al.
In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004 pages 150-159. IEEE Computer Society, 2004.
Details
|
BibTeX
| Download (pdf) |
|
[40]
|
A Specification Structure for Deadlock-freedom of Synchronous Processes
S. Abramsky, S. J. Gay and R. Nagarajan
In Theoretical Computer Science Vol. 222, pages 1-53. 1999.
Details
|
BibTeX
| Download (ps) |
|
[41]
|
Specification Structures and Propositions-as-Types for Concurrency
S. Abramsky, S. Gay and R. Nagarajan
In G. Birtwistle, F. Moller, editors, Logics for Concurrency: Structure vs. Automata—-Proceedings of the VI I Ith Banff Higher Order Workshop pages 5-40. Springer-Verlag, 1996.
Details
|
BibTeX
| Download (ps) |
|
[42]
|
Interaction Categories and the Foundations of Typed Concurrent Programming
S. Abramsky, S. Gay and R. Nagarajan
In M. Broy, editor, Proceedings of the 1994 Marktoberdorf Summer Sxhool on Deductive Program Design pages 35-113. Springer-Verlag, 1996.
Details
|
BibTeX
| Download (ps) |
|
[43]
|
A Type-theoretic Approach to Deadlock-freedom of Asynchronous Systems
S. Abramsky, S. Gay and R. Nagarajan
In M. Abadi, T. Ito, editors, Theoretical Aspects of Computer Software Vol. 1281 of Springer Lecture Notes in Computer Science, pages 295-320. Springer-Verlag, 1997.
Details
|
BibTeX
| Download (ps) |
|
[44]
|
A Categorical Quantum Logic
S. Abramsky, R. Duncan
In Mathematical Structures in Computer Science, 16 pages 469-489. 2006.
Details
|
BibTeX
| Download (pdf) |
|
[45]
|
Pascal-m in Office Information Systems
S. Abramsky, S. Cook
In N. Naffah, editor, Office Information Systems North Holland, 1982.
Details
|
BibTeX
|
|
[46]
|
Physical Traces: Quantum vs. Classical Information Processing
S. Abramsky, B. Coecke
In Electronic Notes in Theoretical Computer Science Vol. 69, pages 1-26. 2003.
Details
|
BibTeX
| Link (pdf) |
|
[47]
|
A Categorical Semantics of Quantum Protocols
S. Abramsky, B. Coecke
In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004 pages 415-425. IEEE Computer Society, 2004.
Details
|
BibTeX
| Download (ps) |
|
[48]
|
Abstract Physical Traces
S. Abramsky, B. Coecke
In Theory and Applications of Categories Vol. 14, pages 111-124. 2005.
Details
|
BibTeX
| Download (ps) |
|
[49]
|
Physics from Computer Science
S. Abramsky, B. Coecke
In International Journal of Unconventional Computing Vol. 3, No. 3, pages 179-197. 2007.
Details
|
BibTeX
| Download (pdf) |
|
[50]
|
Pascal-m: a language for the design of loosely coupled distributed systems
S. Abramsky, R. Bornat
In Y. Paker, J.-P. Verjus, editors, Distributed Computing Systems: Synchronization, Control and Coordination pages 163-189. Academic Press, 1983.
Details
|
BibTeX
|
|
[51]
|
Nuclear and trace ideals in tensored *-categories
S. Abramsky, R. Blute and P. Panangaden
In J. Pure and Applied Algebra Vol. 143, pages 3-47. 1999.
Details
|
BibTeX
| Download (ps) |
|
[52]
|
Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming
S. Abramsky
In M. Karpinski, editor, Foundations of Computation Theory pages 1-13. Springer-Verlag, 1983.
Details
|
BibTeX
|
|
[53]
|
Semantic Foundations for Applicative Multiprogramming
S. Abramsky
In J. Diaz, editor, Automata, Languages and Programming pages 1-14. Springer-Verlag, 1983.
Details
|
BibTeX
|
|
[54]
|
Reasoning about concurrent systems: a functional approach
S. Abramsky
In F. Chambers, D. Duce and G. Jones, editors, Distributed Systems pages 307-319. Academic Press, 1984.
Details
|
BibTeX
|
|
[55]
|
Strictness Analysis and Polymorphic Invariance
S. Abramsky
In H. Ganzinger, N. Jones, editors, Programs as Data Objects pages 1-23. Springer-Verlag, 1986.
Details
|
BibTeX
|
|
[56]
|
Domain Theory in Logical Form
S. Abramsky
In Symposium on Logic in Computer Science pages 47-53. Computer Society Press of the IEEE, 1987.
Details
|
BibTeX
| Download (pdf) |
|
[57]
|
Observation Equivalence as a Testing Equivalence
S. Abramsky
In J. Theoretical Computer Science chapter 53, pages 225-241. 1987.
Details
|
BibTeX
|
|
[58]
|
Observational Logic and Process Semantics (Abstract)
S. Abramsky
In A. Meyer, M. Taitslin, editors, Logic at Botik 89 Springer-Verlag, 1989.
Details
|
BibTeX
|
|
[59]
|
A Generalized Kahn Principle for Abstract Asynchronous Networks
S. Abramsky
In M. Mislove, editor, Symposium on Mathematical Foundations of Programming Language Semantics pages 1-21. Springer-Verlag, 1990.
Details
|
BibTeX
| Download (ps.gz) |
|
[60]
|
Abstract Interpretation, Logical Relations and Kan Extensions
S. Abramsky
In J. Logic and Computation, 1(1) pages 5-41. 1990.
Details
|
BibTeX
|
|
[61]
|
The Lazy λ-Calculus
S. Abramsky
In D. Turner, editor, Research Topics in Functional Programming pages 65-117. Addison Wesley, 1990.
Details
|
BibTeX
| Download (pdf) |
|
[62]
|
A Domain Equation for Bisimulation
S. Abramsky
In J. Information and Computation Vol. 92, No. 2, pages 161-218. 1991.
Details
|
BibTeX
| Download (ps.gz) |
|
[63]
|
Domain Theory in Logical Form
S. Abramsky
In Annals of Pure and Applied Logic Vol. 51, pages 1-77. 1991.
Details
|
BibTeX
| Download (pdf) |
|
[64]
|
Interaction Categories (Extended Abstract)
S. Abramsky
In G. L. Burn, S. J. Gay and M. D. Ryan, editors, Theory and Formal Methods 1993 pages 57-69. Springer-Verlag, 1993.
Details
|
BibTeX
|
|
[65]
|
Computational Interpretations of Linear logic
S. Abramsky
In J. Theoretical Computer Science, 111 pages 3-57. 1993.
Details
|
BibTeX
| Download (ps.gz) |
|
[66]
|
Proofs as Processes
S. Abramsky
In J. Theoretical Computer Science Vol. 135, pages 5-9. 1994.
Details
|
BibTeX
| Download (ps) |
|
[67]
|
Interaction Categories and Communicating Sequential Processes
S. Abramsky
In A. W. Roscoe, editor, A Classical Mind: Essays in honour of C. A. R. Hoare pages 1-16. Prentice Hall International, 1994.
Details
|
BibTeX
|
|
[68]
|
Retracing some paths in process algebra
S. Abramsky
In U. Montanari, V. Sassone, editors, CONCUR '96: Concurrency Theory, 7th International Conference pages 1-17. Springer-Verlag, 1996.
Details
|
BibTeX
| Download (ps.gz) |
|
[69]
|
Games in the Semantics of Programming Languages
S. Abramsky
In P. Dekker, M. Stokhof and Y. Venema, editors, Proceedings of the 11th Amsterdam Colloquium pages 1-6. ILLC, Dept. of Philosophy, University of Amsterdam, 1997.
Details
|
BibTeX
| Download (ps.gz) |
|
[70]
|
Game Semantics for Programming Languages
S. Abramsky
In I. Privara, P. Ruzicka, editors, 22nd International Symposium on Mathematical Foundations of Computer Science Vol. 1295 of Springer Lecture Notes in Computer Science, pages 3-4. Springer-Verlag, 1997.
Details
|
BibTeX
|
|
[71]
|
Semantics of Interaction: an introduction to Game Semantics
S. Abramsky
In P. Dybjer, A. Pitts, editors, Proceedings of the 1996 CLiCS Summer School, Isaac Newton Institute pages 1-31. Cambridge University Press, 1997.
Details
|
BibTeX
| Download (pdf) |
|
[72]
|
Axioms for Definability and Full Completeness
S. Abramsky
In G. Plotkin, M. Tofte and C. Stirling, editors, Essays in Honour of Robin Milner pages 55-75. MIT Press, 1999.
Details
|
BibTeX
| Download (ps.gz) |
|
[73]
|
Concurrent Interaction Games
S. Abramsky
In J. Davies, A. W. Roscoe, J. Woodcock, editors, Millennial Perspectives in Computer Science pages 1-12. Palgrave, 2000.
Details
|
BibTeX
| Download (ps) |
|
[74]
|
Process Realizability
S. Abramsky
In F. L. Bauer, R. Steinbrüggen, editors, Foundations of Secure Computation: Proceedings of the 1999 Marktoberdorf Summer School pages 167-180. IOS Press, 2000.
Details
|
BibTeX
| Download (ps.gz) |
|
[75]
|
Algorithmic Game Semantics: A Tutorial Introduction
S. Abramsky
In H. Schichtenberg, R. Steinbrüggen, editors, Proceedings of the NATO Advanced Study Institute, Marktober- dorf chapter Proof and System Reliability, pages 21-47. Kluwer Academic Publishers, 2001.
Details
|
BibTeX
| Download (ps) |
|
[76]
|
A Structural Approach to Reversible Computation
S. Abramsky
In D. Beauquier, Y. Matiyasevich, editors, LCCS 2001: Proceedings of the International Workshop on Logic and Complexity in Computer Science pages 1-16. 2001.
Details
|
BibTeX
| Download (ps.gz) |
|
[77]
|
Sequentiality vs. concurrency in games and logic
S. Abramsky
In Mathematical Structures in Computer Science Vol. 13, pages 531-565. 2003.
Details
|
BibTeX
| Download (ps.gz) |
|
[78]
|
High-Level Methods for Quantum Computation and Information
S. Abramsky
In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004 pages 410-414. IEEE Computer Society, 2004.
Details
|
BibTeX
| Download (ps) |
|
[79]
|
A Structural Approach To Reversible Computation
S. Abramsky
In Theoretical Computer Science Vol. 347, No. 3, pages 441-464. 2005.
Details
|
BibTeX
| Download (pdf) |
|
[80]
|
A Cook's Tour of the Finitary Non-Well-Founded Sets
S. Abramsky
In Sergei Artemov et al. , editors, We Will Show Them: Essays in honour of Dov Gabbay Vol. 1, pages 1-18. College Publications, 2005.
Details
|
BibTeX
| Download (pdf) |
|
[81]
|
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
S. Abramsky
In Proceedings of CALCO 2005 Vol. 3629 of Springer Lecture Notes in Computer Science, pages 1-31. 2005.
Details
|
BibTeX
| Download (pdf) |
|
[82]
|
What are the fundamental structures of concurrency? We still don't know!
S. Abramsky
In Algebraic process calculi: the first 25 years and beyond pages 1-5. June 2005.
Details
|
BibTeX
| Download (pdf) |
|
[83]
|
What are the fundamental structures of concurrency? We still don't know!
S. Abramsky
In Electronic Notes in Theoretical Computer Science, 162 pages 37-41. 2006.
Details
|
BibTeX
| Download (pdf) |
|
[84]
|
Socially Responsive, Environmentally Friendly Logic
S. Abramsky
In Aho, Tuomo, Ahti-Veikko Pietarinen, editors, Truth and Games: Essays in Honour of Gabriel Sandu pages 17-46. Acta Philosophica Fennica, Societas Philosophicas Fennica, Helsinki, 2006.
Details
|
BibTeX
| Download (pdf) |
|
[85]
|
Temperley-Lieb algebra: From knot theory to logic and computation via quantum mechanics
S. Abramsky
In Goong Chen, Louis Kauffman and Sam Lomonaco, editors, Mathematics of Quantum Computing and Technology pages 415-458. Taylor and Francis, 2007.
Details
|
BibTeX
| Download (pdf) |
|
[86]
|
Event Domains, Stable Functions and Proof Nets
S. Abramsky
In Plotkin Festschrift Vol. 172 of Electronic Notes in Theoretical Computer Science, pages 33-67. 2007.
Details
|
BibTeX
| Download (pdf) |
technical reports
|
[1]
|
A game semantics for generic polymorphism
Samson Abramsky, Radha Jagadeesan
No. RR-03-02, Technical Report, Oxford University Computing Laboratory. January 2003.
Details
|
BibTeX
| Download (ps.gz) |
|
[2]
|
A Categorical semantics of Quantum Protocols
Samson Abramsky, Bob Coecke
No. RR-04-02, Technical Report, Oxford University Computing Laboratory. February 2004.
Details
|
BibTeX
| Download (ps) |
theses
|
|
|
|
