Eric Lippert • 2/3/2023

The names of birds, part 4

Read Original

The article uses a whimsical analogy of birds (combinators) in a forest to explain combinatory logic. It details the S (starling) and K (kestrel) combinators, shows how they can form the identity (I) and mockingbird (M) combinators, and connects this to lambda calculus and computation theory, noting its relevance for computer scientists.

0 comments
#computer science #functional programming #mathematics
The names of birds, part 4

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

1
The Beautiful Web
Jens Oliver Meiert • 2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane • 1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg • 1 votes
4
Wagon’s algorithm in Python
John D. Cook • 1 votes
5
An example conversation with Claude Code
Dumm Zeuch • 1 votes