Samson Abramsky

	2012
116		Samson Abramsky, Lucien Hardy: Logical Bell Inequalities CoRR abs/1203.1352: (2012)
	2011
115		Samson Abramsky: The Logic and Topology of Non-locality and Contextuality. UC 2011: 1
114		Samson Abramsky, Adam Brandenburger: A Unified Sheaf-Theoretic Account Of Non-Locality and Contextuality CoRR abs/1102.0264: (2011)
113		Samson Abramsky, Nikos Tzevelekos: Introduction to Categories and Categorical Logic CoRR abs/1102.1313: (2011)
112		Samson Abramsky, Jouko A. Väänänen: From IF to BI: a tale of dependence and separation CoRR abs/1102.1388: (2011)
111		Samson Abramsky, Shane Mansfield, Rui Soares Barbosa: The Cohomology of Non-Locality and Contextuality CoRR abs/1111.3620: (2011)
110		Samson Abramsky: A Cook's Tour of the Finitary Non-Well-Founded Sets CoRR abs/1111.7148: (2011)
109		Samson Abramsky: A Structural Approach to Reversible Computation CoRR abs/1111.7154: (2011)
108		Samson Abramsky: Sequentiality vs. Concurrency in Games and Logic CoRR abs/1111.7159: (2011)
107		Samson Abramsky: Domain Theory and the Logic of Observable Properties CoRR abs/1112.0347: (2011)
106		Samson Abramsky: A Generalized Kahn Principle for Abstract Asynchronous Networks CoRR abs/1112.0427: (2011)
	2010
105		Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I Springer 2010
104		Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II Springer 2010
103		Samson Abramsky: Coalgebras, Chu Spaces, and Representations of Physical Systems. LICS 2010: 411-420
102		Samson Abramsky, Jonathan A. Zvesper: From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference CoRR abs/1006.0992: (2010)
101		Samson Abramsky: Relational Hidden Variables and Non-Locality CoRR abs/1007.2754: (2010)
100		Samson Abramsky: Robin Milner's Work on Concurrency. Electr. Notes Theor. Comput. Sci. 265: 5-10 (2010)
	2009
99		Samson Abramsky: Games, Interaction and Computation. Ershov Memorial Conference 2009: 1
98		Samson Abramsky: Logic and Geometry of Agents in Agent-Based Modeling. Encyclopedia of Complexity and Systems Science 2009: 5286-5299
97		Samson Abramsky: Big Toy Models: Representing Physical Systems As Chu Spaces CoRR abs/0910.2393: (2009)
96		Samson Abramsky: Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories CoRR abs/0910.2931: (2009)
95		Samson Abramsky, Bob Coecke: Abstract Physical Traces CoRR abs/0910.3144: (2009)
94		Samson Abramsky: Coalgebras, Chu Spaces, and Representations of Physical Systems CoRR abs/0910.3959: (2009)
93		Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi: Preface. Electr. Notes Theor. Comput. Sci. 249: 1-2 (2009)
92		Samson Abramsky, Radha Jagadeesan: Game Semantics for Access Control. Electr. Notes Theor. Comput. Sci. 249: 135-156 (2009)
91		Samson Abramsky, Jouko A. Väänänen: From IF to BI. Synthese 167(2): 207-230 (2009)
	2008
90		Erol Gelenbe, Samson Abramsky, Vladimiro Sassone: Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008 British Computer Society 2008
89		Susan Stepney, Samson Abramsky, Andy Adamatzky, Colin G. Johnson, Jon Timmis: Grand Challenge 7: Journeys in Non-Classical Computation. BCS Int. Acad. Conf. 2008: 407-421
88		Samson Abramsky: Types, Orthogonality and Genericity: Some Tools for Communicating Process Architectures. CPA 2008: 1-13
87		Samson Abramsky: Petri Nets, Discrete Physics, and Distributed Quantum Computation. Concurrency, Graphs and Models 2008: 527-543
	2007
86		Samson Abramsky: Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract). CSL 2007: 1-2
85		Samson Abramsky: Petri Nets, Discrete Physics, and Distributed Quantum Computation. ICATPN 2007: 1-2
84		Samson Abramsky: Event Domains, Stable Functions and Proof-Nets. Electr. Notes Theor. Comput. Sci. 172: 33-67 (2007)
	2006
83		Samson Abramsky, Erich Grädel, Johann A. Makowsky: The Ackermann Award 2006. CSL 2006: 622-626
82		Samson Abramsky: What are the Fundamental Structures of Concurrency?: We still don't know! Electr. Notes Theor. Comput. Sci. 162: 37-41 (2006)
81		Samson Abramsky, Ross Duncan: A categorical quantum logic. Mathematical Structures in Computer Science 16(3): 469-489 (2006)
	2005
