/explore
|
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... |
|
| | | | | ||
| | | | |
argumatronic.com
Occasional writings about Haskell. |
|
| | | | | ||
| | | | |
aymannadeem.github.io
A primer on the cruel, tacit laws of type-level programming in Haskell |
|
| | | | | ||
| | | | |
relatedwork.blogspot.com
WARNING: the following contains a whole lot of pedantry about proving theorems at a level of detail such that you could likely convince a co... |
|
| | | |||
