Coq (Portuguese Wikipedia)
Analysis of information sources in references of the Wikipedia article "Coq" in Portuguese language version.
Last modified:
Ref.Un. Ref.Website
Global rank
Portuguese rank
low place
low place
182nd place
244th place
380th place
659th place
low place
low place
low place
low place
3rd place
7th place
4th place
5th place
low place
low place
1st place
1st place
66th place
183rd place
low place
low place
ams.org (Global: 434th place; Portuguese: 570th place)
- Gonthier, Georges (2008). «Formal Proof—The Four-Color Theorem» (PDF). Notices of the American Mathematical Society. 55 (11): 1382–1393. MR 2463991
bbchallenge.org (Global: low place; Portuguese: low place)
discuss.bbchallenge.org
- «[July 2nd 2024] We have proved "BB(5) = 47,176,870"». The Busy Beaver Challenge (em inglês). 2 de julho de 2024. Consultado em 2 de julho de 2024
bbchallenge.org
- «The Busy Beaver Challenge». bbchallenge.org (em inglês). Consultado em 2 de julho de 2024
books.google.com (Global: 3rd place; Portuguese: 7th place)
- Avigad, Jeremy; Mahboubi, Assia (3 de Julho de 2018). Interactive Theorem Proving: 9th International Conference, ITP 2018, Held as ... [S.l.]: Springer. ISBN 9783319948218. Consultado em 21 de Outubro de 2018
chlipala.net (Global: low place; Portuguese: low place)
adam.chlipala.net
- Chlipala, Adam (7 de junho de 2022). «Library Universes». Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant. [S.l.]: MIT Press. ISBN 978-0262026659
- Adam Chlipala. "Certified Programming with Dependent Types": "Library GeneralRec". "Library InductiveTypes".
doi.org (Global: 2nd place; Portuguese: 4th place)
dx.doi.org
- Danvy, Olivier (2022). «Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant». Journal of Functional Programming (em inglês). 32. ISSN 0956-7968. doi:10.1017/S0956796822000107
- 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. Proceedings of the ACM Workshop on ML, 2007, Freiburg, Germany, October 5, 2007. Association for Computing Machinery. pp. 37–46. ISBN 978-1-59593-676-9. doi:10.1145/1292535.1292541
- Kaiser, Jan-Oliver; Ziliani, Beta; Krebbers, Robbert; Régis-Gianas, Yann; Dreyer, Derek (30 de julho de 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. Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22–25, 2005, Proceedings. Col: Lecture Notes in Computer Science (em inglês). Berlin, Heidelberg: Springer. pp. 98–113. ISBN 978-3-540-31820-0. doi:10.1007/11541868_7
- Besson, Frédéric (2007). «Fast Reflexive Arithmetic Tactics the Linear Case and Beyond». In: Altenkirch, Thorsten; McBride, Conor. Types for Proofs and Programs: International Workshop, TYPES 2006, Nottingham, UK, April 18–21, 2006, Revised Selected Papers. Col: Lecture Notes in Computer Science (em inglês). 4502. Berlin, Heidelberg: Springer. pp. 48–62. ISBN 978-3-540-74464-1. doi:10.1007/978-3-540-74464-1_4
- 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 (em inglês). Berlin, Heidelberg: Springer. pp. 163–178. ISBN 978-3-642-14052-5. doi:10.1007/978-3-642-14052-5_13
- Narboux, Julien (2004). «A Decision Procedure for Geometry in Coq». In: Slind, Konrad; Bunker, Annette; Gopalakrishnan, Ganesh. Theorem Proving in Higher Order Logics: 17th International Conference, TPHOLS 2004, Park City, Utah, USA, September 14–17, 2004, Proceedings. Col: Lecture Notes in Computer Science (em inglês). 3223. Berlin, Heidelberg: Springer. pp. 225–240. ISBN 978-3-540-30142-4. doi:10.1007/978-3-540-30142-4_17
github.com (Global: 380th place; Portuguese: 659th place)
- «Rocq 9.2.0». 27 março 2026
- «Frequently Asked Questions». GitHub. Consultado em 8 de maio de 2019
- «Coq roadmap 069». GitHub
hdl.handle.net (Global: 66th place; Portuguese: 183rd place)
- Kaiser, Jan-Oliver; Ziliani, Beta; Krebbers, Robbert; Régis-Gianas, Yann; Dreyer, Derek (30 de julho de 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: 6,372nd place; Portuguese: 9,113th place)
hal.inria.fr
- «Introduction to the Calculus of Inductive Constructions». Consultado em 21 de Maio de 2019
lri.fr (Global: low place; Portuguese: low place)
- Conchon, Sylvain; Filliâtre, Jean-Christophe (2007). «A persistent union-find data structure». In: Russo, Claudio V.; Dreyer, Derek. Proceedings of the ACM Workshop on ML, 2007, Freiburg, Germany, October 5, 2007. Association for Computing Machinery. pp. 37–46. ISBN 978-1-59593-676-9. doi:10.1145/1292535.1292541
msr-inria.fr (Global: low place; Portuguese: low place)
- «Feit-Thompson theorem has been totally checked in Coq». Msr-inria.inria.fr. 20 de setembro de 2012. Consultado em 25 de setembro de 2012. Cópia arquivada em 19 de novembro de 2016
ouvrirlascience.fr (Global: low place; Portuguese: low place)
- «Open Science Awards for Open Source Research Software». Ouvrir la Science (em inglês). 7 de fevereiro de 2022. Consultado em 4 de dezembro de 2025
rocq-prover.org (Global: low place; Portuguese: 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. Consultado em 7 de maio de 2025
- «Micromega: solvers for arithmetic goals over ordered rings — Rocq Prover 9.0.0 documentation». rocq-prover.org. Consultado em 7 de maio de 2025
- «Version 9.0 Summary of changes». rocq-prover.org
- «An Overview of the Name's Evolution». rocq-prover.org
springer.com (Global: 182nd place; Portuguese: 244th 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. Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005, Oxford, UK, August 22–25, 2005, Proceedings. Col: Lecture Notes in Computer Science (em inglês). Berlin, Heidelberg: Springer. pp. 98–113. ISBN 978-3-540-31820-0. doi:10.1007/11541868_7
- Besson, Frédéric (2007). «Fast Reflexive Arithmetic Tactics the Linear Case and Beyond». In: Altenkirch, Thorsten; McBride, Conor. Types for Proofs and Programs: International Workshop, TYPES 2006, Nottingham, UK, April 18–21, 2006, Revised Selected Papers. Col: Lecture Notes in Computer Science (em inglês). 4502. Berlin, Heidelberg: Springer. pp. 48–62. ISBN 978-3-540-74464-1. doi:10.1007/978-3-540-74464-1_4
- 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 (em inglês). Berlin, Heidelberg: Springer. pp. 163–178. ISBN 978-3-642-14052-5. doi:10.1007/978-3-642-14052-5_13
- Narboux, Julien (2004). «A Decision Procedure for Geometry in Coq». In: Slind, Konrad; Bunker, Annette; Gopalakrishnan, Ganesh. Theorem Proving in Higher Order Logics: 17th International Conference, TPHOLS 2004, Park City, Utah, USA, September 14–17, 2004, Proceedings. Col: Lecture Notes in Computer Science (em inglês). 3223. Berlin, Heidelberg: Springer. pp. 225–240. ISBN 978-3-540-30142-4. doi:10.1007/978-3-540-30142-4_17
unibo.it (Global: 3,746th place; Portuguese: 5,549th 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: 1st place; Portuguese: 1st place)
- «Feit-Thompson theorem has been totally checked in Coq». Msr-inria.inria.fr. 20 de setembro de 2012. Consultado em 25 de setembro de 2012. Cópia arquivada em 19 de novembro de 2016
worldcat.org (Global: 4th place; Portuguese: 5th place)
- Danvy, Olivier (2022). «Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant». Journal of Functional Programming (em inglês). 32. ISSN 0956-7968. doi:10.1017/S0956796822000107