80		Samson Abramsky: Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories. CALCO 2005: 1-29
79		Samson Abramsky: Algorithmic Game Semantics and Static Analysis. SAS 2005: 1
78		Samson Abramsky, Bob Coecke: Discrete classical vs. continuous quantum data in abstract quantum mechanics. Spatial Representation 2005
77		Samson Abramsky: A Cook's Tour of the Finitary Non-Well-Founded Sets. We Will Show Them! (1) 2005: 1-18
76		Samson Abramsky, Radha Jagadeesan: A game semantics for generic polymorphism. Ann. Pure Appl. Logic 133(1-3): 3-37 (2005)
75		Samson Abramsky, Marina Lenisa: Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Logic 134(2-3): 122-168 (2005)
74		Samson Abramsky, Ross Duncan: A Categorical Quantum Logic CoRR abs/quant-ph/0512114: (2005)
73		Samson Abramsky, Marios Mavronicolas: Game Theory Meets Theoretical Computer Science. Theor. Comput. Sci. 343(1-2): 1-3 (2005)
72		Samson Abramsky: A structural approach to reversible computation. Theor. Comput. Sci. 347(3): 441-464 (2005)
	2004
71		Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian D. B. Stark: Nominal Games and Full Abstraction for the Nu-Calculus. LICS 2004: 150-159
70		Samson Abramsky: High-Level Methods for Quantum Computation and Information. LICS 2004: 410-414
69		Samson Abramsky, Bob Coecke: A Categorical Semantics of Quantum Protocols. LICS 2004: 415-425
68		Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong: Applying Game Semantics to Compositional Software Modeling and Verification. TACAS 2004: 421-435
67		Samson Abramsky, Bob Coecke: A categorical semantics of quantum protocols CoRR quant-ph/0402130: (2004)
	2003
66		Samson Abramsky, Radha Jagadeesan: A Game Semantics for Generic Polymorphism. FoSSaCS 2003: 1-22
65		Samson Abramsky: Sequentiality vs. Concurrency In Games And Logic. Mathematical Structures in Computer Science 13(4): 531-565 (2003)
	2002
64		Samson Abramsky, Bob Coecke: Physical Traces: Quantum vs. Classical Information Processing CoRR cs.CG/0207057: (2002)
63		Samson Abramsky, Bob Coecke: Physical Traces: Quantum vs. Classical Information Processing. Electr. Notes Theor. Comput. Sci. 69: 1-22 (2002)
62		Samson Abramsky, Esfandiar Haghverdi, Philip J. Scott: Geometry of Interaction and Linear Combinatory Algebras. Mathematical Structures in Computer Science 12(5): 625-665 (2002)
	2001
61		Samson Abramsky: Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings. Springer 2001
60		Samson Abramsky, Marina Lenisa: Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. CSL 2001: 443-457
59		Samson Abramsky, Luca Aceto, Anna Ingólfsdóttir: Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218. Inf. Comput. 165(2): 119-122 (2001)
58		B. Thomsen, Samson Abramsky: A fully abstract denotational semantics for the calculus of higher-order communicating systems. Theor. Comput. Sci. 254(1-2): 557-589 (2001)
	2000
57		Samson Abramsky, Marina Lenisa: A Fully Complete PER Model for ML Polymorphic Types. CSL 2000: 140-155
56		Samson Abramsky: Game Semantics: Achievements and Prospects. ICALP 2000: 1
55		Samson Abramsky, Marina Lenisa: Axiomatizing Fully Complete Models for ML Polymorphic Types. MFCS 2000: 141-151
54		Samson Abramsky: Axioms for definability and full completeness. Proof, Language, and Interaction 2000: 55-76
53		Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria: Full Abstraction for PCF. Inf. Comput. 163(2): 409-470 (2000)
	1999
52		Samson Abramsky, Paul-André Melliès: Concurrent Games and Full Completeness. LICS 1999: 431-442
51		Samson Abramsky: Process Realizability. Electr. Notes Theor. Comput. Sci. 23(1): 1-2 (1999)
50		Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan: A Specification Structure for Deadlock-Freedom of Synchronous Processes. Theor. Comput. Sci. 222(1-2): 1-53 (1999)
49		Samson Abramsky, Guy McCusker: Full Abstraction for Idealized Algol with Passive Expressions. Theor. Comput. Sci. 227(1-2): 3-42 (1999)
	1998
48		Samson Abramsky, Kohei Honda, Guy McCusker: A Fully Abstract Game Semantics for General References. LICS 1998: 334-344
	1997
