New to Computer Science? Read the Computer Science article
Go beyond the basics of Lean 4. This practical deep dive explores functional programming, dependent types, theorem proving and formal verification. Learn how Lean works under the hood, build reliable proofs and automation, and tackle larger formal projects with confidence.
What if AI could help build software that is not just functional but mathematically proven to work? This book shows how to combine Claude’s coding capabilities with Lean 4’s formal verification to create more reliable software. A practical guide to turning ambitious ideas into verified systems, without losing sight of real-world constraints.
Programming languages are entering a new era. This book explores Vale, Valen, Bend and Revo, showing how they approach memory safety, concurrency, type systems and verification. With runnable examples and clear technical analysis, it offers experienced programmers a grounded look at where systems programming may be headed.
Distributed systems are hard enough to build without having to guess whether they work. This book shows experienced software engineers how to use TLA+ and TLC to find bugs before they reach production, with practical examples and four real-world case studies. It also explores how Claude Code can become a valuable partner in the verification process without replacing engineering judgment.
Formal verification does not have to live in research papers. This practical guide shows working software engineers how to turn real requirements into precise, machine-checkable guarantees, find bugs before they reach production and bring formal methods into everyday development, from application code to distributed and security-critical systems.
Make your Python AI code up to 100× faster using NumPy vectorization, Numba, parallel execution, and GPU acceleration. Learn through practical benchmarks and real-world optimization examples.
What happens when code becomes mathematics and mathematics becomes something a machine can verify? Explore the foundations of functional programming, the elegance of lambda calculus and the surprising connection between types and logic. With hands-on work in Lean, Coq and Agda, discover how to turn mathematical ideas into proofs that computers can trust.
An introduction to actor-critic algorithms as dynamical systems: featuring hand-computable examples, fast-slow reductions, and machine-checked Lean 4 proofs