$\text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity

Autor: Liron Cohen, Vincent Rahli

Publikováno v: Logical Methods in Computer Science, Vol Volume 20, Issue 2 (2024)

$\text{TT}^{\Box}_{{\mathcal C}}$ is a generic family of effectful, extensional type theories with a forcing interpretation parameterized by modalities. This paper identifies a subclass of $\text{TT}^{\Box}_{{\mathcal C}}$ theories that internally re

Externí odkaz: https://doaj.org/article/84c6c1d9ff254242b5671e844b6c779c

Comment réduire efficacement l'entropie des sources malveillantes d'information

Autor: Silvia Bonomi, Jérémie Decouchant, Giovanni Farina, Vincent Rahli, Sébastien Tixeuil

Publikováno v: AlgoTel 2022-24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications
AlgoTel 2022-24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
Delft University of Technology
Comment réduire efficacement l'entropie des sources malveillantes d'information

International audience; Nous considérons un réseau (modélisé par un graphe) utilisé pour propager des informations. Dans ce contexte, une source d'information diffuse à l'ensemble du réseau un message. Si la source est fiable, c'est à dire qu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d0ca4928a40ff3adaa1203018e0ca6d6
https://hal.science/hal-03657365/document

Practical Byzantine Reliable Broadcast on Partially Connected Networks

Autor: Giovanni Farina, Silvia Bonomi, Vincent Rahli, Jérémie Decouchant, Sébastien Tixeuil

Publikováno v: ICDCS
Proceedings-2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021
2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)
2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), Jul 2021, DC, United States. pp.506-516, ⟨10.1109/ICDCS51616.2021.00055⟩

In this paper, we consider the Byzantine reliable broadcast problem on authenticated and partially connected networks. The state-of-the-art method to solve this problem consists in combining two algorithms from the literature. Handling asynchrony and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce8863efaa3ebf2d5ff579a8b8c81079
https://doi.org/10.1109/icdcs51616.2021.00055

Validating Brouwer's continuity principle for numbers using named exceptions

Autor: Vincent Rahli, Mark Bickford

Publikováno v: Mathematical Structures in Computer Science. (2017).

This paper extends the Nuprl proof assistant (a system representative of the class of extensional type theories with dependent types) withnamed exceptionsandhandlers, as well as a nominalfreshoperator. Using these new features, we prove a version of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31a264b6f65d327a2a34ebc350555beb
https://doi.org/10.1017/s0960129517000172

Skalpel: A constraint-based type error slicer for Standard ML

Autor: John Pirie, Vincent Rahli, Fairouz Kamareddine, Joseph Brian Wells

Publikováno v: Journal of Symbolic Computation. (2016).

Compilers for languages with type inference algorithms often produce confusing type error messages and give a single error location which is sometimes far away from the real location of the error. Attempts at solving this problem often (1) fail to in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43c83d2c955ce766edb56ed38e3aa9fe
https://doi.org/10.1016/j.jsc.2016.07.013