Learn UNLAMBDA with Real Code Examples

Understand basic combinatory logic (SKI calculus)

Learn Unlambda syntax and combinators

Run simple programs to print output

Experiment with input/output combinators

Write small algorithms entirely in combinators

Week 1: Run and understand existing programs

Week 2: Learn and trace combinator applications

Week 3: Write small custom programs

Week 4: Implement basic algorithms (factorial, sum, etc.)

Week 5: Explore Turing-completeness demonstrations

What is a combinator in Unlambda?

How does Unlambda implement conditional logic?

Explain how I/O works in Unlambda

How is recursion achieved without named functions?

Why is Unlambda considered Turing-complete?

s, k, i - basic combinators

.c - print character c

, - read input character

` - function application (left-associative)

v - discard argument, @ - call/loop combinator

The Unlambda Programming Language - David Madore

Esoteric Programming Languages Handbook

Combinatory Logic for Fun and Profit

Turing-Complete Minimalism: Theory and Practice

Recreational Programming with Unlambda

Introduction to Unlambda

Basic combinators and application

Printing and I/O in Unlambda

Building recursive functions

Advanced combinator tricks and challenges

http://www.ioccc.org/years.html#1999-madore

https://esolangs.org/wiki/Unlambda

Esoteric Programming Wiki

Code Golf StackExchange

Online REPLs for Unlambda

GitHub repositories for Unlambda interpreters

Functional programming academic forums

Esoteric programming forums

Code-golf communities

Academic functional programming groups

GitHub repositories for esolangs

Online tutorials and REPLs