@Article{BOUDES:2006:HAL-00091450:2,
title	= {{N}on uniform (hyper/multi)coherence spaces},
author	= {{B}oudes, {P}ierre},
abstract={{I}n (hyper)coherence semantics, proofs/terms are cliques in (hyper)graphs. {I}ntuitively, vertices represent results of computations and the edge relation witnesses the ability of being assembled into a same piece of data or a same (strongly) stable function, at arrow types.  {I}n (hyper)coherence semantics, the argument of a (strongly) stable functional is always a (strongly) stable function. {A}s a consequence, comparatively to the relational semantics, where there is no edge relation, some vertices are missing. {R}ecovering these vertices is essential for the purpose of reconstructing proofs/terms from their interpretations. {I}t shall also be useful for the comparison with other semantics, like game semantics.  {I}n [{B}{E}01], {B}ucciarelli and {E}hrhard introduced a so called non uniform coherence space semantics where no vertex is missing. {B}y constructing the co-free exponential we set a new version of this last semantics, together with non uniform versions of hypercoherences and multicoherences, a new semantics where an edge is a finite multiset. {T}hanks to the co-free construction, these non uniform semantics are deterministic in the sense that the intersection of a clique and of an anti-clique contains at most one vertex, a result of interaction, and extensionally collapse onto the corresponding uniform semantics.},
keywords={linear logic; denotational semantics; coherence spaces; hypercoherences},
language={{A}nglais},
affiliation={{L}aboratoire d'informatique de {P}aris-nord [{L}{I}{P}{N}] },
note	= {39 pages {A}ccept{\'e} pour publication {\`a} {M}{S}{C}{S} {F}.3.2 },
ARXIVID={cs.LO/0609021},
URL	= {http://hal.archives-ouvertes.fr/hal-00091450/en/},
journal = {Mathematical Structures in Computer Science},
year	= {2008},
lipn-category = "jour",
lipn-status = "apar",
}