Idris
Agda
Rust
Lean
ATS
Racket Lang
Isabelle
Elixir
Coq
Agda
Isabelle
Lean
Racket Lang
Haskell
Hy
Ceylon
Idris CoqBased on our record, Coq seems to be a lot more popular than Idris. While we know about 46 links to Coq, we've tracked only 1 mention of Idris. We are tracking product recommendations and mentions on various public social media platforms and blogs. They can help you identify which product is more popular and what people think of it.
So apparently there's a package manager called Inigo, but there are only a few packages in it. There's an idris-hackers group on github, that's linked from the idris-lang.org page. None of those libraries appear in Inigo though. So seems that Inigo isn't really a thing people are using. Source: over 2 years ago
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/provable-security/ And check out Computer-Aided Verification (CAV). - Source: Hacker News / 6 months ago
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;... - Source: Hacker News / 9 months ago
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... Source: 10 months ago
Information about the Coq proof assistant: https://coq.inria.fr/ , https://en.wikipedia.org/wiki/Coq. Source: 12 months ago
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/. - Source: Hacker News / 12 months ago
Agda - Agda is a dependently typed functional programming language. It has inductive families, i.e.
Rust - A safe, concurrent, practical language
Isabelle - Isabelle is a proof assistant for writing and checking mathematical proofs by computer.
Lean - Clean up your Live Photos
ATS - American Thoracic Society
Racket Lang - Racket (formerly PLT Scheme) is a modern programming language in the Lisp/Scheme family, suitable...