The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Samson Abramsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Samson Abramsky
    Abstract Interpretation, Logical Relations and Kan Extensions. [Citation Graph (1, 0)][DBLP]
    J. Log. Comput., 1990, v:1, n:1, pp:5-40 [Journal]
  2. Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
    Specification Structures and Propositions-as-Types for Concurrency. [Citation Graph (0, 0)][DBLP]
    Banff Higher Order Workshop, 1995, pp:5-40 [Conf]
  3. Samson Abramsky
    A Cook's Tour of the Finitary Non-Well-Founded Sets. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:1-18 [Conf]
  4. Samson Abramsky
    Semantics of Interaction (Abstract). [Citation Graph (0, 0)][DBLP]
    CAAP, 1996, pp:1- [Conf]
  5. Samson Abramsky
    Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories. [Citation Graph (0, 0)][DBLP]
    CALCO, 2005, pp:1-29 [Conf]
  6. Samson Abramsky
    Retracing Some Paths in Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1996, pp:1-17 [Conf]
  7. Samson Abramsky, Erich Grädel, Johann A. Makowsky
    The Ackermann Award 2006. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:622-626 [Conf]
  8. Samson Abramsky, Marina Lenisa
    A Fully Complete PER Model for ML Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:140-155 [Conf]
  9. Samson Abramsky, Marina Lenisa
    Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:443-457 [Conf]
  10. Samson Abramsky, Guy McCusker
    Call-by-Value Games. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:1-17 [Conf]
  11. Samson Abramsky
    Introduction. [Citation Graph (0, 0)][DBLP]
    CTCS, 1985, pp:3-6 [Conf]
  12. Dusko Pavlovic, Samson Abramsky
    Specifying Interaction Categories. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1997, pp:147-158 [Conf]
  13. Samson Abramsky, Bob Coecke
    Discrete classical vs. continuous quantum data in abstract quantum mechanics. [Citation Graph (0, 0)][DBLP]
    Spatial Representation, 2005, pp:- [Conf]
  14. Samson Abramsky
    Observational Logic and Process Semantics (Abstract). [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:1- [Conf]
  15. Samson Abramsky
    Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:1-13 [Conf]
  16. Samson Abramsky, Radha Jagadeesan
    A Game Semantics for Generic Polymorphism. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:1-22 [Conf]
  17. Samson Abramsky, R. Sykes
    Secd-m: a Virtual Machine for Applicative Programming. [Citation Graph (0, 0)][DBLP]
    FPCA, 1985, pp:81-98 [Conf]
  18. Samson Abramsky, Radha Jagadeesan
    Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:291-301 [Conf]
  19. Samson Abramsky
    Game Semantics: Achievements and Prospects. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:1- [Conf]
  20. Samson Abramsky
    On Semantic Foundations for Applicative Multiprogramming. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:1-14 [Conf]
  21. Samson Abramsky
    Interaction Categories. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1993, pp:57-69 [Conf]
  22. Samson Abramsky, Guy McCusker
    Games for Recursive Types. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1994, pp:1-20 [Conf]
  23. Ian Mackie, Leopoldo Román, Samson Abramsky
    An Internal Language for Autonomous Categories. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1993, pp:235-246 [Conf]
  24. Samson Abramsky
    High-Level Methods for Quantum Computation and Information. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:410-414 [Conf]
  25. Samson Abramsky
    Domain Theory in Logical Form [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:47-53 [Conf]
  26. Samson Abramsky, Bob Coecke
    A Categorical Semantics of Quantum Protocols. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:415-425 [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:150-159 [Conf]
  28. Samson Abramsky, Kohei Honda, Guy McCusker
    A Fully Abstract Game Semantics for General References. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:334-344 [Conf]
  29. Samson Abramsky, Radha Jagadeesan
    New Foundations for the Geometry of Interaction [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:211-222 [Conf]
  30. Samson Abramsky, Guy McCusker
    Games and Full Abstraction for the Lazy lambda-Calculus [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:234-243 [Conf]
  31. Samson Abramsky, Paul-André Melliès
    Concurrent Games and Full Completeness. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:431-442 [Conf]
  32. Samson Abramsky
    Game Semantics for Programming Languages (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:3-4 [Conf]
  33. Samson Abramsky, Marina Lenisa
    Axiomatizing Fully Complete Models for ML Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:141-151 [Conf]
  34. Samson Abramsky
    A Generalized Kahn Principle for Abstract Asynchronous Networks. [Citation Graph (0, 0)][DBLP]
    Mathematical Foundations of Programming Semantics, 1989, pp:1-21 [Conf]
  35. Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
    Interaction categories and the foundations of typed concurrent programming. [Citation Graph (0, 0)][DBLP]
    NATO ASI DPD, 1996, pp:35-113 [Conf]
  36. Gul Agha, Samson Abramsky, Carl Hewitt, Robin Milner, Peter Wegner, Akinori Yonezawa
    Foundations of Concurrent Object-Oriented Programming (Panel). [Citation Graph (0, 0)][DBLP]
    OOPSLA/ECOOP, 1990, pp:100- [Conf]
  37. Samson Abramsky
    Strictness analysis and polymorphic invariance. [Citation Graph (0, 0)][DBLP]
    Programs as Data Objects, 1985, pp:1-23 [Conf]
  38. Geoffrey L. Burn, Chris Hankin, Samson Abramsky
    The theory of strictness analysis for higher order functions. [Citation Graph (0, 0)][DBLP]
    Programs as Data Objects, 1985, pp:42-62 [Conf]
  39. Samson Abramsky, Thomas P. Jensen
    A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions. [Citation Graph (0, 0)][DBLP]
    POPL, 1991, pp:49-54 [Conf]
  40. Samson Abramsky
    Algorithmic Game Semantics and Static Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:1- [Conf]
  41. Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
    Applying Game Semantics to Compositional Software Modeling and Verification. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:421-435 [Conf]
  42. Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
    A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:295-320 [Conf]
  43. Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan
    Full Abstraction for PCF. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:1-15 [Conf]
  44. Ian Mackie, Leopoldo Román, Samson Abramsky
    An internal language for autonomous categories. [Citation Graph (0, 0)][DBLP]
    Applied Categorical Structures, 1993, v:1, n:3, pp:311-343 [Journal]
  45. Samson Abramsky
    Domain Theory in Logical Form. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:51, n:1-2, pp:1-77 [Journal]
  46. Samson Abramsky, Radha Jagadeesan
    A game semantics for generic polymorphism. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:133, n:1-3, pp:3-37 [Journal]
  47. Samson Abramsky, Marina Lenisa
    Linear realizability and full completeness for typed lambda-calculi. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:122-168 [Journal]
  48. Anthony Finkelstein, Jeff Kramer, Samson Abramsky, Krysia Broda, Sophia Drossopoulou, Susan Eisenbach
    An Integrated Engineering Study Scheme in Computing. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:4, pp:320-334 [Journal]
  49. Samson Abramsky, Bob Coecke
    Physical Traces: Quantum vs. Classical Information Processing [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  50. Samson Abramsky, Bob Coecke
    A categorical semantics of quantum protocols [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  51. Samson Abramsky
    Process Realizability. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal]
  52. Samson Abramsky, Bob Coecke
    Physical Traces: Quantum vs. Classical Information Processing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:69, n:, pp:- [Journal]
  53. Samson Abramsky, Guy McCusker
    Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal]
  54. Samson Abramsky
    What are the Fundamental Structures of Concurrency?: We still don't know! [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:37-41 [Journal]
  55. Samson Abramsky
    Event Domains, Stable Functions and Proof-Nets. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:33-67 [Journal]
  56. Samson Abramsky
    A Domain Equation for Bisimulation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:2, pp:161-218 [Journal]
  57. Samson Abramsky, Luca Aceto, Anna Ingólfsdóttir
    Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:165, n:2, pp:119-122 [Journal]
  58. Samson Abramsky, Radha Jagadeesan
    New Foundations for the Geometry of Interaction [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:111, n:1, pp:53-119 [Journal]
  59. Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria
    Full Abstraction for PCF. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:163, n:2, pp:409-470 [Journal]
  60. Samson Abramsky, C.-H. Luke Ong
    Full Abstraction in the Lazy Lambda Calculus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:105, n:2, pp:159-267 [Journal]
  61. Samson Abramsky, Radha Jagadeesan
    Games and Full Completeness for Multiplicative Linear Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1994, v:59, n:2, pp:543-574 [Journal]
  62. Samson Abramsky
    Sequentiality vs. Concurrency In Games And Logic. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:4, pp:531-565 [Journal]
  63. Samson Abramsky, Esfandiar Haghverdi, Philip J. Scott
    Geometry of Interaction and Linear Combinatory Algebras. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2002, v:12, n:5, pp:625-665 [Journal]
  64. Samson Abramsky, Steven Vickers
    Quantales, Observational Logic and Process Semantics. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1993, v:3, n:2, pp:161-227 [Journal]
  65. David A. Fuller, Samson Abramsky
    Mixed Computation of Prolog Programs. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1988, v:6, n:2&3, pp:119-141 [Journal]
  66. Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky
    OOPSLA panel on object-based concurrent programming. [Citation Graph (0, 0)][DBLP]
    OOPS Messenger, 1991, v:2, n:2, pp:3-15 [Journal]
  67. Geoffrey L. Burn, Chris Hankin, Samson Abramsky
    Strictness Analysis for Higher-Order Functions. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1986, v:7, n:3, pp:249-278 [Journal]
  68. Samson Abramsky
    A structural approach to reversible computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:3, pp:441-464 [Journal]
  69. Samson Abramsky
    Observation Equivalence as a Testing Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:225-241 [Journal]
  70. Samson Abramsky
    Computational Interpretations of Linear Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:111, n:1&2, pp:3-57 [Journal]
  71. Samson Abramsky
    Proofs as Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:1, pp:5-9 [Journal]
  72. Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
    A Specification Structure for Deadlock-Freedom of Synchronous Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:222, n:1-2, pp:1-53 [Journal]
  73. Samson Abramsky, Marios Mavronicolas
    Game Theory Meets Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:1-3 [Journal]
  74. Samson Abramsky, Guy McCusker
    Full Abstraction for Idealized Algol with Passive Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:227, n:1-2, pp:3-42 [Journal]
  75. B. Thomsen, Samson Abramsky
    A fully abstract denotational semantics for the calculus of higher-order communicating systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:557-589 [Journal]
  76. Samson Abramsky
    Petri Nets, Discrete Physics, and Distributed Quantum Computation. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2007, pp:1-2 [Conf]
  77. Samson Abramsky
    Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract). [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:1-2 [Conf]

  78. Petri Nets, Discrete Physics, and Distributed Quantum Computation. [Citation Graph (, )][DBLP]


  79. Axioms for definability and full completeness. [Citation Graph (, )][DBLP]


  80. Games, Interaction and Computation. [Citation Graph (, )][DBLP]


  81. Coalgebras, Chu Spaces, and Representations of Physical Systems. [Citation Graph (, )][DBLP]


  82. Types, Orthogonality and Genericity: Some Tools for Communicating Process Architectures. [Citation Graph (, )][DBLP]


  83. Grand Challenge 7: Journeys in Non-Classical Computation. [Citation Graph (, )][DBLP]


  84. A Categorical Quantum Logic [Citation Graph (, )][DBLP]


  85. Big Toy Models: Representing Physical Systems As Chu Spaces [Citation Graph (, )][DBLP]


  86. Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories [Citation Graph (, )][DBLP]


  87. Abstract Physical Traces [Citation Graph (, )][DBLP]


  88. Coalgebras, Chu Spaces, and Representations of Physical Systems [Citation Graph (, )][DBLP]


  89. From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference [Citation Graph (, )][DBLP]


  90. Relational Hidden Variables and Non-Locality [Citation Graph (, )][DBLP]


  91. Preface. [Citation Graph (, )][DBLP]


  92. Game Semantics for Access Control. [Citation Graph (, )][DBLP]


Search in 0.059secs, Finished in 0.063secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002