From Programming-by-Example to Proving-by-Example

In the machine learning community, it is widely recognized that there are two fundamentally different approaches to learning: inductive learning and deductive learning. This paper formalizes both of the approaches to learning under a uniform framework of type theory and investigates the use of higher-order unification to solve learning problems in both.