Silvain Rideau

dblp:25/7915 · also Silvain Rideau-Kikuchi · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
1since 2021 · last 2021
0000-0001-7864-4971ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 3 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author
YearPublicationVenuePosition
2021 A short note on groups in separably closed valued fields
Silvain Rideau
Ann. Pure Appl. Log.1
2017 Definable and Invariant Types in Enrichments of NIP Theories
abstract
Abstract Let T be an NIP ${\cal L}$ -theory and $\mathop T\limits^\~ $ be an enrichment. We give a sufficient condition on $\mathop T\limits^\~$ for the underlying ${\cal L}$ -type of any definable (respectively invariant) type over a model of $\mathop T\limits^\~$ to be definable (respectively invariant). These results are then applied to Scanlon’s model completion of valued differential fields.
Silvain Rideau, Pierre Simon
J. Symb. Log.1
2017 Games and Strategies as Event Structures
abstract
In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the results of Rideau and Winskel: a notion of pre-strategy based on event structures; a characterisation of those pre-strategies (deemed strategies) which are preserved by composition with a copycat strategy; and the construction of a bicategory of these strategies. Furthermore, we prove that the corresponding category has a compact closed structure, and hence forms the basis for the semantics of concurrent higher-order computation.
Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel
Log. Methods Comput. Sci.3
2011 Concurrent Strategies
abstract
A bi category of very general nondeterministic concurrent games and strategies is presented. The intention is to formalize distributed games in which both Player (or a team of players) and Opponent (or a team of opponents) can interact in highly distributed fashion, without, for instance, enforcing that their moves alternate.
Silvain Rideau, Glynn Winskel
LICS1
2010 Validating Register Allocation and Spilling
Silvain Rideau, Xavier Leroy
CC1