Search

• < Previous
• 1
• Next >

---

Full abstraction for fair testing in CCS (expanded version)

Tom Hirschowitz.

In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics. We define in this setting an analogue of fair testing equivalence, which we prove fully abstract w.r.t. standard fair testing&nbsp;[&hellip;]

---

Cartesian closed 2-categories and permutation equivalence in higher-order rewriting

Tom Hirschowitz.

We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.

---