12 citations · 56 across the 23 of their papers we have counts for
Showing 2013 · cs.LOShow all
3 papers · 2 filters
cs.LO2013★ 6 cited
Fully-abstract concurrent games for pi
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
We define a semantics for Milner's pi-calculus, with three main novelties. First, it provides a fully-abstract model for fair testing equivalence, whereas previous semantics covere…
cs.LO2013★ 12 cited
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.
cs.LO2013
Full abstraction for fair testing in CCS
Tom Hirschowitz
In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent presheaf semantics and as a concurrent game semantics. It is here proved that a b…