Searching for authors named Samson Abramsky – sorted by Relevance.
-
Contents Information, Processes and Games
- Contents Information, Processes and Games Samson Abramsky Oxford University Computing Laboratory 1
- Add To MetaCart
-
• Process Calculi • Type Systems
- What are the fundamental structures of concurrency? We still don’t know! Samson Abramsky Oxford
- Add To MetaCart
-
Axioms for Definability and Full Completeness
- Axioms for Definability and Full Completeness Samson Abramsky May 7, 1999 1 Introduction The term
- Cited by 3 (1 self) – Add To MetaCart
-
A Structural Approach to Reversible Computation
- A Structural Approach to Reversible Computation Samson Abramsky Oxford University Computing
- Cited by 11 (3 self) – Add To MetaCart
-
Process Realizability
- Process Realizability Samson Abramsky 1 Introduction Realizability has proved to be a fruitful
- Cited by 5 (1 self) – Add To MetaCart
-
Games in the Semantics of Programming Languages
- Games in the Semantics of Programming Languages Samson Abramsky Department of Computer Science
- Cited by 7 (1 self) – Add To MetaCart
-
Semantics of interaction
- Semantics of Interaction Samson Abramsky Abstract The “classical” paradigm for denotational
- Cited by 33 (3 self) – Add To MetaCart
-
Algorithmic Game Semantics
- ALGORITHMIC GAME SEMANTICS A Tutorial Introduction SAMSON ABRAMSKY (samson
- Cited by 36 (3 self) – Add To MetaCart
-
Sequentiality vs. Concurrency in Games and Logic
- Sequentiality vs. Concurrency in Games and Logic Samson Abramsky Oxford University Computing
- Cited by 8 (0 self) – Add To MetaCart
-
Retracing some paths in Process Algebra
- independently in the work of Hans Bekic [Bek71]. Samson Abramsky Laboratory for the Foundations of Computer
- Cited by 56 (13 self) – Add To MetaCart

