Explore >> Select a destination


You are here

sitr.us
| | adam.chlipala.net
2.7 parsecs away

Travel
| | [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.
| | lexi-lambda.github.io
5.2 parsecs away

Travel
| |
| | kuruczgy.com
1.5 parsecs away

Travel
| | [AI summary] The article explores the intersection of functional programming and logic through the lens of dependent types. It begins with foundational concepts like type constructors and inductive types, then delves into the Curry-Howard isomorphism, which links programs to mathematical proofs. The discussion covers how types represent propositions, functions as implications, and inductive types as proof strategies. Examples include defining logical relations like less than or equal to and equality, and demonstrating how to prove properties like universal quantification and mathematical identities. The article concludes with an overview of resources for further study in proof assistants like Coq and Idris, emphasizing the practical applications of dependent...
| | whyevolutionistrue.com
27.4 parsecs away

Travel
| I'm getting tired of writing about free will, as what I'm really interested in is determinism of the physics sort, and, as far as we know, determinism is true except in the realm of quantum mechanics-where it may still be true, but probably not. So let me lump quantum mechanics and other physical laws together...