Dana S. Scott Discusses the Creation of the Logic of Computable Functions

Dana S. Scott, winner of the Association for Computing Machinery's A.M. Turing Award, tells how he came up with the Logic of Computable Functions during a sabbatical in Oxford, while trying to convince Christopher Strachey that using type-free lambda calculus for modelling was a mistake. This clip is taken from an interview conducted by Gordon Plotkin for the ACM between November 12, 2020 and February 18, 2021. Video of the full interview is available as part of Scott’s ACM profile at https://amturing.acm.org/award_winners/scott_1193622.cfm.