Onboard AI learns any GitHub repo in minutes and lets you chat with it to locate functionality, understand different parts, and generate new code. Use it for free at www.getonboard.dev. Learn more →
Coq Alternatives
Similar projects and alternatives to coq



Onboard AI
Learn any GitHub repo in 59 seconds. Onboard AI learns any GitHub repo in minutes and lets you chat with it to locate functionality, understand different parts, and generate new code. Use it for free at www.getonboard.dev.

coc.nvim
Nodejs extension host for vim & neovim, load extensions like VSCode and host language servers.

kok.nvim
Fast as FUCK nvim completion. SQLite, concurrent scheduler, hundreds of hours of optimization.


tlaplus
TLC is an explicit state model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.

coq.vim
Pathogencompatible distribution of Vicent Aravantinos' vim scripts for Coq.

InfluxDB
Collect and Analyze Billions of Data Points in Real Time. Manage all types of time series data in a single, purposebuilt database. Run at any scale in any environment in the cloud, onpremises, or at the edge.

coqserapi
Coq Protocol Playground with Se(xp)rialization of Internal Structures.




Apache Log4j 2
Apache Log4j 2 is a versatile, featurerich, efficient logging API and backend for Java.



rosenpass
Rosenpass is a postquantum secure VPN that uses WireGuard to transport the actual data.





Playwright
Playwright is a framework for Web Testing and Automation. It allows testing Chromium, Firefox and WebKit with a single API.

SaaSHub
SaaSHub  Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
coq reviews and mentions

The First Stable Release of a RustRewrite Sudo Implementation
Are those more important than, say:
 Proven with Coq, a formal proof management system: https://coq.inria.fr/
See in the real world: https://aws.amazon.com/security/provablesecurity/
And check out ComputerAided Verification (CAV).

In Which I Claim Rich Hickey Is Wrong
Dafny and Whiley are two examples with explicit verification support. Idris and other dependently typed languages should all be rich enough to express the required predicate but might not necessarily be able to accept a reasonable implementation as proof. Isabelle, Lean, Coq, and other theorem provers definitely can express the capability but aren't going to churn out much in the way of executable programs; they're more useful to guide an implementation in a more practical functional language but then the proof is separated from the implementation, and you could also use tools like TLA+.

If given a list of properties/definitions and relationship between them, could a machine come up with (mostly senseless, but) true implications?
Still, there are many useful tools based on these ideas, used by programmers and mathematicians alike. What you describe sounds rather like Datalog (e.g. Soufflé Datalog), where you supply some rules and an initial fact, and the system repeatedly expands out the set of facts until nothing new can be derived. (This has to be finite, if you want to get anywhere.) In Prolog (e.g. SWI Prolog) you also supply a set of rules and facts, but instead of a fact as your starting point, you give a query containing some unknown variables, and the system tries to find an assignment of the variables that proves the query. And finally there is a rich array of theorem provers and proof assistants such as Agda, Coq, Lean, and Twelf, which can all be used to help check your reasoning or explore new ideas.

Functional Programming in Coq
What ever happened to the effort [1] to rename Coq in order to make it less offensive? There were a number of excellent proposals [2] that seemed to die on the vine.
[1] https://github.com/coq/coq/wiki/Alternativenames
[2] https://github.com/coq/coq/wiki/Alternativenames#c%E1%B5%A3...

Mark Petruska has requested 250000 Algos for the development of a Coqavm library for AVM version 8
Information about the Coq proof assistant: https://coq.inria.fr/ , https://en.wikipedia.org/wiki/Coq

Basic SAT model of x86 instructions using Z3, autogenerated from Intel docs
This type of thing can help you formally verify code.
So, if your proof is correct, and your description of the (language/CPU) is correct, you can prove the code does what you think it does.
Formal proof systems are still growing up, though, and they are still pretty hard to use. See Coq for an introduction: https://coq.inria.fr/

What are the current hot topics in type theory and static analysis?
Most of the proof assistants out there: Lean, Coq, Dafny, Isabelle, F*, Idris 2, and Agda. And the main concepts are dependent types, Homotopy Type Theory AKA HoTT, and Category Theory. Warning: HoTT and Category Theory are really dense, you're going to really need to research them.
 The seven programming urlanguages
 Rosenpass – formally verified postquantum WireGuard

Any small/simple proof languages?
If you're meaning "more similar to common mathematics" then look at Lean or Coq.

A note from our sponsor  Onboard AI
getonboard.dev  28 Nov 2023
Stats
coq/coq is an open source project licensed under GNU Lesser General Public License v3.0 only which is an OSI approved license.
The primary programming language of coq is OCaml.