OCaml VS Agda

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

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

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

Coq, Agda, Lean, Isabelle, and probably some others which are not coming to my mind at the moment, but those would be considered the major ones. Source: over 1 year ago

Safer doesn't mean better. You could proof program correctness, and get proven program with tools like Coq (https://news.ycombinator.com/) and Agda (https://wiki.portal.chalmers.se/agda/pmwiki.php). However, it leads to much higher cost of creating software than both C++ and Rust. It's a trade-off. A great thing about Rust is that the safety costs very little compared to Coq and Agda. Source: over 1 year ago

At the most extreme level, you disappear into a meditative solitary retreat for a couple of years to seek enlightenment, and when you emerge you're no longer a programmer who writes programs, you're a theorist who proves theorems in Agda, and you have transcended above things that are tainted by the inherent evil of the material plane like "side effects" and "business needs" and "delivery timelines" and "could you... Source: almost 2 years ago