Derivation and Computation

The two notions of proofs and calculations are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. This volume explores this key relationship and introduces simple type theory. Starting from the familiar propositional calculus, the author develops the central idea of an applied lambda-calculus.