2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.LO2024
A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free
Cyril Cohen, Kazuhiko Sakaguchi
We present a novel characterization of stable mergesort functions using relational parametricity, and show that it implies the functional correctness of mergesort. As a result, one…
cs.LO2023★ 2 cited
Trocq: Proof Transfer for Free, With or Without Univalence
Cyril Cohen, Enzo Crance, Assia Mahboubi
Libraries of formalized mathematics use a possibly broad range of different representations for a same mathematical concept. Yet light to major manual input from users remains most…