Rocq (English Wikipedia)

Danvy, Olivier (2022). "Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant". Journal of Functional Programming. 32. doi:10.1017/S0956796822000107. ISSN 0956-7968.
Gonthier, Georges; Mahboubi, Assia (2010). "An introduction to small scale reflection in Coq". Journal of Formalized Reasoning. 3 (2): 95–152. doi:10.6092/ISSN.1972-5787/1979.
Conchon, Sylvain; Filliâtre, Jean-Christophe (2007). "A persistent union-find data structure". In Russo, Claudio V.; Dreyer, Derek (eds.). Proceedings of the ACM Workshop on ML, 2007, Freiburg, Germany, October 5, 2007. Association for Computing Machinery. pp. 37–46. doi:10.1145/1292535.1292541. ISBN 978-1-59593-676-9.
Kaiser, Jan-Oliver; Ziliani, Beta; Krebbers, Robbert; Régis-Gianas, Yann; Dreyer, Derek (30 July 2018). "Mtac2: typed tactics for backward reasoning in Coq". Proceedings of the ACM on Programming Languages. 2 (ICFP): 78:1–78:31. doi:10.1145/3236773. hdl:21.11116/0000-0003-2E8E-B.
Grégoire, Benjamin; Mahboubi, Assia (2005). "Proving Equalities in a Commutative Ring Done Right in Coq". In Hurd, Joe; Melham, Tom (eds.). Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22–25, 2005, Proceedings. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. pp. 98–113. doi:10.1007/11541868_7. ISBN 978-3-540-31820-0.
Besson, Frédéric (2007). "Fast Reflexive Arithmetic Tactics the Linear Case and Beyond". In Altenkirch, Thorsten; McBride, Conor (eds.). Types for Proofs and Programs: International Workshop, TYPES 2006, Nottingham, UK, April 18–21, 2006, Revised Selected Papers. Lecture Notes in Computer Science. Vol. 4502. Berlin, Heidelberg: Springer. pp. 48–62. doi:10.1007/978-3-540-74464-1_4. ISBN 978-3-540-74464-1.
Braibant, Thomas; Pous, Damien (2010). Kaufmann, Matt; Paulson, Lawrence C. (eds.). An Efficient Coq Tactic for Deciding Kleene Algebras. Interactive Theorem Proving: First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. pp. 163–178. doi:10.1007/978-3-642-14052-5_13. ISBN 978-3-642-14052-5. S2CID 3566183.
Narboux, Julien (2004). "A Decision Procedure for Geometry in Coq". In Slind, Konrad; Bunker, Annette; Gopalakrishnan, Ganesh (eds.). Theorem Proving in Higher Order Logics: 17th International Conference, TPHOLS 2004, Park City, Utah, USA, September 14–17, 2004, Proceedings. Lecture Notes in Computer Science. Vol. 3223. Berlin, Heidelberg: Springer. pp. 225–240. doi:10.1007/978-3-540-30142-4_17. ISBN 978-3-540-30142-4. S2CID 11238876.

github.com (Global: 383^rd place; English: 320^th place)

"Rocq 9.1.0". 15 September 2025.
"Frequently Asked Questions". GitHub. Retrieved 8 May 2019.
"Coq roadmap 069". GitHub.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Kaiser, Jan-Oliver; Ziliani, Beta; Krebbers, Robbert; Régis-Gianas, Yann; Dreyer, Derek (30 July 2018). "Mtac2: typed tactics for backward reasoning in Coq". Proceedings of the ACM on Programming Languages. 2 (ICFP): 78:1–78:31. doi:10.1145/3236773. hdl:21.11116/0000-0003-2E8E-B.

inria.fr (Global: 4,903^rd place; English: 3,679^th place)

hal.inria.fr

"Introduction to the Calculus of Inductive Constructions". Retrieved 21 May 2019.

lri.fr (Global: low place; English: low place)

Conchon, Sylvain; Filliâtre, Jean-Christophe (2007). "A persistent union-find data structure". In Russo, Claudio V.; Dreyer, Derek (eds.). Proceedings of the ACM Workshop on ML, 2007, Freiburg, Germany, October 5, 2007. Association for Computing Machinery. pp. 37–46. doi:10.1145/1292535.1292541. ISBN 978-1-59593-676-9.

msr-inria.fr (Global: low place; English: low place)

"Feit-Thompson theorem has been totally checked in Coq". Msr-inria.inria.fr. 20 September 2012. Archived from the original on 19 November 2016. Retrieved 25 September 2012.

ouvrirlascience.fr (Global: low place; English: low place)

"Open Science Awards for Open Source Research Software". Ouvrir la Science. 7 February 2022. Retrieved 4 December 2025.

rocq-prover.org (Global: low place; English: low place)

