Theoretical Computer Science
Fully abstract semantics for observably sequential languages
Information and Computation
Sequentiality in an extensional framework
Papers presented at the IEEE symposium on Logic in computer science
Domains and lambda-calculi
A relative PCF-definability result for strongly stable functions and some corollaries
Information and Computation
Parallel and serial hypercoherences
Theoretical Computer Science
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Comparing hierarchies of types in models of linear logic
Information and Computation
Mathematical Structures in Computer Science
Sequential algorithms and strongly stable functions
Theoretical Computer Science - Game theory meets theoretical computer science
Acyclicity and coherence in multiplicative exponential linear logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
In (hyper)coherence semantics, proofs/terms are cliques in (hyper)graphs. Intuitively, the vertices represent the results of computations and the edge relation witnesses the ability to carry out the computation assembled into a single piece of data or a single (strongly) stable function, at arrow types. In (hyper)coherence semantics, the argument of a (strongly) stable functional is always a (strongly) stable function. As a consequence, compared to the relational semantics where there is no edge relation, some vertices are missing. Recovering these vertices is essential if we are to reconstruct proofs/terms from their interpretations. It will also be useful for comparing with other semantics, such as game semantics. Bucciarelli and Ehrhard (2001) introduced a non-uniform coherence space semantics, where no vertex is missing. By constructing the co-free exponential, we get a new version of this semantics, together with non-uniform versions of hypercoherences and multicoherences. This provides a new semantics in which an edge is a finite multiset. Thanks to the co-free construction, these non-uniform semantics are deterministic in the sense that the intersection of a clique and an anti-clique contains at most one vertex, which is a result of interaction, and they then extensionally collapse onto the corresponding uniform semantics.