Explore >> Select a destination
|
You are here 
|
www.dawn-lang.org | ||
| | | | |
hookrace.net
|
|
| | | | | ||
| | | | |
johnazariah.github.io
|
|
| | | | | The Y-Combinator. How to derive recursion in a purely functional context. | |
| | | | |
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. | |
| | | | |
www.baturin.org
|
|
| | | [AI summary] The user has provided a comprehensive guide to OCaml programming, covering basic syntax, expressions, bindings, functions, and arithmetic operations. The guide includes examples of how to structure programs, use let-bindings, handle multiple expressions, and perform conversions between temperature units. It also touches on concepts like variable shadowing and the importance of type consistency in OCaml. The user has included exercises at the end, asking the reader to write programs for squaring integers and converting Celsius to Fahrenheit. | ||
