• concurrency
  • This led Abramsky to propose the semantic cube programme [ 1 ], aiming to extend this success to further programming features: concurrency, non-determinism, probabilities, etc. (springer.com)
  • programs
  • Then, we show that by hiding only certain events dubbed inessential we can consider strategies up to isomorphism , and still get a category - this partial hiding remains sound up to weak bisimulation, so we get a concrete representations of programs (as in standard concurrent games) while avoiding the angelic bias. (springer.com)