an impressive discovery:
"Speculatively, the Curry–Howard correspondence may be expected to lead to a substantial unification between mathematical logic and foundational computer science"
note to self: there is no looping, only mapping aka "set" operations
note to self re "reducing the size of the search tree". making simplifying assumptions can reduce the size of the state space so unwanted states are excluded from the space
"Sometimes we discover unpleasant truths. Whenever we do so, we are in difficulties: suppressing them is scientifically dishonest, so we must tell them, but telling them, however, will fire back on us..."
i highly recommend this outstanding piece of work for anyone seriously studying computer science. link to a PDF full-length copy of the book is at the bottom of the wikipedia page.
important underpinnings for computer science of the next several decades. i'm not sure exactly how to apply this yet, but we'll be seeing a ton more use for concurrent programming, quickly. the book is a free pdf, and a great read.