Explore >> Select a destination
|
You are here 
|
kuruczgy.com | ||
| | | | |
rachelcarmena.github.io
|
|
| | | | | Some characteristics of functional programming | |
| | | | |
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. | |
| | | | |
wimvanderbauwhede.codeberg.page
|
|
| | | | | Algebraic data types are great for building complex data structures, and easy to implement in Raku using roles. | |
| | | | |
susam.net
|
|
| | | [AI summary] The article explains the mathematical properties of fields, demonstrating that a field has only two ideals—{0} and the field itself—and that a commutative ring with only these ideals must be a field. | ||
