Turing Award-winner Leslie Lamport shares the key lessons he has learned about concurrent and distributed computing over decades of writing and reasoning about their algorithms. Algorithms are not programs, and they shouldn't be written in a programming language. Instead, this book explores how to write them and reason about them by using mathematics. It explains the principles underlying abstract programs, which should be implemented to avoid concurrency errors. Designing an abstract program before writing any code can lead to better, more reliable programs. The book has very few mathematical prerequisites, with an appendix summarizing the necessary knowledge. The examples are written in TLA+ and are available online. This is a fascinating read for any graduate students and researchers in theoretical computer science, concurrency, and distributed systems.