Author:
Abramsky Samson,Jagadeesan Radha
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. S. Abramsky. Proofs as processes. Unpublished Lecture, 1991.
2. S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Technical Report DoC 92/24, Imperial College Department of Computing, September 1992.
3. S. Abramsky and R. Jagadeesan. New foundations for the geometry of interaction. In Proceedings of the Seventh Symposium on Logic In Computer Science, pages 211–222. Computer Society Press of the IEEE, June 1992.
4. M. Barr. *-autonomous categories and linear logic. Mathematical Structures in Computer Science, 1(2):159–178, July 1991.
5. S. Bainbridge, P. J. Freyd, A. Scedrov, and P. Scott. Functorial polymorphism. Theoretical Computer Science, 70:35–64, 1990.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Retracing Some Paths in Categorical Semantics: From Process-Propositions-as-Types to Categorified Reals and Computers;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
2. A Tale of Additives and Concurrency in Game Semantics;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
3. Game-Theoretical Semantics;Handbook of Logic and Language;2011
4. On Linear Information Systems;Electronic Proceedings in Theoretical Computer Science;2010-03-30
5. Space-Efficient Computation by Interaction;Computer Science Logic;2006