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;]

---

Modules over monads and operational semantics (expanded version)

André Hirschowitz ; Tom Hirschowitz ; Ambroise Lafont.

This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition monads, thus covering new applications such as&nbsp;[&hellip;]

---

A categorical framework for congruence of applicative bisimilarity in higher-order languages

Tom Hirschowitz ; Ambroise Lafont.

Applicative bisimilarity is a coinductive characterisation of observational equivalence in call-by-name lambda-calculus, introduced by Abramsky (1990). Howe (1996) gave a direct proof that it is a congruence, and generalised the result to all languages complying with a suitable format. We propose a&nbsp;[&hellip;]

---