coq
devd
coq | devd | |
---|---|---|
87 | 9 | |
4,609 | 3,393 | |
0.7% | - | |
10.0 | 0.0 | |
5 days ago | almost 2 years ago | |
OCaml | Go | |
GNU Lesser General Public License v3.0 only | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
coq
-
Change of Name: Coq –> The Rocq Prover
The page summarizing the considered new names and their pros/cons is interesting: https://github.com/coq/coq/wiki/Alternative-names
Naming is hard...
-
The First Stable Release of a Rust-Rewrite 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/provable-security/
And check out Computer-Aided Verification (CAV).
-
Why Mathematical Proof Is a Social Compact
To be ruthlessly, uselessly pedantic - after all, we're mathematicians - there's reasonable definitions of "academic" where logical unsoundness is still academic if it never interfered with the reasoning behind any proofs of interest ;)
But: so long as we're accepting that unsoundness in your checker or its underlying theory are intrinsically deal breakers, there's definitely a long history of this, perhaps more somewhat more relevant than the HM example, since no proof checkers of note, AFAIK, have incorporated mutation into their type theory.
For one thing, the implementation can very easily have bugs. Coq itself certainly has had soundness bugs occasionally [0]. I'm sure Agda, Lean, Idris, etc. have too, but I've followed them less closely.
But even the underlying mathematics have been tricky. Girard's Paradox broke Martin-Löf's type theory, which is why in these dependently typed proof assistants you have to deal with the bizarre "Tower of Universes"; and Girard's Paradox is an analogue of Russell's Paradox which broke more naive set theories. And then Russell himself and his system of universal mathematics was very famously struck down by Gödel.
But we've definitely gotten it right this time...
[0] https://github.com/coq/coq/issues/4294
-
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+.
https://dafny.org/
https://whiley.org/
https://www.idris-lang.org/
https://isabelle.in.tum.de/
https://leanprover.github.io/
https://coq.inria.fr/
http://lamport.azurewebsites.net/tla/tla.html
-
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/Alternative-names
[2] https://github.com/coq/coq/wiki/Alternative-names#c%E1%B5%A3...
-
Mark Petruska has requested 250000 Algos for the development of a Coq-avm library for AVM version 8
Information about the Coq proof assistant: https://coq.inria.fr/ , https://en.wikipedia.org/wiki/Coq
- How are people like Andrew Wiles and Grigori Perelman able to work on popular problems for years without others/the research community discovering the same breakthroughs? Is it just luck?
-
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.
devd
-
Creating your own PDF templates (not page templates!)
Your technique is one I would turn towards as a developer who understands HTML/CSS flow so much better than I do any typesetting tool. I actually use a very similar technique for managing my CV and generating invoices for clients; I have a little "static site" generator I've written that takes JSON, throws it through a templating engine, and spits out HTML files. I then host a server in the output folder and print-to-pdf directly from there. This approach seems quite rare; I don't think enough people appreciate just how flexible CSS is or its support for common print-related tasks.
-
Live preview of vanilla CSS as I change it?
There are plenty of solutions to that specific problem. Nowadays, I only work on Nuxt/Next/Astro projects that come with hot reload out of the box so I don't have a need for it anymore, but I have used https://github.com/cortesi/devd a lot in the past, with much success.
A no-install solution would be to use the "workspace" feature of Chrome's Dev Tools:
1. Open your .html file in Chrome.
2. Open the Dev Tools.
3. In the "Sources" tab, activate the "Filesystem" sub-tab.
4. Click on "+ Add folder to workspace" and choose the directory containing your .html and .css files.
5. Edit the .css file with autocompletion and live preview.
6. Save your work so that it is synchronized with your filesystem.
In action: https://i.imgur.com/slcSt9X.gif
-
What is the Go equivalent of Node http-server?
Try https://github.com/cortesi/devd
- Ask HN: What developer tools would you like to see?
-
How do you live reload html pages in development?
This pair of tools do both front-end and back-end live reloading with a small amount of config: https://github.com/cortesi/modd https://github.com/cortesi/devd
- Big list of HTTP static server one-liners
- Just-In-Time: The Next Generation of Tailwind CSS – Tailwind CSS
-
Go 1.16 Release Notes
In tandem with https://github.com/cortesi/devd I've found it a good setup for web development.
Modd watches file changes and rebuilds, while Devd enables livereload, letting me make changes in my text editor and then see the rendered changes in the browser, side-by-side, in near real-time.
This is for go web development but I'm pretty sure these two tools are language-agnostic.
-
Asset won’t load. Help?
My favourite is https://github.com/cortesi/devd
What are some alternatives?
coc.nvim - Nodejs extension host for vim & neovim, load extensions like VSCode and host language servers.
goproxy - 🦁 goproxy is a proxy server which can forward http or https requests to remote servers./ goproxy 是一个反向代理服务器,支持转发 http/https 请求。
kok.nvim - Fast as FUCK nvim completion. SQLite, concurrent scheduler, hundreds of hours of optimization.
lets-proxy2 - Reverse proxy with automatically obtains TLS certificates from Let's Encrypt
FStar - A Proof-oriented Programming Language
goproxy - 🔥 Proxy is a high performance HTTP(S) proxies, SOCKS5 proxies,WEBSOCKET, TCP, UDP proxy server implemented by golang. Now, it supports chain-style proxies,nat forwarding in different lan,TCP/UDP port forwarding, SSH forwarding.Proxy是golang实现的高性能http,https,websocket,tcp,socks5代理服务器,支持内网穿透,链式代理,通讯加密,智能HTTP,SOCKS5代理,黑白名单,限速,限流量,限连接数,跨平台,KCP支持,认证API。
Agda - Agda is a dependently typed programming language / interactive theorem prover.
etcd - Distributed reliable key-value store for the most critical data of a distributed system
lean4 - Lean 4 programming language and theorem prover
apex
tlaplus - TLC is a model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
Caddy - Fast and extensible multi-platform HTTP/1-2-3 web server with automatic HTTPS