Church Encoding, Parametricity, and the Yoneda Lemma
The article explores the concepts of Church encoding, parametricity, and the Yoneda Lemma within functional programming. It discusses how natural numbers and lists can be represented as functions, revealing deeper connections between data types and category theory. The author emphasizes the importance of System F, which allows for polymorphic functions and the encoding of types from scratch.
- ▪Church encoding represents natural numbers as functions, where each number applies a successor function a specified number of times.
- ▪System F, the polymorphic lambda calculus, allows functions to take types as arguments, enabling greater flexibility in programming.
- ▪The Yoneda Lemma illustrates that the ways to consume a type fully determine the type itself, highlighting a fundamental principle in category theory.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Wybxc |
| Canonical URL | https://blog.wybxc.cc/blog/parametricity/ |
| Publication time | Sat, 23 May 2026 07:10:05 +0000 |
| Retrieval time | 2026-05-23T07:37:25.773Z |
| Last seen | 2026-05-23T07:37:25.773Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | 8Lk2-eHdiFpa |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
May 19, 202629 mins readTable of ContentsChurch Encoding, Parametricity, and the Yoneda LemmaSystem FParametricityAlgebraic Data Types and FunctorsF-AlgebraInitial AlgebraThe Yoneda LemmaThe Final Recap Church Encoding, Parametricity, and the Yoneda LemmaI still remember the shock I felt when I first encountered functional programming years ago. That was the moment I learned that natural numbers can be built within the language itself:data Nat = Zero | Succ NatI went on to learn that all computation can be expressed through functions (the lambda calculus), that recursion itself can be encoded as the mind-bending Y combinator:Y = λf. (λx. f (x x)) (λx. f (x x))And then there were Church numerals, where each number becomes a function:0 = λs. λz. z 1 = λs. λz. s z 2 = λs. λz.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Wybxc.