47		Samson Abramsky, Guy McCusker: Call-by-Value Games. CSL 1997: 1-17
46		Dusko Pavlovic, Samson Abramsky: Specifying Interaction Categories. Category Theory and Computer Science 1997: 147-158
45		Samson Abramsky: Game Semantics for Programming Languages (Abstract). MFCS 1997: 3-4
44		Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan: A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems. TACS 1997: 295-320
	1996
43		Samson Abramsky: Semantics of Interaction (Abstract). CAAP 1996: 1
42		Samson Abramsky: Retracing Some Paths in Process Algebra. CONCUR 1996: 1-17
41		Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan: Interaction categories and the foundations of typed concurrent programming. NATO ASI DPD 1996: 35-113
40		Samson Abramsky, Guy McCusker: Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. Electr. Notes Theor. Comput. Sci. 3: 2-14 (1996)
	1995
39		Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan: Specification Structures and Propositions-as-Types for Concurrency. Banff Higher Order Workshop 1995: 5-40
38		Samson Abramsky, Guy McCusker: Games and Full Abstraction for the Lazy lambda-Calculus LICS 1995: 234-243
	1994
37		Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan: Full Abstraction for PCF. TACS 1994: 1-15
36		Samson Abramsky, Guy McCusker: Games for Recursive Types. Theory and Formal Methods 1994: 1-20
35		Samson Abramsky, Radha Jagadeesan: New Foundations for the Geometry of Interaction Inf. Comput. 111(1): 53-119 (1994)
34		Samson Abramsky, Radha Jagadeesan: Games and Full Completeness for Multiplicative Linear Logic. J. Symb. Log. 59(2): 543-574 (1994)
33		Samson Abramsky: Proofs as Processes. Theor. Comput. Sci. 135(1): 5-9 (1994)
	1993
32		Ian Mackie, Leopoldo Román, Samson Abramsky: An Internal Language for Autonomous Categories. Theory and Formal Methods 1993: 235-246
31		Samson Abramsky: Interaction Categories. Theory and Formal Methods 1993: 57-69
30		Ian Mackie, Leopoldo Román, Samson Abramsky: An internal language for autonomous categories. Applied Categorical Structures 1(3): 311-343 (1993)
29		Anthony Finkelstein, Jeff Kramer, Samson Abramsky, Krysia Broda, Sophia Drossopoulou, Susan Eisenbach: An Integrated Engineering Study Scheme in Computing. Comput. J. 36(4): 320-334 (1993)
28		Samson Abramsky, C.-H. Luke Ong: Full Abstraction in the Lazy Lambda Calculus Inf. Comput. 105(2): 159-267 (1993)
27		Samson Abramsky, Steven Vickers: Quantales, Observational Logic and Process Semantics. Mathematical Structures in Computer Science 3(2): 161-227 (1993)
26		Samson Abramsky: Computational Interpretations of Linear Logic. Theor. Comput. Sci. 111(1&2): 3-57 (1993)
	1992
25		Samson Abramsky, Radha Jagadeesan: Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract). FSTTCS 1992: 291-301
24		Samson Abramsky, Radha Jagadeesan: New Foundations for the Geometry of Interaction LICS 1992: 211-222
	1991
23		Samson Abramsky, T. S. E. Maibaum: TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'91) Springer 1991
22		Samson Abramsky, T. S. E. Maibaum: TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD) Springer 1991
21		David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné, David E. Rydeheard: Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings Springer 1991
20		Samson Abramsky, Thomas P. Jensen: A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions. POPL 1991: 49-54
19		Samson Abramsky: Domain Theory in Logical Form. Ann. Pure Appl. Logic 51(1-2): 1-77 (1991)
18		Samson Abramsky: A Domain Equation for Bisimulation Inf. Comput. 92(2): 161-218 (1991)
17		Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky: OOPSLA panel on object-based concurrent programming. OOPS Messenger 2(2): 3-15 (1991)
	1990
16		Gul Agha, Samson Abramsky, Carl Hewitt, Robin Milner, Peter Wegner, Akinori Yonezawa: Foundations of Concurrent Object-Oriented Programming (Panel). OOPSLA/ECOOP 1990: 100
15		Samson Abramsky: Abstract Interpretation, Logical Relations and Kan Extensions. J. Log. Comput. 1(1): 5-40 (1990)
	1989
14		Samson Abramsky: Observational Logic and Process Semantics (Abstract). Logic at Botik 1989: 1
13		Samson Abramsky: A Generalized Kahn Principle for Abstract Asynchronous Networks. Mathematical Foundations of Programming Semantics 1989: 1-21
	1988
12		David A. Fuller, Samson Abramsky: Mixed Computation of Prolog Programs. New Generation Comput. 6(2&3): 119-141 (1988)
	1987
