Cyril Cohen

Orcid: 0000-0003-3540-1050

According to our database1, Cyril Cohen authored at least 26 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A bargain for mergesorts (functional pearl) - How to prove your mergesort correct and stable, almost for free.
CoRR, 2024

Artifact Report: Trocq: Proof Transfer for Free, With or Without Univalence.
Proceedings of the Programming Languages and Systems, 2024

Trocq: Proof Transfer for Free, With or Without Univalence.
Proceedings of the Programming Languages and Systems, 2024

2023
Measure Construction by Extension in Dependent Type Theory with Application to Integration.
J. Autom. Reason., September, 2023

Semantics of Probabilistic Programs using s-Finite Kernels in Coq.
Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2023

2021
Unsolvability of the Quintic Formalized in Dependent Type Theory.
Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

2020
The MetaCoq Project.
J. Autom. Reason., 2020

Hierarchy Builder: Algebraic hierarchies Made Easy in Coq with Elpi (System Description).
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
Formalization Techniques for Asymptotic Reasoning in Classical Analysis.
J. Formaliz. Reason., 2018

Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle.
CoRR, 2018

Towards Certified Meta-Programming with Typed Template-Coq.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

2017
Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom.
FLAP, 2017

A Formal Proof in Coq of LaSalle's Invariance Principle.
Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

Formal foundations of 3D geometry to model robot manipulators.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

2016
Formalized linear algebra over Elementary Divisor Rings in Coq.
Log. Methods Comput. Sci., 2016

Formalization of a newton series representation of polynomials.
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2014
A Coq Formalization of Finitely Presented Modules.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

2013
A Machine-Checked Proof of the Odd Order Theorem.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Pragmatic Quotient Types in Coq.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Refinements for Free!
Proceedings of the Certified Programs and Proofs - Third International Conference, 2013

2012
Formalized algebraic numbers: construction and first-order theory. (Formalisation des nombres algébriques : construction et théorie du premier ordre).
PhD thesis, 2012

Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
Log. Methods Comput. Sci., 2012

Construction of Real Algebraic Numbers in Coq.
Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

2010
A Formal Quantifier Elimination for Algebraically Closed Fields.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010


  Loading...