Clozure Common Lisp VS Coq

The descendant of CCL runs on modern Intel Macs. (It also runs on Linux and Windows but without the IDE.) The modern IDE is quite a bit different from the original. In particular, it no longer has the interface builder. But it's still pretty good. It is now called Clozure Common Lisp (so the acronym is still CCL) and you can find it here: https://ccl.clozure.com/ If you want to run the original that is a bit... - Source: Hacker News / 4 months ago

Just for fun there is also Clozure Common Lisp. https://ccl.clozure.com/. - Source: Hacker News / 7 months ago

I have decided it is time to have some fun and use Common Lisp to create algorithm representation that deals with parallel execution. For this I decided to use Clozure common lisp, put basic Qucklisp there and load some libraries to do this. - Source: dev.to / over 1 year ago

CCL also supports windows: https://ccl.clozure.com/. - Source: Hacker News / over 1 year ago

The only thing I've not seen said yet is that Clozure Common Lisp will probably be smaller at runtime than the more common SBCL. The latter has better support, however. Source: almost 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 / 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