Categories
9 pages
FP
Functional Programming
Basic Lambda Calculus Programming (feat. Y combinator)
Abstractions for Search Algorithms
The Construction of the Iteration Combinator - LCaC § 4C, Theorem 4.20
Church Encoding Note
Message Passing Perspective on Bool - SICP § 2.4.3 | Generic | Data and Functions
Huffman Trees in Haskell | Structure and Destructure of Compound Data
Nested Mapping Examples Implemented in Haskell - SICP § 2.2.3 | List Monad
Semantics of `let` in Scheme(feat. Semantics of `if`)
MIT-Scheme Basic Usage