Exploring Extreme Programming
One way to determine “sufficient completeness” suggests considering all sequences of calls that can take an object to a state. This enumeration suggests important test cases. Continue reading Sufficient Completeness and Testing
Somebody at MIT was nice enough to make available the videos for lectures on Structure and Interpretation of Computer Programs, by Abelson and Sussman. It’s a refresher in just how powerful Lisp is. For a language approaching 50 years old, Continue reading Structure and Interpretation of Computer Programs – Videos
Refactoring to Patterns, Joshua Kerievsky. Addison-Wesley, 2005. Design patterns and refactoring have been related for a long time. (Consider that Ralph Johnson, one of the co-authors of Design Patterns, was a sponsor of the work that created the original refactoring Continue reading Review – Refactoring to Patterns
Fit code, part 8, RowFixture. Continue reading Fit Reading (Part 8 of 8) – RowFixture
Fit part 7, ColumnFixture. Continue reading Fit Reading (Part 7 of 8) – ColumnFixture
Language workbenches. Continue reading Martin Fowler’s Article on Language Workbenches
Can you test-drive an algorithm? Continue reading A Comparison Algorithm for TDD
Fit code, part 6 – TypeAdapter. Continue reading Fit Reading (Part 6 of 8) – TypeAdapter
A Software Tools Sampler, Webb Miller. Prentice Hall, 1987. Unix and its tools are still important, even if the modern GUI mostly ignores their abilities. This book provides algorithms and C code for file updating, comparison, searching, and editing. It’s Continue reading Review – A Software Tools Sampler
Fit code, part 5 – ActionFixture. Continue reading Fit Reading (Part 5 of 8) – ActionFixture