default search action
Cyril Cohen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Cyril Cohen
, Enzo Crance
Trocq: Proof Transfer for Free, With or Without Univalence. ESOP (1) 2024: 239-268 - [c17]Cyril Cohen
Artifact Report: Trocq: Proof Transfer for Free, With or Without Univalence. ESOP (1) 2024: 269-274 - [i5]Cyril Cohen, Kazuhiko Sakaguchi:
A bargain for mergesorts (functional pearl) - How to prove your mergesort correct and stable, almost for free. CoRR abs/2403.08173 (2024) - 2023
- [j6]Reynald Affeldt
Measure Construction by Extension in Dependent Type Theory with Application to Integration. J. Autom. Reason. 67(3): 28 (2023) - [c16]Reynald Affeldt
Semantics of Probabilistic Programs using s-Finite Kernels in Coq. CPP 2023: 3-16 - [i4]Cyril Cohen, Enzo Crance, Assia Mahboubi:
Trocq: Proof Transfer for Free, With or Without Univalence. CoRR abs/2310.14022 (2023) - 2022
- [i3]Reynald Affeldt, Cyril Cohen:
Measure Construction by Extension in Dependent Type Theory with Application to Integration. CoRR abs/2209.02345 (2022) - 2021
- [c15]Sophie Bernard, Cyril Cohen
Unsolvability of the Quintic Formalized in Dependent Type Theory. ITP 2021: 8:1-8:18 - 2020
- [j5]Matthieu Sozeau, Abhishek Anand, Simon Boulier, Cyril Cohen
The MetaCoq Project. J. Autom. Reason. 64(5): 947-999 (2020) - [c14]Reynald Affeldt, Cyril Cohen
Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis. IJCAR (2) 2020: 3-20 - [c13]Cyril Cohen
Hierarchy Builder: Algebraic hierarchies Made Easy in Coq with Elpi (System Description). FSCD 2020: 34:1-34:21
2010 – 2019
- 2019
- [c12]Ran Chen, Cyril Cohen
Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle. ITP 2019: 13:1-13:19 - 2018
- [j4]Reynald Affeldt
Formalization Techniques for Asymptotic Reasoning in Classical Analysis. J. Formaliz. Reason. 11(1): 43-76 (2018) - [c11]Abhishek Anand, Simon Boulier, Cyril Cohen
Towards Certified Meta-Programming with Typed Template-Coq. ITP 2018: 20-39 - [i2]Ran Chen, Cyril Cohen, Jean-Jacques Lévy, Stephan Merz, Laurent Théry:
Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle. CoRR abs/1810.11979 (2018) - 2017
- [j3]Cyril Cohen, Thierry Coquand, Simon Huber, Anders Mörtberg:
Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom. FLAP 4(10): 3127-3170 (2017) - [c10]Reynald Affeldt
Formal foundations of 3D geometry to model robot manipulators. CPP 2017: 30-42 - [c9]Cyril Cohen, Damien Rouhling:
A Formal Proof in Coq of LaSalle's Invariance Principle. ITP 2017: 148-163 - 2016
- [j2]Guillaume Cano, Cyril Cohen
Formalized linear algebra over Elementary Divisor Rings in Coq. Log. Methods Comput. Sci. 12(2) (2016) - [c8]Cyril Cohen, Boris Djalal:
Formalization of a newton series representation of polynomials. CPP 2016: 100-109 - [i1]Cyril Cohen, Thierry Coquand, Simon Huber, Anders Mörtberg:
Cubical Type Theory: a constructive interpretation of the univalence axiom. CoRR abs/1611.02108 (2016) - 2015
- [c7]Cyril Cohen
Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom. TYPES 2015: 5:1-5:34 - 2014
- [c6]Cyril Cohen, Anders Mörtberg:
A Coq Formalization of Finitely Presented Modules. ITP 2014: 193-208 - 2013
- [c5]Cyril Cohen, Maxime Dénès, Anders Mörtberg:
Refinements for Free! CPP 2013: 147-162 - [c4]Georges Gonthier, Andrea Asperti
A Machine-Checked Proof of the Odd Order Theorem. ITP 2013: 163-179 - [c3]Cyril Cohen
Pragmatic Quotient Types in Coq. ITP 2013: 213-228 - 2012
- [b1]Cyril Cohen:
Formalized algebraic numbers: construction and first-order theory. (Formalisation des nombres algébriques : construction et théorie du premier ordre). École Polytechnique, Palaiseau, France, 2012 - [j1]Cyril Cohen, Assia Mahboubi:
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Log. Methods Comput. Sci. 8(1) (2012) - [c2]Cyril Cohen:
Construction of Real Algebraic Numbers in Coq. ITP 2012: 67-82 - 2010
- [c1]Cyril Cohen, Assia Mahboubi:
A Formal Quantifier Elimination for Algebraically Closed Fields. AISC/MKM/Calculemus 2010: 189-203
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: