University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Semi-Automatic Asymptotics in Isabelle/HOL

Semi-Automatic Asymptotics in Isabelle/HOL

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

BPR - Big proof

Computer Algebra Systems can easily compute limits and
asymptotic expansions of complicated real functions; interactive theorem
provers, on the other hand, provide very little support for such problems and
proving asymptotic properties of a function often involves long and tedious
manual proofs.

 

In this talk, I will present my work about bringing
automation for real-valued asymptotics to Isabelle/HOL using multiseries
expansions.

This yields a procedure to automatically prove limits and
‘Big-O'

estimates of real-valued functions similarly to computer
algebra systems like Mathematica and Maple – but while proving every step of
the process correct.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity