Write a Blog >>
ICFP 2019
Sun 18 - Fri 23 August 2019 Berlin, Germany
Thu 22 Aug 2019 17:40 - 18:05 at Pine - Session 5 Chair(s): Edwin Brady

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 Aug
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

16:50 - 18:15
Session 5ML at Pine
Chair(s): Edwin BradyUniversity of St. Andrews, UK
16:50
25m
Talk
Compiling Successor ML Pattern Guards
ML
John ReppyUniversity of Chicago, Mona ZahirUniversity of Chicago
Pre-print
17:15
25m
Talk
A Key-Value store for OCaml
ML
Tom RidgeUniversity of Leicester, UK
File Attached
17:40
25m
Talk
Towards Machine Learning Induction in Poly/ML
ML
Yutaka NagashimaData61, Australia
File Attached