Blogs (28) >>
ICFP 2017
Sun 3 - Sat 9 September 2017 Oxford, United Kingdom
Thu 7 Sep 2017 14:50 - 15:15 at L3 - Programming language design

Abductive reasoning is a form of logical inference which seeks to uncover all possible causes of an observation. We show how abduction has a computational counterpart, like many other proof-theoretic concepts: namely the identification and modification of certain constants in a term. Abductive computation can be used to improve the behaviour of a term in some programmer-defined sense, like a typical workflow of optimisation problems including some machine-learning tasks. The emphasis of this progress report is a type system for abductive computation. It is intended to guarantee observably deterministic behaviour of programs, even though abduction may introduce a degree of computational nondeterminism.

Thu 7 Sep

14:00 - 15:15: ML 2017 - Programming language design at L3
mlfamilyworkshop-2017-papers150478560000014:00 - 14:25
mlfamilyworkshop-2017-papers150478710000014:25 - 14:50
mlfamilyworkshop-2017-papers150478860000014:50 - 15:15