Thinnings: Sublist Witnesses and de Bruijn Index Shift Clumping
Summary
The post introduces thinnings as witnesses to sublist questions, with representations as bitvectors and methods for composing them. It then delves into De Bruijn shifting and mega shifts, illustrating how thinnings relate to category-theoretic notions like identity and composition, supported by Python and Prolog code examples. The discussion also hints at potential applications in hash-consing, unification, and proof object frameworks within lambda calculus and formal methods.