Explore >> Select a destination
|
You are here 
|
wimvanderbauwhede.github.io | ||
| | | | |
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. | |
| | | | |
wickstrom.tech
|
|
| | | | | ||
| | | | |
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. | |
| | | | |
bastian.rieck.me
|
|
| | | |||