11		Samson Abramsky, Chris Hankin: Abstract Interpretation of Declarative Languages Ellis Horwood 1987
10		Samson Abramsky: Domain Theory in Logical Form LICS 1987: 47-53
9		Samson Abramsky: Observation Equivalence as a Testing Equivalence. Theor. Comput. Sci. 53: 225-241 (1987)
	1986
8		David H. Pitt, Samson Abramsky, Axel Poigné, David E. Rydeheard: Category Theory and Computer Programming, Tutorial and Workshop, Guildford, UK, September 16-20, 1985 Proceedings Springer 1986
7		Geoffrey L. Burn, Chris Hankin, Samson Abramsky: Strictness Analysis for Higher-Order Functions. Sci. Comput. Program. 7(3): 249-278 (1986)
	1985
6		Samson Abramsky: Introduction. CTCS 1985: 3-6
5		Samson Abramsky, R. Sykes: Secd-m: a Virtual Machine for Applicative Programming. FPCA 1985: 81-98
4		Samson Abramsky: Strictness analysis and polymorphic invariance. Programs as Data Objects 1985: 1-23
3		Geoffrey L. Burn, Chris Hankin, Samson Abramsky: The theory of strictness analysis for higher order functions. Programs as Data Objects 1985: 42-62
	1983
2		Samson Abramsky: Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. FCT 1983: 1-13
1		Samson Abramsky: On Semantic Foundations for Applicative Multiprogramming. ICALP 1983: 1-14

Coauthor Index

1	Luca Aceto	[59]
2	Andrew Adamatzky (Andy Adamatzky)	[89]
3	Gul A. Agha (Gul Agha)	[16] [17]
4	Rui Soares Barbosa	[111]
5	Adam Brandenburger	[114]
6	Krysia Broda	[29]
7	Geoffrey L. Burn	[3] [7]
8	Bob Coecke	[63] [64] [67] [69] [78] [95]
9	Pierre-Louis Curien	[21]
10	Sophia Drossopoulou	[29]
11	Ross Duncan	[74] [81]
12	Susan Eisenbach	[29]
13	Anthony Finkelstein	[29]
14	David A. Fuller	[12]
15	Cyril Gavoille	[104] [105]
16	Simon J. Gay	[39] [41] [44] [50]
17	Erol Gelenbe	[90]
18	Dan R. Ghica	[68] [71]
19	Erich Grädel	[83]
20	Esfandiar Haghverdi	[62]
21	Chris Hankin	[3] [7] [11]
22	Lucien Hardy	[116]
23	Friedhelm Meyer auf der Heide	[104] [105]
24	Carl Hewitt	[16]
25	Kohei Honda	[48]
26	Anna Ingólfsdóttir	[59]
27	Radha Jagadeesan	[24] [25] [34] [35] [37] [53] [66] [76] [92]
28	Thomas P. Jensen	[20]
29	Colin G. Johnson	[89]
30	Claude Kirchner	[104] [105]
31	Jeff Kramer (Jeffrey Kramer)	[29]
32	Marina Lenisa	[55] [57] [60] [75]
33	Ian Mackie	[30] [32]
34	T. S. E. Maibaum (Thomas Stephen Edward Maibaum)	[22] [23]
35	Johann A. Makowsky (Janos Makowsky)	[83]
36	Pasquale Malacaria	[37] [53]
37	Shane Mansfield	[111]
38	Marios Mavronicolas	[73]
39	Guy McCusker	[36] [38] [40] [47] [48] [49]
40	Paul-André Melliès	[52]
41	Robin Milner	[16]
42	Michael W. Mislove	[93]
43	Andrzej S. Murawski	[68] [71]
44	Rajagopal Nagarajan	[39] [41] [44] [50]
45	C.-H. Luke Ong	[28] [68] [71]
46	Catuscia Palamidessi	[93]
47	Dusko Pavlovic	[46]
48	David H. Pitt	[8] [21]
49	Andrew M. Pitts	[21]
50	Axel Poigné	[8] [21]
51	Leopoldo Román	[30] [32]
52	David E. Rydeheard	[8] [21]
53	Vladimiro Sassone	[90]
54	Philip J. Scott	[62]
55	Paul G. Spirakis	[104] [105]
56	Ian D. B. Stark	[71]
57	Susan Stepney	[89]
58	R. Sykes	[5]
59	B. Thomsen	[58]
60	Jonathan Timmis (Jon Timmis)	[89]
61	Nikos Tzevelekos	[113]
62	Jouko A. Väänänen	[91] [112]
63	Steven J. Vickers (Steven Vickers)	[27]
64	Peter Wegner	[16] [17]
65	Akinori Yonezawa	[16] [17]
66	Jonathan A. Zvesper	[102]

Colors in the list of coauthors

Last update Thu May 24 01:13:30 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page