Tests, Derivations, Proofs
summary
Uses APL and a custom assert utility to express executable assertions that fully specify correctness: tests for the Diamond Cutter check shape (2n+1 by 2n+1 or 0×0), vertical and horizontal symmetry, quadrant diagonals and off‑diagonals. Tests on the transpose primitive derive the shape formula (grouped by sorted indices) and a terse index‑based implementation with rank = 1+max(X). Derives and verifies recursive 2×2 block inverses, a Cholesky block algorithm, a linear‑time sum proof, and characterizes Ackermann growth experimentally.
AI-written summary · about
chapters (5)
related talks
27mA Novice Introduces APL Programming Language
45mRUBY ARRAYS ON STEROIDS
45mAPLicative Programming with Naperian Functors
36mHooray for arrays
39mBuilding composable abstractions
01h 33mComposition Intuition II
46mThe Calculated Typer (Functional Pearl)
34mFunctional Programming + Dependent Types ≡ Verified Linear..
