Explore >> Select a destination
|
You are here 
|
www.poberezkin.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... | |
| | | | |
byorgey.wordpress.com
|
|
| | | | | tl;dr: How to compile a functional language via combinators (and evaluate via the Haskell runtime) while keeping the entire process type-indexed, with a bibliography and lots of references for further reading There is a long history, starting with Schönfinkel and Curry, of abstracting away variable names from lambda calculus terms by converting to combinators, aka... | |
| | | | |
serokell.io
|
|
| | | | | Learn about the concept of type witness and where it can be useful in this blog post on type-level programming in Haskell. | |
| | | | |
github.com
|
|
| | | Playing around with different Y Combinator implementations - calincru/Y-Combinator | ||
