Explore >> Select a destination
|
You are here 
|
danilafe.com | ||
| | | | |
www.dawn-lang.org
|
|
| | | | | ||
| | | | |
adam.chlipala.net
|
|
| | | | | [AI summary] This text provides an in-depth exploration of advanced Coq proof techniques, focusing on manual proofs, recursion, and induction principles for complex data structures. It covers topics like nested inductive types, custom induction principles, and the design philosophy behind Coq's approach to proof automation. The text includes detailed examples of proof scripts, such as manual proofs for discrimination and injectivity of constructors, and discusses the use of tactics like discriminate and injection. It also touches on the implementation of functions like pred and the role of hints in improving proof readability and automation. | |
| | | | |
www.philipzucker.com
|
|
| | | | | I've been working on Knuckledragger, my Z3 based semi-automated python proof assistant, on and off for 6 months (or arguably five years). I've realized I've done a bunch of stuff and despite writing often, not written the slightest bit about much of it. | |
| | | | |
nickdrozd.github.io
|
|
| | | Goedel's first incompleteness theorem is the claim that any sound, consistent formal system of sufficient power is incomplete; that is, there are statements in the language of the system that can neither be proved nor disproved. Traditionally the theorem is proved by exhbiting a statement g which is provably equivalent to a statement encoding its own disprovability in the system S. | ||
