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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Semi-Automatic Asymptotics in Isabelle/HOL

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Hepatology Research Seminars Bateman Auditorium, Caius Webinar & FW11, Computer Laboratory, William Gates Building.

Other talks

Title TBC TBC Scattering Plenty: the people who made the modern countryside Group Work Shining a light on the origin of supermassive black holes with cosmological simulations Group Presentation 3
 

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