Join 📚 Josh Beckman's Highlights
A batch of the best highlights from what Josh's read, .
Propositions in logic correspond to types in a programming language.
Proofs in the logic correspond to terms and programs in the programming language
Simplification of proofs corresponds to evaluation of programs.
"Propositions as Types" by Philip Wadler
Strange Loop Conference
A distributed system can be described as a particular sequential state machine that is implemented with a network of processors. The ability to totally order the input requests leads immediately to an algorithm to implement an arbitrary state machine by a network of processors, and hence to implement any distributed system.
Time, Clocks and the Ordering of Events in a Distributed System
Leslie Lamport
Pike's rules 1 and 2 restate Tony Hoare's famous maxim "Premature optimization is the root of all evil."
Ken Thompson rephrased Pike's rules 3 and 4 as "When in doubt, use brute force."
Rules 3 and 4 are instances of the design philosophy KISS.
Rule 5 was previously stated by Fred Brooks in The Mythical Man-Month and is often shortened to "write stupid code that uses smart objects".
Rob Pike's 5 Rules of Programming
University of Texas in Austin
...catch up on these, and many more highlights
Readwise