Explore >> Select a destination
|
You are here 
|
www.parsonsmatt.org | ||
| | | | |
kuruczgy.com
|
|
| | | | | [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... | |
| | | | |
blog.jle.im
|
|
| | | | | Weblog of Justin Le, covering various adventures in programming and explorations in the worlds of computation physics, and knowledge. | |
| | | | |
wimvanderbauwhede.codeberg.page
|
|
| | | | | This is a follow-on of my article on algebraic data types, with list-based parser combinators as a practical application. | |
| | | | |
gilkalai.wordpress.com
|
|
| | | Gowers, Green, Manners and Tao. They reminded me of the A-team of the 1980s television series: "If you have a problem, if no one else can help, and if you can find them, maybe you can hire... the A-Team." A conjecture of Marton, widely known as "the polynomial Freiman-Ruzsa conjecture" was certainly a holy grail | ||
