/explore
|
You are here 
|
aartaka.me | ||
| | | | |
sookocheff.com
In a purely functional language - like lambda calculus - programs are expressed as nested function calls. Repetition in such an environment requires that nesting of function calls continues until some condition is met. During the repetition, each function passes its result to the next function in the nested chain and this repetition is completed when a test for some condition passes. The repetitive behaviour I've just described is recursion: |
|
| | | | | ||
| | | | |
danilafe.com
[AI summary] The blog post explores lambda calculus, its role in computation, and how Church-encoded integers are used to represent natural numbers through abstraction and function application. |
|
| | | | | ||
| | | | |
backdrifting.net
Lambda Calculus: A gentle introduction and broader context |
|
| | | | | ||
| | | | |
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... |
|
| | | |||
