Y Combinator & Recursion
Unlock recursive functions without named references using fixed-point combinators. This technique forms the basis for iteration in purely functional systems.
Y = λf.(λx.f (x x)) (λx.f (x x))
fact = Y λf.λn. (zero? n)
(\ 1)
(\* n (f (pred n)))
Type Inference Visualizer
Continuation Passing
Transform functions to explicitly handle control flow with continuations. This technique enables advanced program analysis and optimization.
λk.k (λx.x)
Pattern Matching
Implement case analysis using λ-encoded data constructors. This pattern enables expressive yet type-safe decompositions.
Pattern
Handler
Computational Completeness
Simulate Turing machines using just function application. This section demonstrates encoding state transitions and tape operations.
Turing tape encoding visualization placeholder