Barbie makes it to computer class just before the bell rings. As soon as class begins, Barbie raises her hand. "Yes, Barbie?" asks Ms. Smith, the teacher. "If recursion and induction are analogous, is it possible to write inductive proofs inside of a programming language?" asks Barbie.