The Truth of a Procedure in Programming

Explore a thought-provoking conference talk that delves into the mathematical modeling of procedures in programming, drawing parallels between computer science and mathematical logic. Discover how to interpret procedures and their interfaces as logical sentences, examining concepts of truth, falsehood, possibility, impossibility, necessity, and provability. Gain insights from software architect Lisa Lippincott as she presents programming from a logician's perspective, complementing the topologist's view from a previous keynote. Learn about procedural logic, concrete examples in code, and the application of concepts like the Game of Truth, Borel Theorem, and Euclidean Geometry to programming. Enhance your understanding of the intricate relationship between programming and mathematical logic in this comprehensive exploration of the truth of procedures.

Introduction
Procedural logic
Sentences
Code
Concrete Example
Initializing an Integer
CanMultiply
Consistency
Decrement
Epilogue
Game of Truth
Borel Theorem
Euclidean Geometry
Hard Rules
Boolean Claims
The Game of Necessity
New Game