A Tour of Rocq
A Brief History
"Version 8.7 Summary of changes". rocq-prover.org.
"The ring and field tactic families — Rocq Prover 9.0.0 documentation". rocq-prover.org. Retrieved 7 May 2025.
"Micromega: solvers for arithmetic goals over ordered rings — Rocq Prover 9.0.0 documentation". rocq-prover.org. Retrieved 7 May 2025.
"Version 9.0 Summary of changes". rocq-prover.org.
"An Overview of the Name's Evolution". rocq-prover.org.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Braibant, Thomas; Pous, Damien (2010). Kaufmann, Matt; Paulson, Lawrence C. (eds.). An Efficient Coq Tactic for Deciding Kleene Algebras. Interactive Theorem Proving: First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. pp. 163–178. doi:10.1007/978-3-642-14052-5_13. ISBN 978-3-642-14052-5. S2CID 3566183.
Narboux, Julien (2004). "A Decision Procedure for Geometry in Coq". In Slind, Konrad; Bunker, Annette; Gopalakrishnan, Ganesh (eds.). Theorem Proving in Higher Order Logics: 17th International Conference, TPHOLS 2004, Park City, Utah, USA, September 14–17, 2004, Proceedings. Lecture Notes in Computer Science. Vol. 3223. Berlin, Heidelberg: Springer. pp. 225–240. doi:10.1007/978-3-540-30142-4_17. ISBN 978-3-540-30142-4. S2CID 11238876.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Grégoire, Benjamin; Mahboubi, Assia (2005). "Proving Equalities in a Commutative Ring Done Right in Coq". In Hurd, Joe; Melham, Tom (eds.). Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22–25, 2005, Proceedings. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. pp. 98–113. doi:10.1007/11541868_7. ISBN 978-3-540-31820-0.
Besson, Frédéric (2007). "Fast Reflexive Arithmetic Tactics the Linear Case and Beyond". In Altenkirch, Thorsten; McBride, Conor (eds.). Types for Proofs and Programs: International Workshop, TYPES 2006, Nottingham, UK, April 18–21, 2006, Revised Selected Papers. Lecture Notes in Computer Science. Vol. 4502. Berlin, Heidelberg: Springer. pp. 48–62. doi:10.1007/978-3-540-74464-1_4. ISBN 978-3-540-74464-1.
Braibant, Thomas; Pous, Damien (2010). Kaufmann, Matt; Paulson, Lawrence C. (eds.). An Efficient Coq Tactic for Deciding Kleene Algebras. Interactive Theorem Proving: First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. pp. 163–178. doi:10.1007/978-3-642-14052-5_13. ISBN 978-3-642-14052-5. S2CID 3566183.
Narboux, Julien (2004). "A Decision Procedure for Geometry in Coq". In Slind, Konrad; Bunker, Annette; Gopalakrishnan, Ganesh (eds.). Theorem Proving in Higher Order Logics: 17th International Conference, TPHOLS 2004, Park City, Utah, USA, September 14–17, 2004, Proceedings. Lecture Notes in Computer Science. Vol. 3223. Berlin, Heidelberg: Springer. pp. 225–240. doi:10.1007/978-3-540-30142-4_17. ISBN 978-3-540-30142-4. S2CID 11238876.

unibo.it (Global: 4,963^rd place; English: 7,139^th place)

jfr.unibo.it

Gonthier, Georges; Mahboubi, Assia (2010). "An introduction to small scale reflection in Coq". Journal of Formalized Reasoning. 3 (2): 95–152. doi:10.6092/ISSN.1972-5787/1979.

web.archive.org (Global: 1^st place; English: 1^st place)

"Feit-Thompson theorem has been totally checked in Coq". Msr-inria.inria.fr. 20 September 2012. Archived from the original on 19 November 2016. Retrieved 25 September 2012.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Danvy, Olivier (2022). "Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant". Journal of Functional Programming. 32. doi:10.1017/S0956796822000107. ISSN 0956-7968.

Rocq (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

ams.org

mathscinet.ams.org

bbchallenge.org (Global: low place; English: low place)

discuss.bbchallenge.org

bbchallenge.org

books.google.com (Global: 3rd place; English: 3rd place)

chlipala.net (Global: low place; English: low place)

adam.chlipala.net

doi.org (Global: 2nd place; English: 2nd place)

github.com (Global: 383rd place; English: 320th place)

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

inria.fr (Global: 4,903rd place; English: 3,679th place)

hal.inria.fr

lri.fr (Global: low place; English: low place)

msr-inria.fr (Global: low place; English: low place)

ouvrirlascience.fr (Global: low place; English: low place)

rocq-prover.org (Global: low place; English: low place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

springer.com (Global: 274th place; English: 309th place)

link.springer.com

unibo.it (Global: 4,963rd place; English: 7,139th place)

jfr.unibo.it

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

ams.org (Global: 451^st place; English: 277^th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

doi.org (Global: 2^nd place; English: 2^nd place)

github.com (Global: 383^rd place; English: 320^th place)

handle.net (Global: 102^nd place; English: 76^th place)

inria.fr (Global: 4,903^rd place; English: 3,679^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

springer.com (Global: 274^th place; English: 309^th place)

unibo.it (Global: 4,963^rd place; English: 7,139^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)