A Structural Approach to Reversible Computation (2001)

by Samson Abramsky
Venue:Theoretical Computer Science
Citations:18 - 3 self

Active Bibliography

3 A specification structure for deadlock-freedom of synchronous processes – S. Abramsky, S. J. Gay, R. Nagarajan - 1999
3 Linear realizability and full completeness for typed lambda calculi – Samson Abramsky, Marina Lenisa - 2005
21 Specification Structures and Propositions-as-Types for Concurrency – Samson Abramsky, Simon Gay, Rajagopal Nagarajan - 1995
47 Algorithmic Game Semantics – Samson Abramsky - 2001
2 Categorical and Graphical Models of Programming Languages – Ralf Schweimeier - 2001
44 Geometry of Interaction and Linear Combinatory Algebras – Samson Abramsky, Esfandiar Haghverdi, Philip Scott - 2000
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
2 A Fully Complete PER Model for ML Polymorphic Types – Samson Abramsky, Marina Lenisa - 2000
8 Games in the Semantics of Programming Languages – Samson Abramsky - 1997
2 Applications of Game Semantics: From Program Analysis to Hardware Synthesis – Dan R. Ghica
6 Information, Processes and Games – Samson Abramsky
15 Sequentiality vs. Concurrency in Games and Logic – Samson Abramsky - 2001
41 Applications of Linear Logic to Computation: An Overview – Vladimir Alexiev - 1993
9 The Effects of – Roshan P. James, Amr Sabry - 1997
9 A Game Semantics For Generic Polymorphism – Samson Abramsky, Radha Jagadeesan - 1971
5 Axioms for Definability and Full Completeness – Samson Abramsky - 2000
11 Game Semantics and Subtyping – Juliusz Chroboczek - 1999
30 Strong Normalisation in the π-Calculus – Nobuko Yoshida, Martin Berger, Kohei Honda - 2001
3 A Logically Reversible Evaluator for the Call-by-Name Lambda Calculus – Lorenz Huelsbergen - 1996