Cyril Cohen
34
Documents
Publications
|
Trocq: Proof Transfer for Free, With or Without UnivalenceESOP 2024 - 33rd European Symposium on Programming, Apr 2024, Luxembourg, Luxembourg. pp.239-268
Conference papers
hal-04177913v5
|
|
Artifact Report: Trocq: Proof Transfer for Free, With or Without UnivalenceESOP 2024 - 33rd European Symposium on Programming, Apr 2024, Luxembourg, Luxembourg. pp.269-274, ⟨10.1007/978-3-031-57262-3_11⟩
Conference papers
hal-04623207v1
|
|
Semantics of Probabilistic Programs using s-Finite Kernels in CoqCPP 2023 - Certified Programs and Proofs, Jan 2023, Boston, United States. ⟨10.1145/3573105.3575691⟩
Conference papers
hal-03917948v1
|
|
Porting the Mathematical Components library to Hierarchy Builderthe COQ Workshop 2021, Jul 2021, virtuel- Rome, Italy
Conference papers
hal-03463762v1
|
|
Unsolvability of the Quintic Formalized in Dependent Type TheoryITP 2021 - 12th International Conference on Interactive Theorem Proving, Jun 2021, Rome / Virtual, France
Conference papers
hal-03136002v4
|
|
Competing inheritance paths in dependent type theory: a case study in functional analysisIJCAR 2020 - International Joint Conference on Automated Reasoning, Jun 2020, Paris, France. pp.1-19, ⟨10.1007/978-3-030-51054-1_1⟩
Conference papers
hal-02463336v2
|
|
Hierarchy Builder: algebraic hierarchies made easy in Coq with ElpiFSCD 2020 - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. pp.34:1--34:21, ⟨10.4230/LIPIcs.FSCD.2020.34⟩
Conference papers
hal-02478907v6
|
|
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and IsabelleITP 2019 - 10th International Conference on Interactive Theorem Proving, Sep 2019, Portland, United States. pp.13:1 - 13:19, ⟨10.4230/LIPIcs.ITP.2019.13⟩
Conference papers
hal-02303987v1
|
|
Towards Certified Meta-Programming with Typed Template-CoqITP 2018 - 9th Conference on Interactive Theorem Proving, Jul 2018, Oxford, United Kingdom. pp.20-39, ⟨10.1007/978-3-319-94821-8_2⟩
Conference papers
hal-01809681v1
|
|
A refinement-based approach to large scale reflection for algebraJFLA 2017 - Vingt-huitième Journées Francophones des Langages Applicatifs, Jan 2017, Gourette, France
Conference papers
hal-01414881v1
|
|
Formal Foundations of 3D Geometry to Model Robot ManipulatorsConference on Certified Programs and Proofs 2017, Jan 2017, Paris, France
Conference papers
hal-01414753v1
|
|
A Formal Proof in Coq of LaSalle's Invariance PrincipleInteractive Theorem Proving, Sep 2017, Brasilia, Brazil. ⟨10.1007/978-3-319-66107-0_10⟩
Conference papers
hal-01612293v1
|
|
Formalization of a Newton Series Representation of PolynomialsCertified Programs and Proofs, Jan 2016, St. Petersburg, Florida, United States
Conference papers
hal-01240469v1
|
|
Cubical Type Theory: a constructive interpretation of the univalence axiom21st International Conference on Types for Proofs and Programs, May 2015, Tallinn, Estonia. pp.262, ⟨10.4230/LIPIcs.TYPES.2015.5⟩
Conference papers
hal-01378906v2
|
|
A Coq Formalization of Finitely Presented Modules5th International Conference, ITP 2014, Jul 2014, Vienna, Austria. pp.193 - 208, ⟨10.1007/978-3-319-08970-6_13⟩
Conference papers
hal-01378905v1
|
|
A Machine-Checked Proof of the Odd Order TheoremITP 2013, 4th Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. pp.163-179, ⟨10.1007/978-3-642-39634-2_14⟩
Conference papers
hal-00816699v1
|
|
Pragmatic Quotient Types in CoqInternational Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. pp.16
Conference papers
hal-01966714v1
|
|
Refinements for Free!Certified Programs and Proofs, Dec 2013, Melbourne, Australia. pp.147 - 162, ⟨10.1007/978-3-319-03545-1_10⟩
Conference papers
hal-01113453v1
|
|
Construction des nombres algébriques réels en CoqJFLA - Journées Francophones des Langages Applicatifs - 2012, Feb 2012, Carnac, France
Conference papers
hal-00665965v1
|
|
Construction of real algebraic numbers in CoqITP - 3rd International Conference on Interactive Theorem Proving - 2012, Aug 2012, Princeton, United States
Conference papers
hal-00671809v2
|
|
A formal quantifier elimination for algebraically closed fieldsSymposium on the Integration of Symbolic Computation and Mechanised Reasoning, Calculemus, Jul 2010, Paris, France. pp.189-203, ⟨10.1007/978-3-642-14128-7_17⟩
Conference papers
inria-00464237v3
|
|
A Nix toolbox for reproducible Coq environments, Continuous Integration and artifact reuseThe Coq Workshop, Jul 2021, Virtual, France
Documents associated with scientific events
hal-03366644v1
|
|
Design patterns of hierarchies for order structures2023
Preprints, Working Papers, ...
hal-04008820v1
|
|
Formalization of a sign determination algorithm in real algebraic geometry2021
Preprints, Working Papers, ...
hal-03274013v1
|
|
Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle2018
Preprints, Working Papers, ...
hal-01906155v1
|
|
Formalizing real analysis for polynomials2010
Preprints, Working Papers, ...
inria-00545778v1
|
|
Formalized algebraic numbers: construction and first-order theory.Logic in Computer Science [cs.LO]. Ecole Polytechnique X, 2012. English. ⟨NNT : ⟩
Theses
pastel-00780446v1
|