Explore >> Select a destination
|
You are here 
|
danilafe.com | ||
| | | | |
text.marvinborner.de
|
|
| | | | | The bruijn programming language is pure lambda calculus with some syntactic improvements. It doesn't have any primitive functions - how is that possible? | |
| | | | |
afnan.io
|
|
| | | | | [AI summary] The author explains the basics of lambda calculus, a theoretical model of computation invented by Alonzo Church that serves as the foundation for functional programming languages. | |
| | | | |
sookocheff.com
|
|
| | | | | Lambda calculus provides some of the foundational structures that functional programming is built from. It therefore seems fitting to start my journey through functional programming with a thorough examination of lambda calculus. This first post will introduce Lambda calculus with references to the book An Introduction to Functional Programming Through Lambda Calculus. Syntax The complete syntax for Lambda calculus is surprisingly small and comprehensible. This section lists the syntax in its entirety, while following sections break the syntax down to explain each part. | |
| | | | |
text.marvinborner.de
|
|
| | | This article describes a variadic extension to the default fixed-point combinator namely the Y-combinator. We do this by translating the Scheme code from a paper to bruijn (pure lambda calculus). | ||
