Coq VS OCaml

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 / 10 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

If you have been in the Ruby community for the past couple of years, it's possible that you're not a super fan of types or that this concept never passed through your mind, and that's totally cool. I myself love the dynamic and meta-programming nature of Ruby, and honestly, by the time of this article's writing, we aren't on the level of OCaml for type checking and inference, but still, there are a couple of nice... - Source: dev.to / 8 months ago

An amazing example is Ocaml lang logo / mascot. It might be useful to talk with them to know what was the process behind this work. The About page camel head on Perl dot org header is also a pretty good example of simplification, but it's not a logo, just a friendly illustration, as the O'Reilly camel is. Another notable logo for this animal is the well known tobacco industry company, but don't get me started on... - Source: dev.to / 10 months ago

Haskell and Agda are probably the most obvious examples. Ocaml too, but it is much older, so its type system is not as categorical. There is also Idris, which is not as well-known but is very cool. Source: 11 months ago

NEAT is a fascinating algorithm. I've been interested in it ever since SethBling made a video about it playing Mario and this series of experiments about a variant of NEAT that evolves in real-time rather than by-generation. I'm finally getting to be just good enough of a programmer that I am actually considering writing my own (probably in OCaml because there's an unfortunate lack of NEAT implementations in... Source: 12 months ago

Easier than haskell and easier for writing compilers: https://ocaml.org/. Source: 12 months ago