Explore >> Select a destination
|
You are here 
|
www.tedinski.com | ||
| | | | |
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... | |
| | | | |
degoes.net
|
|
| | | | | Functional programming has a bit of jargon, but that doesn't have to stop you from understanding core concepts | |
| | | | |
www.baturin.org
|
|
| | | | | [AI summary] The text provides an in-depth exploration of functional programming concepts in OCaml, focusing on type systems, pattern matching, and data structures. It covers topics such as unit and boolean values as sum types, polymorphic types like option and result, and the use of match expressions for pattern matching. The text also includes exercises for practicing these concepts, such as defining functions, writing sum types, and implementing pattern matching. | |
| | | | |
www.kdnuggets.com
|
|
| | | From the biological neuron to LLMs: How AI became smart. | ||
