Induction lies at the heart of mathematics and computer science. However, automated theorem proving of inductive problems is still limited in its power. In this abstract, we first summarize our progress in automating inductive theorem proving for Isabelle/HOL. Then, we present MeLoId, our approach to suggesting promising applications of induction without completing a proof search. Our tools are mostly written in Poly/ML, Isabelle’s implementation language.
Thu 22 AugDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
16:50 - 18:15
|Compiling Successor ML Pattern Guards|
|A Key-Value store for OCaml|
Tom Ridge University of Leicester, UKFile Attached
|Towards Machine Learning Induction in Poly/ML|
Yutaka Nagashima Data61, AustraliaFile Attached