Nocksche and Nocko

on YouTube ↗27m

" summary

Two novel implementations demonstrate concrete choices and consequences: Nocksche in Racket and Nocko in miniKanren implement the full Nock rules, encode SKI to prove universality, and produce a working quine that uses only the tree index rule. Key implementation decisions include tagging naturals, enforcing right‑associative normalization versus shallow grouping, and treating the calculus as strict so B subexpressions must evaluate. The exercise exposes spec ambiguities around first‑match pattern ordering and requires explicit partitioning in the relational version.

AI-written summary · about

" chapters (13)

1. 0:00Nock and Nocko introduction
2. 1:23Industry and academic uses
3. 4:53Valid Nock expressions
4. 7:40Nock as runner or operator
5. 10:34Strictness in Nock reduction
6. 12:20Scheme vs Min-Canon matching
7. 14:49Right associativity in Nock
8. 17:21Nock as stack combinator
9. 20:32Nock Quines implementation
10. 23:00Nock future work
11. 25:29Q&A on implementation
12. 26:14Nock implementation challenges
13. 27:15Nock edge cases