Refactoring Without Tests and Provable Correctness

#56 - Refactoring–The Discipline for Writing Good Code - Christian Clausen

Topic 4 of 18

Published Sep 20, 2021 · Clip 10:10–14:37 (4:27)

Christian argues against fanaticism about testing, advocating picking quality tools that fit the job. He explains his book's refactorings break down into atomic steps that minimize error risk, compensating for the absence of tests. He describes his thesis on provably correct software using proof assistants and dependently typed languages built on OCaml, where the computer verifies proofs without running the program. He notes limitations like the steep learning curve and no infinite loops, but sees lessons from that work (lambdas, higher-order functions, map/filter) seeping into mainstream languages, and expresses his love of type systems for eliminating the need to test certain properties.