This book is based on the author's experience of 30 years of teaching programming at the University of Oxford and is an excellent choice for early programming courses offered by universities worldwide. It is a rigorous and thoughtfully structured textbook designed to equip students with both the theoretical underpinnings and practical skills essential in today's programming landscape. It describes how to think about computer programs and how to use mathematics as part of that thinking. Many books and online tutorials teach the basics of coding: the syntax of the language, and how to translate an algorithm into code. But how do you come up with that algorithm and know it is correct?
The first part of the book considers small programs that use a loop, and how to demonstrate their correctness using loop invariants. It also covers some algorithms and algorithmic techniques that every programmer should know. The second half of the book considers slightly larger programs. It teaches the basics of modularization, splitting up a program into manageable chunks. It teaches about abstract datatypes, values within a program that can be treated as mathematical values: how to specify their behaviors formally; and how to treat them as abstract mathematical objects when programming. It also teaches how to use data structures to represent abstract datatypes, and what it means for such a representation to be correct. And it presents some abstract datatypes and data structures that every programmer should know. The book is pragmatic: the philosophy is to include enough formality to be convincing and to guide the programmer towards correct code, without getting bogged down in the mathematics.
Each chapter includes questions at the end and a solution manual for those exercises is available for adopting instructors. Source code is also available for download from the author's website or Github. Combining pedagogical clarity with up-to-date industry relevance, Thinking About Programs guides learners through fundamental programming concepts, algorithmic thinking, and problem-solving strategies while fostering a deep understanding of computational logic.
Gavin Lowe is an Emeritus Professor of Computer Science and tutorial fellow at St. Catherine's College, Oxford. He was a professor at the University of Oxford and President of the Senior Common Room at St. Catherine's College. His research interests included the fields of concurrency and computer security and he developed the cryptographic protocol analysis tool Casper. He is a distinguished teacher, winning awards in 2008 and 2010 and is responsible (along with Peter Millican) for the development and establishment of a new joint degree in Computer Science and Philosophy at the University of Oxford in 2012. He received his undergraduate degree in mathematics, a Master's in computation, and his doctorate from Oxford.
